/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 12:50:37,347 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 12:50:37,349 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 12:50:37,360 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 12:50:37,360 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 12:50:37,361 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 12:50:37,362 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 12:50:37,364 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 12:50:37,365 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 12:50:37,366 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 12:50:37,367 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 12:50:37,368 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 12:50:37,368 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 12:50:37,369 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 12:50:37,370 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 12:50:37,371 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 12:50:37,372 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 12:50:37,373 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 12:50:37,374 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 12:50:37,376 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 12:50:37,377 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 12:50:37,378 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 12:50:37,379 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 12:50:37,380 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 12:50:37,382 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 12:50:37,382 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 12:50:37,383 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 12:50:37,383 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 12:50:37,384 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 12:50:37,385 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 12:50:37,385 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 12:50:37,385 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 12:50:37,386 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 12:50:37,387 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 12:50:37,388 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 12:50:37,388 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 12:50:37,389 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 12:50:37,389 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 12:50:37,389 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 12:50:37,390 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 12:50:37,390 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 12:50:37,391 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-07-01 12:50:37,404 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 12:50:37,405 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 12:50:37,406 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 12:50:37,406 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 12:50:37,406 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 12:50:37,406 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:50:37,406 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 12:50:37,407 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 12:50:37,407 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 12:50:37,407 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 12:50:37,407 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 12:50:37,407 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 12:50:37,407 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 12:50:37,408 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 12:50:37,408 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:50:37,408 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 12:50:37,408 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 12:50:37,408 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 12:50:37,409 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 12:50:37,409 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 12:50:37,409 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 12:50:37,409 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 12:50:37,409 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 12:50:37,409 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 12:50:37,410 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:50:37,410 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 12:50:37,410 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 12:50:37,410 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 12:50:37,410 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 12:50:37,577 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 12:50:37,591 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 12:50:37,595 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 12:50:37,596 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 12:50:37,597 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 12:50:37,598 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 12:50:37,666 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_6_y_N4/tmp/8515d473f9ac410ea83923253a21a447/FLAG3379284a3 [2020-07-01 12:50:38,015 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 12:50:38,016 INFO L160 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 12:50:38,016 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 12:50:38,022 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_6_y_N4/tmp/8515d473f9ac410ea83923253a21a447/FLAG3379284a3 [2020-07-01 12:50:38,425 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/BenchExec_run_6_y_N4/tmp/8515d473f9ac410ea83923253a21a447 [2020-07-01 12:50:38,437 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 12:50:38,438 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 12:50:38,439 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 12:50:38,439 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 12:50:38,443 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 12:50:38,444 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:50:38" (1/1) ... [2020-07-01 12:50:38,447 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@341209e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:50:38, skipping insertion in model container [2020-07-01 12:50:38,447 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:50:38" (1/1) ... [2020-07-01 12:50:38,455 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 12:50:38,472 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 12:50:38,702 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:50:38,713 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 12:50:38,732 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:50:38,747 INFO L208 MainTranslator]: Completed translation [2020-07-01 12:50:38,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:50:38 WrapperNode [2020-07-01 12:50:38,748 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 12:50:38,749 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 12:50:38,749 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 12:50:38,749 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 12:50:38,759 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:50:38" (1/1) ... [2020-07-01 12:50:38,768 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:50:38" (1/1) ... [2020-07-01 12:50:38,790 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 12:50:38,790 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 12:50:38,790 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 12:50:38,790 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 12:50:38,801 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:50:38" (1/1) ... [2020-07-01 12:50:38,801 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:50:38" (1/1) ... [2020-07-01 12:50:38,803 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:50:38" (1/1) ... [2020-07-01 12:50:38,803 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:50:38" (1/1) ... [2020-07-01 12:50:38,809 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:50:38" (1/1) ... [2020-07-01 12:50:38,814 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:50:38" (1/1) ... [2020-07-01 12:50:38,816 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:50:38" (1/1) ... [2020-07-01 12:50:38,818 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 12:50:38,818 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 12:50:38,819 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 12:50:38,819 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 12:50:38,820 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:50:38" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:50:38,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 12:50:38,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 12:50:38,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 12:50:38,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 12:50:38,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 12:50:38,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 12:50:39,146 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 12:50:39,147 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-01 12:50:39,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:50:39 BoogieIcfgContainer [2020-07-01 12:50:39,151 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 12:50:39,151 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 12:50:39,151 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 12:50:39,153 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 12:50:39,154 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:50:39" (1/1) ... [2020-07-01 12:50:39,168 INFO L313 BlockEncoder]: Initial Icfg 37 locations, 43 edges [2020-07-01 12:50:39,170 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 12:50:39,170 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 12:50:39,171 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 12:50:39,171 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:50:39,173 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 12:50:39,174 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 12:50:39,174 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 12:50:39,197 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 12:50:39,226 INFO L200 BlockEncoder]: SBE split 16 edges [2020-07-01 12:50:39,231 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility [2020-07-01 12:50:39,233 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:50:39,269 INFO L100 BaseMinimizeStates]: Removed 16 edges and 8 locations by large block encoding [2020-07-01 12:50:39,271 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-07-01 12:50:39,273 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 12:50:39,273 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:50:39,274 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 12:50:39,274 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 12:50:39,275 INFO L313 BlockEncoder]: Encoded RCFG 28 locations, 48 edges [2020-07-01 12:50:39,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:50:39 BasicIcfg [2020-07-01 12:50:39,275 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 12:50:39,276 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 12:50:39,277 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 12:50:39,280 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 12:50:39,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 12:50:38" (1/4) ... [2020-07-01 12:50:39,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41e887f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:50:39, skipping insertion in model container [2020-07-01 12:50:39,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:50:38" (2/4) ... [2020-07-01 12:50:39,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41e887f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:50:39, skipping insertion in model container [2020-07-01 12:50:39,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:50:39" (3/4) ... [2020-07-01 12:50:39,282 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41e887f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:50:39, skipping insertion in model container [2020-07-01 12:50:39,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:50:39" (4/4) ... [2020-07-01 12:50:39,284 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:50:39,294 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 12:50:39,302 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2020-07-01 12:50:39,315 INFO L251 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2020-07-01 12:50:39,339 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 12:50:39,339 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 12:50:39,339 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:50:39,339 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:50:39,340 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:50:39,340 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 12:50:39,340 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:50:39,340 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 12:50:39,355 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2020-07-01 12:50:39,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:50:39,361 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:50:39,362 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:50:39,363 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:50:39,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:50:39,368 INFO L82 PathProgramCache]: Analyzing trace with hash 186803813, now seen corresponding path program 1 times [2020-07-01 12:50:39,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:50:39,379 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966843903] [2020-07-01 12:50:39,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:50:39,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:50:39,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:50:39,548 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966843903] [2020-07-01 12:50:39,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:50:39,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:50:39,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915790806] [2020-07-01 12:50:39,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:50:39,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:50:39,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:50:39,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:50:39,573 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 3 states. [2020-07-01 12:50:39,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:50:39,693 INFO L93 Difference]: Finished difference Result 28 states and 48 transitions. [2020-07-01 12:50:39,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:50:39,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:50:39,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:50:39,708 INFO L225 Difference]: With dead ends: 28 [2020-07-01 12:50:39,708 INFO L226 Difference]: Without dead ends: 21 [2020-07-01 12:50:39,711 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:50:39,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-01 12:50:39,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-01 12:50:39,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-01 12:50:39,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 34 transitions. [2020-07-01 12:50:39,748 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 34 transitions. Word has length 5 [2020-07-01 12:50:39,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:50:39,748 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 34 transitions. [2020-07-01 12:50:39,748 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:50:39,748 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 34 transitions. [2020-07-01 12:50:39,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:50:39,749 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:50:39,749 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:50:39,751 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 12:50:39,751 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:50:39,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:50:39,751 INFO L82 PathProgramCache]: Analyzing trace with hash 186803815, now seen corresponding path program 1 times [2020-07-01 12:50:39,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:50:39,752 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644811589] [2020-07-01 12:50:39,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:50:39,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:50:39,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:50:39,790 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644811589] [2020-07-01 12:50:39,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:50:39,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:50:39,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233431153] [2020-07-01 12:50:39,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:50:39,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:50:39,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:50:39,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:50:39,794 INFO L87 Difference]: Start difference. First operand 21 states and 34 transitions. Second operand 3 states. [2020-07-01 12:50:39,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:50:39,922 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2020-07-01 12:50:39,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:50:39,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:50:39,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:50:39,940 INFO L225 Difference]: With dead ends: 46 [2020-07-01 12:50:39,941 INFO L226 Difference]: Without dead ends: 39 [2020-07-01 12:50:39,942 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:50:39,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-01 12:50:39,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2020-07-01 12:50:39,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-01 12:50:39,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 56 transitions. [2020-07-01 12:50:39,949 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 56 transitions. Word has length 5 [2020-07-01 12:50:39,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:50:39,949 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 56 transitions. [2020-07-01 12:50:39,949 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:50:39,950 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 56 transitions. [2020-07-01 12:50:39,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:50:39,950 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:50:39,950 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:50:39,950 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 12:50:39,951 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:50:39,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:50:39,951 INFO L82 PathProgramCache]: Analyzing trace with hash 186803816, now seen corresponding path program 1 times [2020-07-01 12:50:39,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:50:39,951 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833830286] [2020-07-01 12:50:39,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:50:39,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:50:40,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:50:40,003 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833830286] [2020-07-01 12:50:40,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:50:40,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:50:40,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317943222] [2020-07-01 12:50:40,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:50:40,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:50:40,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:50:40,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:50:40,005 INFO L87 Difference]: Start difference. First operand 32 states and 56 transitions. Second operand 4 states. [2020-07-01 12:50:40,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:50:40,133 INFO L93 Difference]: Finished difference Result 39 states and 56 transitions. [2020-07-01 12:50:40,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:50:40,134 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-07-01 12:50:40,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:50:40,135 INFO L225 Difference]: With dead ends: 39 [2020-07-01 12:50:40,135 INFO L226 Difference]: Without dead ends: 32 [2020-07-01 12:50:40,135 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:50:40,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-01 12:50:40,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-07-01 12:50:40,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-01 12:50:40,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 49 transitions. [2020-07-01 12:50:40,141 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 49 transitions. Word has length 5 [2020-07-01 12:50:40,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:50:40,141 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 49 transitions. [2020-07-01 12:50:40,141 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:50:40,141 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 49 transitions. [2020-07-01 12:50:40,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-01 12:50:40,142 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:50:40,142 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:50:40,142 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 12:50:40,143 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:50:40,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:50:40,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1551395682, now seen corresponding path program 1 times [2020-07-01 12:50:40,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:50:40,144 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426771178] [2020-07-01 12:50:40,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:50:40,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:50:40,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:50:40,200 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426771178] [2020-07-01 12:50:40,200 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862055427] [2020-07-01 12:50:40,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:50:40,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:50:40,245 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 12:50:40,251 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:50:40,323 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:50:40,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 12:50:40,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [3] total 7 [2020-07-01 12:50:40,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323058149] [2020-07-01 12:50:40,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 12:50:40,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:50:40,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 12:50:40,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-01 12:50:40,326 INFO L87 Difference]: Start difference. First operand 32 states and 49 transitions. Second operand 5 states. [2020-07-01 12:50:40,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:50:40,479 INFO L93 Difference]: Finished difference Result 63 states and 96 transitions. [2020-07-01 12:50:40,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 12:50:40,480 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-07-01 12:50:40,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:50:40,481 INFO L225 Difference]: With dead ends: 63 [2020-07-01 12:50:40,481 INFO L226 Difference]: Without dead ends: 32 [2020-07-01 12:50:40,481 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-01 12:50:40,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-01 12:50:40,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-07-01 12:50:40,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-01 12:50:40,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 48 transitions. [2020-07-01 12:50:40,487 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 48 transitions. Word has length 11 [2020-07-01 12:50:40,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:50:40,487 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 48 transitions. [2020-07-01 12:50:40,487 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 12:50:40,488 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 48 transitions. [2020-07-01 12:50:40,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-01 12:50:40,488 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:50:40,488 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:50:40,689 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:50:40,689 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:50:40,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:50:40,690 INFO L82 PathProgramCache]: Analyzing trace with hash 2112606383, now seen corresponding path program 1 times [2020-07-01 12:50:40,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:50:40,690 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405394736] [2020-07-01 12:50:40,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:50:40,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:50:40,740 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:50:40,740 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405394736] [2020-07-01 12:50:40,741 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779584484] [2020-07-01 12:50:40,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:50:40,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:50:40,775 INFO L264 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 12:50:40,776 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:50:40,811 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:50:40,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 12:50:40,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2020-07-01 12:50:40,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185965236] [2020-07-01 12:50:40,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:50:40,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:50:40,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:50:40,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-07-01 12:50:40,813 INFO L87 Difference]: Start difference. First operand 32 states and 48 transitions. Second operand 4 states. [2020-07-01 12:50:40,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:50:40,890 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2020-07-01 12:50:40,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:50:40,891 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-07-01 12:50:40,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:50:40,892 INFO L225 Difference]: With dead ends: 39 [2020-07-01 12:50:40,892 INFO L226 Difference]: Without dead ends: 32 [2020-07-01 12:50:40,892 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-07-01 12:50:40,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-01 12:50:40,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-07-01 12:50:40,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-01 12:50:40,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2020-07-01 12:50:40,896 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 11 [2020-07-01 12:50:40,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:50:40,897 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2020-07-01 12:50:40,897 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:50:40,897 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2020-07-01 12:50:40,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-01 12:50:40,898 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:50:40,898 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:50:41,099 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:50:41,099 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:50:41,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:50:41,100 INFO L82 PathProgramCache]: Analyzing trace with hash 2112606384, now seen corresponding path program 1 times [2020-07-01 12:50:41,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:50:41,100 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735168925] [2020-07-01 12:50:41,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:50:41,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:50:41,159 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 12:50:41,160 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735168925] [2020-07-01 12:50:41,160 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066629700] [2020-07-01 12:50:41,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:50:41,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:50:41,200 INFO L264 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 15 conjunts are in the unsatisfiable core [2020-07-01 12:50:41,201 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:50:41,250 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2020-07-01 12:50:41,250 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:50:41,263 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:50:41,269 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:50:41,269 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:22 [2020-07-01 12:50:41,312 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 12:50:41,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:50:41,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2020-07-01 12:50:41,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262899663] [2020-07-01 12:50:41,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-01 12:50:41,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:50:41,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-01 12:50:41,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-01 12:50:41,314 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand 6 states. [2020-07-01 12:50:41,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:50:41,472 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2020-07-01 12:50:41,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:50:41,473 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-07-01 12:50:41,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:50:41,473 INFO L225 Difference]: With dead ends: 32 [2020-07-01 12:50:41,473 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 12:50:41,474 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-07-01 12:50:41,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 12:50:41,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 12:50:41,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 12:50:41,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 12:50:41,475 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2020-07-01 12:50:41,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:50:41,475 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:50:41,475 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-01 12:50:41,475 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 12:50:41,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 12:50:41,676 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:50:41,678 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 12:50:41,853 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2020-07-01 12:50:41,857 INFO L268 CegarLoopResult]: For program point L17(line 17) no Hoare annotation was computed. [2020-07-01 12:50:41,857 INFO L268 CegarLoopResult]: For program point L13(line 13) no Hoare annotation was computed. [2020-07-01 12:50:41,857 INFO L268 CegarLoopResult]: For program point L13-1(lines 13 15) no Hoare annotation was computed. [2020-07-01 12:50:41,857 INFO L268 CegarLoopResult]: For program point L11(line 11) no Hoare annotation was computed. [2020-07-01 12:50:41,858 INFO L268 CegarLoopResult]: For program point L11-1(lines 11 15) no Hoare annotation was computed. [2020-07-01 12:50:41,858 INFO L264 CegarLoopResult]: At program point L9-2(lines 9 21) the Hoare annotation is: (let ((.cse10 (select |#length| ULTIMATE.start_test_fun_~a.base))) (let ((.cse3 (= 0 (mod (* .cse10 3) (- 4)))) (.cse5 (<= ULTIMATE.start_test_fun_~N (div (* .cse10 (- 1)) (- 4)))) (.cse7 (<= 1 ULTIMATE.start_test_fun_~i~0)) (.cse0 (= 1 (select |#valid| ULTIMATE.start_test_fun_~a.base))) (.cse1 (<= 4 .cse10)) (.cse2 (<= 1 ULTIMATE.start_main_~array_size~0)) (.cse8 (<= ULTIMATE.start_main_~array_size~0 1)) (.cse9 (<= ULTIMATE.start_test_fun_~N 1)) (.cse4 (= 0 ULTIMATE.start_test_fun_~a.offset)) (.cse6 (<= 0 ULTIMATE.start_test_fun_~i~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7) (and .cse0 .cse2 .cse8 .cse9 .cse7) (and .cse0 .cse1 .cse2 .cse8 .cse9 .cse4 .cse6)))) [2020-07-01 12:50:41,858 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 12:50:41,858 INFO L268 CegarLoopResult]: For program point L26(lines 26 28) no Hoare annotation was computed. [2020-07-01 12:50:41,858 INFO L268 CegarLoopResult]: For program point L26-2(lines 26 28) no Hoare annotation was computed. [2020-07-01 12:50:41,859 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 12:50:41,859 INFO L268 CegarLoopResult]: For program point L18(line 18) no Hoare annotation was computed. [2020-07-01 12:50:41,859 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 12:50:41,859 INFO L268 CegarLoopResult]: For program point L16(lines 16 19) no Hoare annotation was computed. [2020-07-01 12:50:41,859 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 12:50:41,859 INFO L268 CegarLoopResult]: For program point L18-2(line 18) no Hoare annotation was computed. [2020-07-01 12:50:41,859 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 12:50:41,859 INFO L268 CegarLoopResult]: For program point L16-2(lines 9 21) no Hoare annotation was computed. [2020-07-01 12:50:41,860 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 12:50:41,860 INFO L268 CegarLoopResult]: For program point L16-3(lines 16 19) no Hoare annotation was computed. [2020-07-01 12:50:41,860 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:50:41,860 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:50:41,860 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 12:50:41,860 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:50:41,860 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:50:41,860 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 12:50:41,860 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:50:41,861 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:50:41,861 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 12:50:41,863 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 12:50:41,873 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:50:41,874 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:50:41,874 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:50:41,874 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:50:41,874 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:50:41,875 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:50:41,896 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:50:41,896 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:50:41,897 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:50:41,897 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:50:41,897 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:50:41,897 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:50:41,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:50:41 BasicIcfg [2020-07-01 12:50:41,900 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 12:50:41,901 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 12:50:41,901 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 12:50:41,905 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 12:50:41,905 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:50:41,906 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 12:50:38" (1/5) ... [2020-07-01 12:50:41,906 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@71c34bb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:50:41, skipping insertion in model container [2020-07-01 12:50:41,906 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:50:41,906 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:50:38" (2/5) ... [2020-07-01 12:50:41,907 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@71c34bb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:50:41, skipping insertion in model container [2020-07-01 12:50:41,907 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:50:41,907 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:50:39" (3/5) ... [2020-07-01 12:50:41,907 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@71c34bb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:50:41, skipping insertion in model container [2020-07-01 12:50:41,907 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:50:41,908 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:50:39" (4/5) ... [2020-07-01 12:50:41,908 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@71c34bb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:50:41, skipping insertion in model container [2020-07-01 12:50:41,908 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:50:41,908 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:50:41" (5/5) ... [2020-07-01 12:50:41,910 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:50:41,931 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 12:50:41,931 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 12:50:41,931 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:50:41,932 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:50:41,932 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:50:41,932 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 12:50:41,932 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:50:41,932 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 12:50:41,936 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2020-07-01 12:50:41,940 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-07-01 12:50:41,941 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:50:41,941 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:50:41,945 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-01 12:50:41,945 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:50:41,945 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 12:50:41,945 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2020-07-01 12:50:41,947 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-07-01 12:50:41,947 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:50:41,947 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:50:41,948 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-01 12:50:41,948 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:50:41,953 INFO L794 eck$LassoCheckResult]: Stem: 26#ULTIMATE.startENTRYtrue [168] ULTIMATE.startENTRY-->L26: Formula: (and (= 0 |v_#NULL.base_2|) (< 0 |v_#StackHeapBarrier_3|) (= 0 |v_#NULL.offset_2|) (= |v_#valid_21| (store |v_#valid_22| 0 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_5|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_3|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_5|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_21|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_6|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_#t~malloc8.offset, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet7, #NULL.base] 19#L26true [116] L26-->L26-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 30#L26-2true [137] L26-2-->L9-2: Formula: (and (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc8.base_4|)) (= v_ULTIMATE.start_test_fun_~i~0_3 0) (= |v_ULTIMATE.start_test_fun_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (> 0 |v_ULTIMATE.start_main_#t~malloc8.base_4|) (= |v_#length_1| (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc8.base_4| (* v_ULTIMATE.start_main_~array_size~0_7 4))) (= 0 |v_ULTIMATE.start_main_#t~malloc8.offset_4|) (= v_ULTIMATE.start_test_fun_~a.offset_1 |v_ULTIMATE.start_test_fun_#in~a.offset_1|) (= |v_ULTIMATE.start_test_fun_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (= (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc8.base_4| 1) |v_#valid_5|) (= v_ULTIMATE.start_test_fun_~a.base_1 |v_ULTIMATE.start_test_fun_#in~a.base_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_4|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_4|) (= |v_ULTIMATE.start_test_fun_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2) (= v_ULTIMATE.start_test_fun_~N_1 |v_ULTIMATE.start_test_fun_#in~N_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc8.base_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_2|, #valid=|v_#valid_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_4|, ULTIMATE.start_test_fun_#in~a.base=|v_ULTIMATE.start_test_fun_#in~a.base_1|, ULTIMATE.start_test_fun_~res~0=v_ULTIMATE.start_test_fun_~res~0_1, ULTIMATE.start_test_fun_#t~post0=|v_ULTIMATE.start_test_fun_#t~post0_3|, ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_1, ULTIMATE.start_test_fun_#in~N=|v_ULTIMATE.start_test_fun_#in~N_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_1, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_1|, ULTIMATE.start_test_fun_#in~a.offset=|v_ULTIMATE.start_test_fun_#in~a.offset_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#t~post6=|v_ULTIMATE.start_test_fun_#t~post6_1|, ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_1|, #valid=|v_#valid_5|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_4|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_1, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_3} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_test_fun_#in~a.base, ULTIMATE.start_test_fun_~res~0, ULTIMATE.start_test_fun_#t~post0, ULTIMATE.start_test_fun_~a.offset, ULTIMATE.start_test_fun_#in~N, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_~a.base, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#in~a.offset, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~post6, ULTIMATE.start_test_fun_#t~mem1, #valid, ULTIMATE.start_main_#t~malloc8.offset, ULTIMATE.start_main_~numbers~0.base, ULTIMATE.start_main_~numbers~0.offset, #length, ULTIMATE.start_test_fun_~N, ULTIMATE.start_test_fun_~i~0] 7#L9-2true [2020-07-01 12:50:41,953 INFO L796 eck$LassoCheckResult]: Loop: 7#L9-2true [83] L9-2-->L11: Formula: (and (< v_ULTIMATE.start_test_fun_~i~0_7 v_ULTIMATE.start_test_fun_~N_4) (= v_ULTIMATE.start_test_fun_~res~0_3 1)) InVars {ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_4, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_7} OutVars{ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_4, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_7, ULTIMATE.start_test_fun_~res~0=v_ULTIMATE.start_test_fun_~res~0_3} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~res~0] 27#L11true [106] L11-->L11-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_test_fun_~i~0_8))) (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_test_fun_~a.base_3)) (= |v_ULTIMATE.start_test_fun_#t~mem1_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_test_fun_~a.base_3) (+ v_ULTIMATE.start_test_fun_~a.offset_3 (* v_ULTIMATE.start_test_fun_~i~0_8 4)))) (<= (+ v_ULTIMATE.start_test_fun_~a.offset_3 .cse0 4) (select |v_#length_3| v_ULTIMATE.start_test_fun_~a.base_3)) (<= 0 (+ v_ULTIMATE.start_test_fun_~a.offset_3 .cse0)))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_3, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_8} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_3, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_3, ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem1] 25#L11-1true [103] L11-1-->L16-2: Formula: (and (= 0 |v_ULTIMATE.start_test_fun_#t~mem1_4|) (= v_ULTIMATE.start_test_fun_~res~0_4 1)) InVars {ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_4|} OutVars{ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_3|, ULTIMATE.start_test_fun_~res~0=v_ULTIMATE.start_test_fun_~res~0_4} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem1, ULTIMATE.start_test_fun_~res~0] 17#L16-2true [94] L16-2-->L16: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_test_fun_~i~0_12))) (and (<= 0 (+ v_ULTIMATE.start_test_fun_~a.offset_7 .cse0)) (<= (+ v_ULTIMATE.start_test_fun_~a.offset_7 .cse0 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~a.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_test_fun_~a.base_9) (+ v_ULTIMATE.start_test_fun_~a.offset_7 (* v_ULTIMATE.start_test_fun_~i~0_12 4)))) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~a.base_9)))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_7, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_9, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_12} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_7, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_9, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 4#L16true [128] L16-->L16-3: Formula: (>= 0 |v_ULTIMATE.start_test_fun_#t~mem3_4|) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_4|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 15#L16-3true [173] L16-3-->L9-2: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_test_fun_~i~0_27))) (and (= (+ v_ULTIMATE.start_test_fun_~i~0_27 1) v_ULTIMATE.start_test_fun_~i~0_26) (= 1 (select |v_#valid_30| v_ULTIMATE.start_test_fun_~a.base_25)) (= (store |v_#memory_int_12| v_ULTIMATE.start_test_fun_~a.base_25 (store (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~a.base_25) (+ (* v_ULTIMATE.start_test_fun_~i~0_27 4) v_ULTIMATE.start_test_fun_~a.offset_18) v_ULTIMATE.start_test_fun_~res~0_11)) |v_#memory_int_11|) (<= (+ .cse0 v_ULTIMATE.start_test_fun_~a.offset_18 4) (select |v_#length_18| v_ULTIMATE.start_test_fun_~a.base_25)) (<= 0 (+ .cse0 v_ULTIMATE.start_test_fun_~a.offset_18)))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_18, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_25, ULTIMATE.start_test_fun_~res~0=v_ULTIMATE.start_test_fun_~res~0_11, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_27} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_18, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_25, ULTIMATE.start_test_fun_~res~0=v_ULTIMATE.start_test_fun_~res~0_11, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_#t~post0=|v_ULTIMATE.start_test_fun_#t~post0_4|, #length=|v_#length_18|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_26} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~post0, ULTIMATE.start_test_fun_~i~0] 7#L9-2true [2020-07-01 12:50:41,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:50:41,954 INFO L82 PathProgramCache]: Analyzing trace with hash 194972, now seen corresponding path program 1 times [2020-07-01 12:50:41,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:50:41,955 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457435767] [2020-07-01 12:50:41,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:50:41,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:50:41,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:50:41,971 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457435767] [2020-07-01 12:50:41,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:50:41,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-07-01 12:50:41,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356114852] [2020-07-01 12:50:41,972 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 12:50:41,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:50:41,972 INFO L82 PathProgramCache]: Analyzing trace with hash -930187908, now seen corresponding path program 1 times [2020-07-01 12:50:41,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:50:41,973 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422781061] [2020-07-01 12:50:41,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:50:41,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:50:41,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:50:42,001 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:50:42,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:50:42,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:50:42,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:50:42,076 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 3 states. [2020-07-01 12:50:42,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:50:42,117 INFO L93 Difference]: Finished difference Result 28 states and 47 transitions. [2020-07-01 12:50:42,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:50:42,120 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 12:50:42,123 INFO L168 Benchmark]: Toolchain (without parser) took 3685.59 ms. Allocated memory was 649.6 MB in the beginning and 753.4 MB in the end (delta: 103.8 MB). Free memory was 561.6 MB in the beginning and 677.4 MB in the end (delta: -115.8 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:50:42,124 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 584.3 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:50:42,125 INFO L168 Benchmark]: CACSL2BoogieTranslator took 309.35 ms. Allocated memory was 649.6 MB in the beginning and 689.4 MB in the end (delta: 39.8 MB). Free memory was 561.6 MB in the beginning and 652.5 MB in the end (delta: -90.8 MB). Peak memory consumption was 28.7 MB. Max. memory is 50.3 GB. [2020-07-01 12:50:42,125 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.06 ms. Allocated memory is still 689.4 MB. Free memory was 652.5 MB in the beginning and 649.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. [2020-07-01 12:50:42,126 INFO L168 Benchmark]: Boogie Preprocessor took 27.95 ms. Allocated memory is still 689.4 MB. Free memory was 649.8 MB in the beginning and 648.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-07-01 12:50:42,126 INFO L168 Benchmark]: RCFGBuilder took 332.32 ms. Allocated memory is still 689.4 MB. Free memory was 648.4 MB in the beginning and 623.6 MB in the end (delta: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 50.3 GB. [2020-07-01 12:50:42,127 INFO L168 Benchmark]: BlockEncodingV2 took 124.27 ms. Allocated memory is still 689.4 MB. Free memory was 623.6 MB in the beginning and 614.2 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. [2020-07-01 12:50:42,127 INFO L168 Benchmark]: TraceAbstraction took 2624.11 ms. Allocated memory was 689.4 MB in the beginning and 753.4 MB in the end (delta: 64.0 MB). Free memory was 612.8 MB in the beginning and 709.6 MB in the end (delta: -96.8 MB). Peak memory consumption was 231.2 MB. Max. memory is 50.3 GB. [2020-07-01 12:50:42,128 INFO L168 Benchmark]: BuchiAutomizer took 221.04 ms. Allocated memory is still 753.4 MB. Free memory was 709.6 MB in the beginning and 677.4 MB in the end (delta: 32.3 MB). Peak memory consumption was 32.3 MB. Max. memory is 50.3 GB. [2020-07-01 12:50:42,132 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 37 locations, 43 edges - StatisticsResult: Encoded RCFG 28 locations, 48 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 584.3 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 309.35 ms. Allocated memory was 649.6 MB in the beginning and 689.4 MB in the end (delta: 39.8 MB). Free memory was 561.6 MB in the beginning and 652.5 MB in the end (delta: -90.8 MB). Peak memory consumption was 28.7 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 41.06 ms. Allocated memory is still 689.4 MB. Free memory was 652.5 MB in the beginning and 649.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 27.95 ms. Allocated memory is still 689.4 MB. Free memory was 649.8 MB in the beginning and 648.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * RCFGBuilder took 332.32 ms. Allocated memory is still 689.4 MB. Free memory was 648.4 MB in the beginning and 623.6 MB in the end (delta: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 124.27 ms. Allocated memory is still 689.4 MB. Free memory was 623.6 MB in the beginning and 614.2 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. * TraceAbstraction took 2624.11 ms. Allocated memory was 689.4 MB in the beginning and 753.4 MB in the end (delta: 64.0 MB). Free memory was 612.8 MB in the beginning and 709.6 MB in the end (delta: -96.8 MB). Peak memory consumption was 231.2 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 221.04 ms. Allocated memory is still 753.4 MB. Free memory was 709.6 MB in the beginning and 677.4 MB in the end (delta: 32.3 MB). Peak memory consumption was 32.3 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold - InvariantResult [Line: 9]: Loop Invariant [2020-07-01 12:50:42,141 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:50:42,141 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:50:42,141 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:50:42,142 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:50:42,142 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:50:42,142 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:50:42,144 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:50:42,144 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:50:42,144 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:50:42,144 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:50:42,144 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:50:42,145 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((1 == \valid[a] && 4 <= unknown-#length-unknown[a]) && 1 <= array_size) && 0 == unknown-#length-unknown[a] * 3 % -4) && 0 == a) && N <= unknown-#length-unknown[a] * -1 / -4) && 0 <= i) || (((((1 == \valid[a] && 1 <= array_size) && 0 == unknown-#length-unknown[a] * 3 % -4) && 0 == a) && N <= unknown-#length-unknown[a] * -1 / -4) && 1 <= i)) || ((((1 == \valid[a] && 1 <= array_size) && array_size <= 1) && N <= 1) && 1 <= i)) || ((((((1 == \valid[a] && 4 <= unknown-#length-unknown[a]) && 1 <= array_size) && array_size <= 1) && N <= 1) && 0 == a) && 0 <= i) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 28 locations, 14 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 2.3s, OverallIterations: 6, TraceHistogramMax: 2, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 32 SDtfs, 211 SDslu, 85 SDs, 0 SdLazy, 309 SolverSat, 49 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 7 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 5 NumberOfFragments, 116 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 12 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 81 NumberOfCodeBlocks, 81 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 72 ConstructedInterpolants, 0 QuantifiedInterpolants, 5224 SizeOfPredicates, 16 NumberOfNonLiveVariables, 200 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 6/12 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !SESSION 2020-07-01 12:50:35.163 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp/BenchExec_run_6_y_N4/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 12:50:42.369 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check