java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20181015-LoopsPathprograms/sum03_false-unreach-call_true-termination.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2d08e6e [2018-10-15 12:45:23,378 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 12:45:23,380 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 12:45:23,398 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 12:45:23,398 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 12:45:23,399 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 12:45:23,400 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 12:45:23,402 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 12:45:23,404 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 12:45:23,404 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 12:45:23,405 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 12:45:23,406 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 12:45:23,406 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 12:45:23,407 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 12:45:23,409 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 12:45:23,409 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 12:45:23,410 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 12:45:23,412 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 12:45:23,414 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 12:45:23,416 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 12:45:23,417 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 12:45:23,418 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 12:45:23,420 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 12:45:23,421 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 12:45:23,421 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 12:45:23,425 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 12:45:23,426 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 12:45:23,427 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 12:45:23,427 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 12:45:23,429 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 12:45:23,429 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 12:45:23,429 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 12:45:23,430 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 12:45:23,430 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 12:45:23,431 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 12:45:23,431 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 12:45:23,432 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-15 12:45:23,445 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 12:45:23,446 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 12:45:23,446 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 12:45:23,447 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 12:45:23,447 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 12:45:23,447 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 12:45:23,448 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 12:45:23,448 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 12:45:23,448 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 12:45:23,448 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 12:45:23,448 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 12:45:23,449 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 12:45:23,449 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 12:45:23,450 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 12:45:23,450 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 12:45:23,495 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 12:45:23,509 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 12:45:23,514 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 12:45:23,515 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 12:45:23,516 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 12:45:23,516 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/sum03_false-unreach-call_true-termination.i_3.bpl [2018-10-15 12:45:23,517 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/sum03_false-unreach-call_true-termination.i_3.bpl' [2018-10-15 12:45:23,577 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 12:45:23,579 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-15 12:45:23,580 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 12:45:23,580 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 12:45:23,580 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 12:45:23,609 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "sum03_false-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:45:23" (1/1) ... [2018-10-15 12:45:23,611 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "sum03_false-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:45:23" (1/1) ... [2018-10-15 12:45:23,621 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "sum03_false-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:45:23" (1/1) ... [2018-10-15 12:45:23,621 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "sum03_false-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:45:23" (1/1) ... [2018-10-15 12:45:23,626 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "sum03_false-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:45:23" (1/1) ... [2018-10-15 12:45:23,629 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "sum03_false-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:45:23" (1/1) ... [2018-10-15 12:45:23,630 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "sum03_false-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:45:23" (1/1) ... [2018-10-15 12:45:23,633 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 12:45:23,634 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 12:45:23,634 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 12:45:23,634 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 12:45:23,635 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "sum03_false-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:45:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-15 12:45:23,691 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-15 12:45:23,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 12:45:23,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 12:45:23,956 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 12:45:23,957 INFO L202 PluginConnector]: Adding new model sum03_false-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:45:23 BoogieIcfgContainer [2018-10-15 12:45:23,958 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 12:45:23,960 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 12:45:23,960 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 12:45:23,963 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 12:45:23,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sum03_false-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:45:23" (1/2) ... [2018-10-15 12:45:23,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32cfa359 and model type sum03_false-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 12:45:23, skipping insertion in model container [2018-10-15 12:45:23,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sum03_false-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:45:23" (2/2) ... [2018-10-15 12:45:23,966 INFO L112 eAbstractionObserver]: Analyzing ICFG sum03_false-unreach-call_true-termination.i_3.bpl [2018-10-15 12:45:23,979 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 12:45:23,989 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 12:45:24,010 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 12:45:24,077 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 12:45:24,078 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 12:45:24,078 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 12:45:24,078 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 12:45:24,079 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 12:45:24,079 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 12:45:24,079 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 12:45:24,079 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 12:45:24,079 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 12:45:24,102 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-10-15 12:45:24,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-15 12:45:24,112 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:24,113 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:24,114 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:24,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:24,121 INFO L82 PathProgramCache]: Analyzing trace with hash -426572274, now seen corresponding path program 1 times [2018-10-15 12:45:24,186 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:24,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:24,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:24,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 12:45:24,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-15 12:45:24,464 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 12:45:24,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 12:45:24,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-15 12:45:24,484 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 5 states. [2018-10-15 12:45:24,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:24,895 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-10-15 12:45:24,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-15 12:45:24,897 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-10-15 12:45:24,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:24,910 INFO L225 Difference]: With dead ends: 44 [2018-10-15 12:45:24,910 INFO L226 Difference]: Without dead ends: 44 [2018-10-15 12:45:24,912 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-15 12:45:24,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-15 12:45:24,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 29. [2018-10-15 12:45:24,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-15 12:45:24,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-10-15 12:45:24,948 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 18 [2018-10-15 12:45:24,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:24,949 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-10-15 12:45:24,949 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 12:45:24,949 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-10-15 12:45:24,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-15 12:45:24,950 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:24,950 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:24,951 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:24,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:24,951 INFO L82 PathProgramCache]: Analyzing trace with hash 690656242, now seen corresponding path program 1 times [2018-10-15 12:45:24,952 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:24,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:25,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:25,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 12:45:25,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-15 12:45:25,469 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-15 12:45:25,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-15 12:45:25,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-15 12:45:25,470 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 8 states. [2018-10-15 12:45:26,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:26,252 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-10-15 12:45:26,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-15 12:45:26,253 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-10-15 12:45:26,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:26,254 INFO L225 Difference]: With dead ends: 44 [2018-10-15 12:45:26,254 INFO L226 Difference]: Without dead ends: 44 [2018-10-15 12:45:26,256 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2018-10-15 12:45:26,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-15 12:45:26,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2018-10-15 12:45:26,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-15 12:45:26,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-10-15 12:45:26,262 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 19 [2018-10-15 12:45:26,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:26,263 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-10-15 12:45:26,263 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-15 12:45:26,263 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-10-15 12:45:26,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-15 12:45:26,264 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:26,265 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:26,265 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:26,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:26,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1150013352, now seen corresponding path program 1 times [2018-10-15 12:45:26,267 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:26,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:26,547 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:26,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:26,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-15 12:45:26,548 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 12:45:26,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 12:45:26,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-15 12:45:26,549 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 5 states. [2018-10-15 12:45:26,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:26,634 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-10-15 12:45:26,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-15 12:45:26,635 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-10-15 12:45:26,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:26,636 INFO L225 Difference]: With dead ends: 44 [2018-10-15 12:45:26,636 INFO L226 Difference]: Without dead ends: 44 [2018-10-15 12:45:26,637 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-15 12:45:26,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-15 12:45:26,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2018-10-15 12:45:26,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-15 12:45:26,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2018-10-15 12:45:26,643 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 28 [2018-10-15 12:45:26,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:26,644 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2018-10-15 12:45:26,644 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 12:45:26,644 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2018-10-15 12:45:26,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-15 12:45:26,645 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:26,646 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:26,646 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:26,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:26,647 INFO L82 PathProgramCache]: Analyzing trace with hash 981763618, now seen corresponding path program 2 times [2018-10-15 12:45:26,648 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:26,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:26,863 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:26,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:26,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-15 12:45:26,864 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 12:45:26,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 12:45:26,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-15 12:45:26,866 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 7 states. [2018-10-15 12:45:27,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:27,117 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2018-10-15 12:45:27,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-15 12:45:27,118 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2018-10-15 12:45:27,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:27,120 INFO L225 Difference]: With dead ends: 54 [2018-10-15 12:45:27,120 INFO L226 Difference]: Without dead ends: 54 [2018-10-15 12:45:27,120 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-10-15 12:45:27,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-15 12:45:27,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2018-10-15 12:45:27,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-15 12:45:27,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2018-10-15 12:45:27,128 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 38 [2018-10-15 12:45:27,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:27,128 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2018-10-15 12:45:27,128 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 12:45:27,129 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2018-10-15 12:45:27,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-15 12:45:27,130 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:27,130 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:27,131 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:27,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:27,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1855740052, now seen corresponding path program 3 times [2018-10-15 12:45:27,132 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:27,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:27,728 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 24 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:27,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:27,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 12:45:27,729 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 12:45:27,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 12:45:27,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-15 12:45:27,730 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 9 states. [2018-10-15 12:45:28,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:28,089 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2018-10-15 12:45:28,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-15 12:45:28,090 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2018-10-15 12:45:28,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:28,092 INFO L225 Difference]: With dead ends: 64 [2018-10-15 12:45:28,092 INFO L226 Difference]: Without dead ends: 64 [2018-10-15 12:45:28,093 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-10-15 12:45:28,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-10-15 12:45:28,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2018-10-15 12:45:28,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-15 12:45:28,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2018-10-15 12:45:28,100 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 48 [2018-10-15 12:45:28,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:28,101 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2018-10-15 12:45:28,101 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 12:45:28,101 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2018-10-15 12:45:28,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-15 12:45:28,103 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:28,104 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:28,104 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:28,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:28,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1565969354, now seen corresponding path program 4 times [2018-10-15 12:45:28,105 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:28,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:28,349 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 32 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:28,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:28,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 12:45:28,350 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 12:45:28,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 12:45:28,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-10-15 12:45:28,351 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 11 states. [2018-10-15 12:45:29,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:29,054 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2018-10-15 12:45:29,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-15 12:45:29,054 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2018-10-15 12:45:29,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:29,056 INFO L225 Difference]: With dead ends: 74 [2018-10-15 12:45:29,057 INFO L226 Difference]: Without dead ends: 74 [2018-10-15 12:45:29,057 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-10-15 12:45:29,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-15 12:45:29,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2018-10-15 12:45:29,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-10-15 12:45:29,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2018-10-15 12:45:29,064 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 58 [2018-10-15 12:45:29,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:29,064 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2018-10-15 12:45:29,064 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 12:45:29,065 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2018-10-15 12:45:29,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-15 12:45:29,066 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:29,066 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:29,066 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:29,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:29,067 INFO L82 PathProgramCache]: Analyzing trace with hash 803523712, now seen corresponding path program 5 times [2018-10-15 12:45:29,068 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:29,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:29,373 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 40 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:29,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:29,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 12:45:29,374 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 12:45:29,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 12:45:29,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-10-15 12:45:29,375 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand 13 states. [2018-10-15 12:45:29,581 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-15 12:45:30,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:30,010 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2018-10-15 12:45:30,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-15 12:45:30,011 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 68 [2018-10-15 12:45:30,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:30,013 INFO L225 Difference]: With dead ends: 84 [2018-10-15 12:45:30,013 INFO L226 Difference]: Without dead ends: 84 [2018-10-15 12:45:30,014 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-10-15 12:45:30,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-10-15 12:45:30,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2018-10-15 12:45:30,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-10-15 12:45:30,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 83 transitions. [2018-10-15 12:45:30,021 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 83 transitions. Word has length 68 [2018-10-15 12:45:30,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:30,022 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 83 transitions. [2018-10-15 12:45:30,022 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 12:45:30,022 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2018-10-15 12:45:30,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-15 12:45:30,023 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:30,024 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:30,024 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:30,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:30,025 INFO L82 PathProgramCache]: Analyzing trace with hash -2086793142, now seen corresponding path program 6 times [2018-10-15 12:45:30,025 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:30,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:30,358 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 48 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:30,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:30,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 12:45:30,360 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 12:45:30,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 12:45:30,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-10-15 12:45:30,361 INFO L87 Difference]: Start difference. First operand 81 states and 83 transitions. Second operand 15 states. [2018-10-15 12:45:31,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:31,086 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2018-10-15 12:45:31,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-15 12:45:31,086 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 78 [2018-10-15 12:45:31,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:31,088 INFO L225 Difference]: With dead ends: 94 [2018-10-15 12:45:31,089 INFO L226 Difference]: Without dead ends: 94 [2018-10-15 12:45:31,090 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2018-10-15 12:45:31,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-10-15 12:45:31,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2018-10-15 12:45:31,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-15 12:45:31,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 93 transitions. [2018-10-15 12:45:31,098 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 93 transitions. Word has length 78 [2018-10-15 12:45:31,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:31,098 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 93 transitions. [2018-10-15 12:45:31,099 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 12:45:31,099 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 93 transitions. [2018-10-15 12:45:31,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-15 12:45:31,100 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:31,100 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:31,101 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:31,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:31,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1688952940, now seen corresponding path program 7 times [2018-10-15 12:45:31,102 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:31,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:32,166 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 56 proven. 217 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:32,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:32,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 12:45:32,167 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 12:45:32,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 12:45:32,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-10-15 12:45:32,168 INFO L87 Difference]: Start difference. First operand 91 states and 93 transitions. Second operand 17 states. [2018-10-15 12:45:33,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:33,251 INFO L93 Difference]: Finished difference Result 104 states and 106 transitions. [2018-10-15 12:45:33,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-15 12:45:33,252 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 88 [2018-10-15 12:45:33,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:33,253 INFO L225 Difference]: With dead ends: 104 [2018-10-15 12:45:33,253 INFO L226 Difference]: Without dead ends: 104 [2018-10-15 12:45:33,254 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2018-10-15 12:45:33,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-10-15 12:45:33,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2018-10-15 12:45:33,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-10-15 12:45:33,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 103 transitions. [2018-10-15 12:45:33,262 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 103 transitions. Word has length 88 [2018-10-15 12:45:33,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:33,263 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 103 transitions. [2018-10-15 12:45:33,263 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 12:45:33,263 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 103 transitions. [2018-10-15 12:45:33,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-15 12:45:33,264 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:33,265 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:33,265 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:33,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:33,265 INFO L82 PathProgramCache]: Analyzing trace with hash -780133794, now seen corresponding path program 8 times [2018-10-15 12:45:33,266 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:33,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:33,627 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 64 proven. 288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:33,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:33,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 12:45:33,628 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 12:45:33,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 12:45:33,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-10-15 12:45:33,629 INFO L87 Difference]: Start difference. First operand 101 states and 103 transitions. Second operand 19 states. [2018-10-15 12:45:34,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:34,956 INFO L93 Difference]: Finished difference Result 114 states and 116 transitions. [2018-10-15 12:45:34,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-15 12:45:34,957 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 98 [2018-10-15 12:45:34,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:34,959 INFO L225 Difference]: With dead ends: 114 [2018-10-15 12:45:34,959 INFO L226 Difference]: Without dead ends: 114 [2018-10-15 12:45:34,960 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:45:34,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-10-15 12:45:34,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2018-10-15 12:45:34,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-10-15 12:45:34,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 113 transitions. [2018-10-15 12:45:34,966 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 113 transitions. Word has length 98 [2018-10-15 12:45:34,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:34,966 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 113 transitions. [2018-10-15 12:45:34,967 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 12:45:34,967 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 113 transitions. [2018-10-15 12:45:34,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-15 12:45:34,968 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:34,968 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:34,969 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:34,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:34,969 INFO L82 PathProgramCache]: Analyzing trace with hash 126886056, now seen corresponding path program 9 times [2018-10-15 12:45:34,970 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:34,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:35,450 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 72 proven. 369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:35,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:35,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 12:45:35,451 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 12:45:35,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 12:45:35,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-10-15 12:45:35,452 INFO L87 Difference]: Start difference. First operand 111 states and 113 transitions. Second operand 21 states. [2018-10-15 12:45:36,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:36,653 INFO L93 Difference]: Finished difference Result 124 states and 126 transitions. [2018-10-15 12:45:36,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-15 12:45:36,654 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 108 [2018-10-15 12:45:36,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:36,655 INFO L225 Difference]: With dead ends: 124 [2018-10-15 12:45:36,656 INFO L226 Difference]: Without dead ends: 124 [2018-10-15 12:45:36,657 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 12:45:36,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-10-15 12:45:36,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 121. [2018-10-15 12:45:36,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-10-15 12:45:36,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 123 transitions. [2018-10-15 12:45:36,663 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 123 transitions. Word has length 108 [2018-10-15 12:45:36,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:36,664 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 123 transitions. [2018-10-15 12:45:36,664 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 12:45:36,664 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 123 transitions. [2018-10-15 12:45:36,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-15 12:45:36,665 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:36,666 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:36,666 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:36,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:36,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1340887666, now seen corresponding path program 10 times [2018-10-15 12:45:36,667 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:36,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-15 12:45:36,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-15 12:45:36,796 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-15 12:45:36,857 INFO L202 PluginConnector]: Adding new model sum03_false-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 12:45:36 BoogieIcfgContainer [2018-10-15 12:45:36,858 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-15 12:45:36,859 INFO L168 Benchmark]: Toolchain (without parser) took 13280.69 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 41.4 MB). Free memory was 1.4 GB in the beginning and 963.5 MB in the end (delta: 476.5 MB). Peak memory consumption was 517.9 MB. Max. memory is 7.1 GB. [2018-10-15 12:45:36,860 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-15 12:45:36,861 INFO L168 Benchmark]: Boogie Preprocessor took 53.34 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-15 12:45:36,862 INFO L168 Benchmark]: RCFGBuilder took 323.95 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-15 12:45:36,862 INFO L168 Benchmark]: TraceAbstraction took 12898.33 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 41.4 MB). Free memory was 1.4 GB in the beginning and 963.5 MB in the end (delta: 455.3 MB). Peak memory consumption was 496.7 MB. Max. memory is 7.1 GB. [2018-10-15 12:45:36,866 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 53.34 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 323.95 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12898.33 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 41.4 MB). Free memory was 1.4 GB in the beginning and 963.5 MB in the end (delta: 455.3 MB). Peak memory consumption was 496.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 54]: assertion can be violated assertion can be violated We found a FailurePath: [L16] havoc main_#res; [L17] havoc main_#t~nondet0, main_#t~nondet1, main_~sn~0, main_#t~post2, main_~loop1~0, main_~x~0, main_~n1~0; [L18] main_~sn~0 := 0; VAL [main_~sn~0=0] [L19] main_~loop1~0 := main_#t~nondet0; VAL [main_#t~nondet0=2, main_~loop1~0=2, main_~sn~0=0] [L20] havoc main_#t~nondet0; VAL [main_~loop1~0=2, main_~sn~0=0] [L21] main_~n1~0 := main_#t~nondet1; VAL [main_#t~nondet1=3, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=0] [L22] havoc main_#t~nondet1; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=0] [L23] main_~x~0 := 0; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=0, main_~x~0=0] [L30] assume main_~x~0 % 4294967296 < 10; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=0, main_~x~0=0] [L31] main_~sn~0 := main_~sn~0 + 2; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=2, main_~x~0=0] [L37] main_#t~post2 := main_~x~0; VAL [main_#t~post2=0, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=2, main_~x~0=0] [L38] main_~x~0 := main_#t~post2 + 1; VAL [main_#t~post2=0, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=2, main_~x~0=1] [L39] havoc main_#t~post2; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=2, main_~x~0=1] [L40] assume (main_~sn~0 % 4294967296 == 2 * main_~x~0 % 4294967296 || 0 == main_~sn~0) || (!(main_~sn~0 % 4294967296 == 2 * main_~x~0 % 4294967296) && !(0 == main_~sn~0)); VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=2, main_~x~0=1] [L41] __VERIFIER_assert_#in~cond := (if main_~sn~0 % 4294967296 == 2 * main_~x~0 % 4294967296 || main_~sn~0 == 0 then 1 else 0); VAL [__VERIFIER_assert_#in~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=2, main_~x~0=1] [L42] havoc __VERIFIER_assert_~cond; VAL [__VERIFIER_assert_#in~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=2, main_~x~0=1] [L43] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=2, main_~x~0=1] [L51] assume !(0 == __VERIFIER_assert_~cond); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=2, main_~x~0=1] [L30] assume main_~x~0 % 4294967296 < 10; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=2, main_~x~0=1] [L31] main_~sn~0 := main_~sn~0 + 2; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=4, main_~x~0=1] [L37] main_#t~post2 := main_~x~0; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_#t~post2=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=4, main_~x~0=1] [L38] main_~x~0 := main_#t~post2 + 1; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_#t~post2=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=4, main_~x~0=2] [L39] havoc main_#t~post2; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=4, main_~x~0=2] [L40] assume (main_~sn~0 % 4294967296 == 2 * main_~x~0 % 4294967296 || 0 == main_~sn~0) || (!(main_~sn~0 % 4294967296 == 2 * main_~x~0 % 4294967296) && !(0 == main_~sn~0)); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=4, main_~x~0=2] [L41] __VERIFIER_assert_#in~cond := (if main_~sn~0 % 4294967296 == 2 * main_~x~0 % 4294967296 || main_~sn~0 == 0 then 1 else 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=4, main_~x~0=2] [L42] havoc __VERIFIER_assert_~cond; VAL [__VERIFIER_assert_#in~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=4, main_~x~0=2] [L43] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=4, main_~x~0=2] [L51] assume !(0 == __VERIFIER_assert_~cond); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=4, main_~x~0=2] [L30] assume main_~x~0 % 4294967296 < 10; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=4, main_~x~0=2] [L31] main_~sn~0 := main_~sn~0 + 2; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=6, main_~x~0=2] [L37] main_#t~post2 := main_~x~0; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_#t~post2=2, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=6, main_~x~0=2] [L38] main_~x~0 := main_#t~post2 + 1; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_#t~post2=2, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=6, main_~x~0=3] [L39] havoc main_#t~post2; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=6, main_~x~0=3] [L40] assume (main_~sn~0 % 4294967296 == 2 * main_~x~0 % 4294967296 || 0 == main_~sn~0) || (!(main_~sn~0 % 4294967296 == 2 * main_~x~0 % 4294967296) && !(0 == main_~sn~0)); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=6, main_~x~0=3] [L41] __VERIFIER_assert_#in~cond := (if main_~sn~0 % 4294967296 == 2 * main_~x~0 % 4294967296 || main_~sn~0 == 0 then 1 else 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=6, main_~x~0=3] [L42] havoc __VERIFIER_assert_~cond; VAL [__VERIFIER_assert_#in~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=6, main_~x~0=3] [L43] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=6, main_~x~0=3] [L51] assume !(0 == __VERIFIER_assert_~cond); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=6, main_~x~0=3] [L30] assume main_~x~0 % 4294967296 < 10; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=6, main_~x~0=3] [L31] main_~sn~0 := main_~sn~0 + 2; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=8, main_~x~0=3] [L37] main_#t~post2 := main_~x~0; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_#t~post2=3, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=8, main_~x~0=3] [L38] main_~x~0 := main_#t~post2 + 1; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_#t~post2=3, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=8, main_~x~0=4] [L39] havoc main_#t~post2; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=8, main_~x~0=4] [L40] assume (main_~sn~0 % 4294967296 == 2 * main_~x~0 % 4294967296 || 0 == main_~sn~0) || (!(main_~sn~0 % 4294967296 == 2 * main_~x~0 % 4294967296) && !(0 == main_~sn~0)); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=8, main_~x~0=4] [L41] __VERIFIER_assert_#in~cond := (if main_~sn~0 % 4294967296 == 2 * main_~x~0 % 4294967296 || main_~sn~0 == 0 then 1 else 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=8, main_~x~0=4] [L42] havoc __VERIFIER_assert_~cond; VAL [__VERIFIER_assert_#in~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=8, main_~x~0=4] [L43] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=8, main_~x~0=4] [L51] assume !(0 == __VERIFIER_assert_~cond); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=8, main_~x~0=4] [L30] assume main_~x~0 % 4294967296 < 10; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=8, main_~x~0=4] [L31] main_~sn~0 := main_~sn~0 + 2; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=10, main_~x~0=4] [L37] main_#t~post2 := main_~x~0; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_#t~post2=4, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=10, main_~x~0=4] [L38] main_~x~0 := main_#t~post2 + 1; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_#t~post2=4, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=10, main_~x~0=5] [L39] havoc main_#t~post2; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=10, main_~x~0=5] [L40] assume (main_~sn~0 % 4294967296 == 2 * main_~x~0 % 4294967296 || 0 == main_~sn~0) || (!(main_~sn~0 % 4294967296 == 2 * main_~x~0 % 4294967296) && !(0 == main_~sn~0)); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=10, main_~x~0=5] [L41] __VERIFIER_assert_#in~cond := (if main_~sn~0 % 4294967296 == 2 * main_~x~0 % 4294967296 || main_~sn~0 == 0 then 1 else 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=10, main_~x~0=5] [L42] havoc __VERIFIER_assert_~cond; VAL [__VERIFIER_assert_#in~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=10, main_~x~0=5] [L43] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=10, main_~x~0=5] [L51] assume !(0 == __VERIFIER_assert_~cond); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=10, main_~x~0=5] [L30] assume main_~x~0 % 4294967296 < 10; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=10, main_~x~0=5] [L31] main_~sn~0 := main_~sn~0 + 2; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=12, main_~x~0=5] [L37] main_#t~post2 := main_~x~0; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_#t~post2=5, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=12, main_~x~0=5] [L38] main_~x~0 := main_#t~post2 + 1; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_#t~post2=5, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=12, main_~x~0=6] [L39] havoc main_#t~post2; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=12, main_~x~0=6] [L40] assume (main_~sn~0 % 4294967296 == 2 * main_~x~0 % 4294967296 || 0 == main_~sn~0) || (!(main_~sn~0 % 4294967296 == 2 * main_~x~0 % 4294967296) && !(0 == main_~sn~0)); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=12, main_~x~0=6] [L41] __VERIFIER_assert_#in~cond := (if main_~sn~0 % 4294967296 == 2 * main_~x~0 % 4294967296 || main_~sn~0 == 0 then 1 else 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=12, main_~x~0=6] [L42] havoc __VERIFIER_assert_~cond; VAL [__VERIFIER_assert_#in~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=12, main_~x~0=6] [L43] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=12, main_~x~0=6] [L51] assume !(0 == __VERIFIER_assert_~cond); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=12, main_~x~0=6] [L30] assume main_~x~0 % 4294967296 < 10; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=12, main_~x~0=6] [L31] main_~sn~0 := main_~sn~0 + 2; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=14, main_~x~0=6] [L37] main_#t~post2 := main_~x~0; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_#t~post2=6, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=14, main_~x~0=6] [L38] main_~x~0 := main_#t~post2 + 1; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_#t~post2=6, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=14, main_~x~0=7] [L39] havoc main_#t~post2; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=14, main_~x~0=7] [L40] assume (main_~sn~0 % 4294967296 == 2 * main_~x~0 % 4294967296 || 0 == main_~sn~0) || (!(main_~sn~0 % 4294967296 == 2 * main_~x~0 % 4294967296) && !(0 == main_~sn~0)); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=14, main_~x~0=7] [L41] __VERIFIER_assert_#in~cond := (if main_~sn~0 % 4294967296 == 2 * main_~x~0 % 4294967296 || main_~sn~0 == 0 then 1 else 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=14, main_~x~0=7] [L42] havoc __VERIFIER_assert_~cond; VAL [__VERIFIER_assert_#in~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=14, main_~x~0=7] [L43] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=14, main_~x~0=7] [L51] assume !(0 == __VERIFIER_assert_~cond); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=14, main_~x~0=7] [L30] assume main_~x~0 % 4294967296 < 10; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=14, main_~x~0=7] [L31] main_~sn~0 := main_~sn~0 + 2; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=16, main_~x~0=7] [L37] main_#t~post2 := main_~x~0; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_#t~post2=7, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=16, main_~x~0=7] [L38] main_~x~0 := main_#t~post2 + 1; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_#t~post2=7, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=16, main_~x~0=8] [L39] havoc main_#t~post2; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=16, main_~x~0=8] [L40] assume (main_~sn~0 % 4294967296 == 2 * main_~x~0 % 4294967296 || 0 == main_~sn~0) || (!(main_~sn~0 % 4294967296 == 2 * main_~x~0 % 4294967296) && !(0 == main_~sn~0)); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=16, main_~x~0=8] [L41] __VERIFIER_assert_#in~cond := (if main_~sn~0 % 4294967296 == 2 * main_~x~0 % 4294967296 || main_~sn~0 == 0 then 1 else 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=16, main_~x~0=8] [L42] havoc __VERIFIER_assert_~cond; VAL [__VERIFIER_assert_#in~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=16, main_~x~0=8] [L43] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=16, main_~x~0=8] [L51] assume !(0 == __VERIFIER_assert_~cond); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=16, main_~x~0=8] [L30] assume main_~x~0 % 4294967296 < 10; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=16, main_~x~0=8] [L31] main_~sn~0 := main_~sn~0 + 2; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=18, main_~x~0=8] [L37] main_#t~post2 := main_~x~0; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_#t~post2=8, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=18, main_~x~0=8] [L38] main_~x~0 := main_#t~post2 + 1; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_#t~post2=8, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=18, main_~x~0=9] [L39] havoc main_#t~post2; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=18, main_~x~0=9] [L40] assume (main_~sn~0 % 4294967296 == 2 * main_~x~0 % 4294967296 || 0 == main_~sn~0) || (!(main_~sn~0 % 4294967296 == 2 * main_~x~0 % 4294967296) && !(0 == main_~sn~0)); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=18, main_~x~0=9] [L41] __VERIFIER_assert_#in~cond := (if main_~sn~0 % 4294967296 == 2 * main_~x~0 % 4294967296 || main_~sn~0 == 0 then 1 else 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=18, main_~x~0=9] [L42] havoc __VERIFIER_assert_~cond; VAL [__VERIFIER_assert_#in~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=18, main_~x~0=9] [L43] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=18, main_~x~0=9] [L51] assume !(0 == __VERIFIER_assert_~cond); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=18, main_~x~0=9] [L30] assume main_~x~0 % 4294967296 < 10; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=18, main_~x~0=9] [L31] main_~sn~0 := main_~sn~0 + 2; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=20, main_~x~0=9] [L37] main_#t~post2 := main_~x~0; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_#t~post2=9, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=20, main_~x~0=9] [L38] main_~x~0 := main_#t~post2 + 1; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_#t~post2=9, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=20, main_~x~0=10] [L39] havoc main_#t~post2; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=20, main_~x~0=10] [L40] assume (main_~sn~0 % 4294967296 == 2 * main_~x~0 % 4294967296 || 0 == main_~sn~0) || (!(main_~sn~0 % 4294967296 == 2 * main_~x~0 % 4294967296) && !(0 == main_~sn~0)); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=20, main_~x~0=10] [L41] __VERIFIER_assert_#in~cond := (if main_~sn~0 % 4294967296 == 2 * main_~x~0 % 4294967296 || main_~sn~0 == 0 then 1 else 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=20, main_~x~0=10] [L42] havoc __VERIFIER_assert_~cond; VAL [__VERIFIER_assert_#in~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=20, main_~x~0=10] [L43] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=20, main_~x~0=10] [L51] assume !(0 == __VERIFIER_assert_~cond); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=20, main_~x~0=10] [L34] assume !(main_~x~0 % 4294967296 < 10); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=20, main_~x~0=10] [L37] main_#t~post2 := main_~x~0; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_#t~post2=10, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=20, main_~x~0=10] [L38] main_~x~0 := main_#t~post2 + 1; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_#t~post2=10, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=20, main_~x~0=11] [L39] havoc main_#t~post2; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=20, main_~x~0=11] [L40] assume (main_~sn~0 % 4294967296 == 2 * main_~x~0 % 4294967296 || 0 == main_~sn~0) || (!(main_~sn~0 % 4294967296 == 2 * main_~x~0 % 4294967296) && !(0 == main_~sn~0)); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=20, main_~x~0=11] [L41] __VERIFIER_assert_#in~cond := (if main_~sn~0 % 4294967296 == 2 * main_~x~0 % 4294967296 || main_~sn~0 == 0 then 1 else 0); VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=1, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=20, main_~x~0=11] [L42] havoc __VERIFIER_assert_~cond; VAL [__VERIFIER_assert_#in~cond=0, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=20, main_~x~0=11] [L43] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=20, main_~x~0=11] [L48] assume 0 == __VERIFIER_assert_~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=20, main_~x~0=11] [L54] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~loop1~0=2, main_~n1~0=3, main_~sn~0=20, main_~x~0=11] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 22 locations, 1 error locations. UNSAFE Result, 12.8s OverallTime, 12 OverallIterations, 11 TraceHistogramMax, 7.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 383 SDtfs, 128 SDslu, 3658 SDs, 0 SdLazy, 3898 SolverSat, 54 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 243 GetRequests, 23 SyntacticMatches, 10 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 558 ImplicationChecksByTransitivity, 5.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=121occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 55 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 767 NumberOfCodeBlocks, 767 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 638 ConstructedInterpolants, 0 QuantifiedInterpolants, 270060 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 PerfectInterpolantSequences, 360/1605 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/sum03_false-unreach-call_true-termination.i_3.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-10-15_12-45-36-878.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/sum03_false-unreach-call_true-termination.i_3.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-15_12-45-36-878.csv Received shutdown request...