java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/llreve-bench/smt2/rec__limit1unrolled.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 22:00:12,298 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 22:00:12,300 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 22:00:12,317 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 22:00:12,317 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 22:00:12,318 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 22:00:12,319 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 22:00:12,325 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 22:00:12,327 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 22:00:12,327 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 22:00:12,328 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 22:00:12,328 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 22:00:12,333 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 22:00:12,335 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 22:00:12,335 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 22:00:12,339 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 22:00:12,341 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 22:00:12,354 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 22:00:12,356 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 22:00:12,357 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 22:00:12,358 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 22:00:12,360 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 22:00:12,360 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 22:00:12,361 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 22:00:12,361 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 22:00:12,362 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 22:00:12,367 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 22:00:12,368 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 22:00:12,369 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 22:00:12,370 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 22:00:12,370 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 22:00:12,371 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 22:00:12,371 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 22:00:12,372 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 22:00:12,373 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 22:00:12,373 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 22:00:12,388 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 22:00:12,388 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 22:00:12,388 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 22:00:12,389 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 22:00:12,390 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 22:00:12,390 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 22:00:12,390 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 22:00:12,390 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 22:00:12,391 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 22:00:12,391 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 22:00:12,391 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 22:00:12,391 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 22:00:12,392 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 22:00:12,392 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 22:00:12,392 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 22:00:12,392 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 22:00:12,392 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 22:00:12,393 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 22:00:12,394 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 22:00:12,395 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 22:00:12,395 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 22:00:12,396 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 22:00:12,397 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 22:00:12,443 INFO ]: Repository-Root is: /tmp [2018-06-24 22:00:12,463 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 22:00:12,472 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 22:00:12,474 INFO ]: Initializing SmtParser... [2018-06-24 22:00:12,474 INFO ]: SmtParser initialized [2018-06-24 22:00:12,475 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/rec__limit1unrolled.smt2 [2018-06-24 22:00:12,476 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/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-06-24 22:00:12,572 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/rec__limit1unrolled.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@23267e82 [2018-06-24 22:00:12,840 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/rec__limit1unrolled.smt2 [2018-06-24 22:00:12,845 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 22:00:12,851 INFO ]: Walking toolchain with 5 elements. [2018-06-24 22:00:12,851 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 22:00:12,851 INFO ]: Initializing ChcToBoogie... [2018-06-24 22:00:12,852 INFO ]: ChcToBoogie initialized [2018-06-24 22:00:12,855 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 10:00:12" (1/1) ... [2018-06-24 22:00:12,928 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 10:00:12 Unit [2018-06-24 22:00:12,928 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 22:00:12,932 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 22:00:12,932 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 22:00:12,932 INFO ]: Boogie Preprocessor initialized [2018-06-24 22:00:12,954 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 10:00:12" (1/1) ... [2018-06-24 22:00:12,954 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 10:00:12" (1/1) ... [2018-06-24 22:00:12,961 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 10:00:12" (1/1) ... [2018-06-24 22:00:12,961 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 10:00:12" (1/1) ... [2018-06-24 22:00:12,981 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 10:00:12" (1/1) ... [2018-06-24 22:00:12,984 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 10:00:12" (1/1) ... [2018-06-24 22:00:12,986 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 10:00:12" (1/1) ... [2018-06-24 22:00:12,988 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 22:00:12,988 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 22:00:12,988 INFO ]: Initializing RCFGBuilder... [2018-06-24 22:00:12,988 INFO ]: RCFGBuilder initialized [2018-06-24 22:00:12,989 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 10:00:12" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 22:00:13,005 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 22:00:13,005 INFO ]: Found specification of procedure gotoProc [2018-06-24 22:00:13,005 INFO ]: Found implementation of procedure gotoProc [2018-06-24 22:00:13,005 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 22:00:13,005 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 22:00:13,005 INFO ]: Found implementation of procedure Ultimate.START [2018-06-24 22:00:13,511 INFO ]: Using library mode [2018-06-24 22:00:13,511 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 10:00:13 BoogieIcfgContainer [2018-06-24 22:00:13,511 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 22:00:13,511 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 22:00:13,511 INFO ]: Initializing BlockEncodingV2... [2018-06-24 22:00:13,512 INFO ]: BlockEncodingV2 initialized [2018-06-24 22:00:13,513 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 10:00:13" (1/1) ... [2018-06-24 22:00:13,530 INFO ]: Initial Icfg 31 locations, 60 edges [2018-06-24 22:00:13,532 INFO ]: Using Remove infeasible edges [2018-06-24 22:00:13,532 INFO ]: Using Maximize final states [2018-06-24 22:00:13,533 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 22:00:13,533 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 22:00:13,535 INFO ]: Using Remove sink states [2018-06-24 22:00:13,536 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 22:00:13,536 INFO ]: Using Use SBE [2018-06-24 22:00:13,543 INFO ]: SBE split 0 edges [2018-06-24 22:00:13,548 INFO ]: Removed 8 edges and 2 locations because of local infeasibility [2018-06-24 22:00:13,549 INFO ]: 0 new accepting states [2018-06-24 22:00:13,638 INFO ]: Removed 22 edges and 7 locations by large block encoding [2018-06-24 22:00:13,640 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 22:00:13,641 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 22:00:13,641 INFO ]: 0 new accepting states [2018-06-24 22:00:13,642 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 22:00:13,642 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 22:00:13,642 INFO ]: Encoded RCFG 22 locations, 45 edges [2018-06-24 22:00:13,643 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 10:00:13 BasicIcfg [2018-06-24 22:00:13,643 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 22:00:13,644 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 22:00:13,644 INFO ]: Initializing TraceAbstraction... [2018-06-24 22:00:13,647 INFO ]: TraceAbstraction initialized [2018-06-24 22:00:13,647 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 10:00:12" (1/4) ... [2018-06-24 22:00:13,648 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b767131 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 10:00:13, skipping insertion in model container [2018-06-24 22:00:13,648 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 10:00:12" (2/4) ... [2018-06-24 22:00:13,648 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b767131 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 10:00:13, skipping insertion in model container [2018-06-24 22:00:13,648 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 10:00:13" (3/4) ... [2018-06-24 22:00:13,648 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b767131 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 10:00:13, skipping insertion in model container [2018-06-24 22:00:13,648 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 10:00:13" (4/4) ... [2018-06-24 22:00:13,653 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 22:00:13,665 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 22:00:13,672 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 22:00:13,705 INFO ]: Using default assertion order modulation [2018-06-24 22:00:13,705 INFO ]: Interprodecural is true [2018-06-24 22:00:13,706 INFO ]: Hoare is false [2018-06-24 22:00:13,706 INFO ]: Compute interpolants for FPandBP [2018-06-24 22:00:13,706 INFO ]: Backedges is TWOTRACK [2018-06-24 22:00:13,706 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 22:00:13,706 INFO ]: Difference is false [2018-06-24 22:00:13,706 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 22:00:13,706 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 22:00:13,714 INFO ]: Start isEmpty. Operand 22 states. [2018-06-24 22:00:13,727 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 22:00:13,727 INFO ]: Found error trace [2018-06-24 22:00:13,728 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 22:00:13,728 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:00:13,733 INFO ]: Analyzing trace with hash 42700007, now seen corresponding path program 1 times [2018-06-24 22:00:13,735 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:00:13,735 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:00:13,766 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:00:13,767 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:00:13,767 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:00:13,807 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:00:13,871 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:00:13,873 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 22:00:13,873 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 22:00:13,874 INFO ]: Interpolant automaton has 3 states [2018-06-24 22:00:13,885 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 22:00:13,885 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:00:13,888 INFO ]: Start difference. First operand 22 states. Second operand 3 states. [2018-06-24 22:00:14,342 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:00:14,342 INFO ]: Finished difference Result 38 states and 81 transitions. [2018-06-24 22:00:14,342 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 22:00:14,343 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 22:00:14,344 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:00:14,354 INFO ]: With dead ends: 38 [2018-06-24 22:00:14,354 INFO ]: Without dead ends: 38 [2018-06-24 22:00:14,356 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:00:14,369 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-24 22:00:14,412 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-06-24 22:00:14,414 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-24 22:00:14,418 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 81 transitions. [2018-06-24 22:00:14,419 INFO ]: Start accepts. Automaton has 38 states and 81 transitions. Word has length 5 [2018-06-24 22:00:14,423 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:00:14,423 INFO ]: Abstraction has 38 states and 81 transitions. [2018-06-24 22:00:14,423 INFO ]: Interpolant automaton has 3 states. [2018-06-24 22:00:14,423 INFO ]: Start isEmpty. Operand 38 states and 81 transitions. [2018-06-24 22:00:14,428 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 22:00:14,428 INFO ]: Found error trace [2018-06-24 22:00:14,429 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 22:00:14,429 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:00:14,429 INFO ]: Analyzing trace with hash 1327258136, now seen corresponding path program 1 times [2018-06-24 22:00:14,429 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:00:14,429 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:00:14,430 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:00:14,430 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:00:14,430 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:00:14,440 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:00:14,510 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:00:14,510 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 22:00:14,510 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 22:00:14,512 INFO ]: Interpolant automaton has 3 states [2018-06-24 22:00:14,512 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 22:00:14,512 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:00:14,512 INFO ]: Start difference. First operand 38 states and 81 transitions. Second operand 3 states. [2018-06-24 22:00:14,919 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:00:14,919 INFO ]: Finished difference Result 54 states and 118 transitions. [2018-06-24 22:00:14,921 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 22:00:14,921 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 22:00:14,921 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:00:14,923 INFO ]: With dead ends: 54 [2018-06-24 22:00:14,923 INFO ]: Without dead ends: 54 [2018-06-24 22:00:14,928 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:00:14,928 INFO ]: Start minimizeSevpa. Operand 54 states. [2018-06-24 22:00:14,947 INFO ]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-06-24 22:00:14,947 INFO ]: Start removeUnreachable. Operand 54 states. [2018-06-24 22:00:14,949 INFO ]: Finished removeUnreachable. Reduced from 54 states to 54 states and 118 transitions. [2018-06-24 22:00:14,949 INFO ]: Start accepts. Automaton has 54 states and 118 transitions. Word has length 6 [2018-06-24 22:00:14,949 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:00:14,949 INFO ]: Abstraction has 54 states and 118 transitions. [2018-06-24 22:00:14,949 INFO ]: Interpolant automaton has 3 states. [2018-06-24 22:00:14,949 INFO ]: Start isEmpty. Operand 54 states and 118 transitions. [2018-06-24 22:00:14,957 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 22:00:14,957 INFO ]: Found error trace [2018-06-24 22:00:14,961 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 22:00:14,961 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:00:14,961 INFO ]: Analyzing trace with hash 1328240278, now seen corresponding path program 1 times [2018-06-24 22:00:14,961 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:00:14,961 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:00:14,962 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:00:14,962 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:00:14,962 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:00:14,979 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:00:15,027 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:00:15,027 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 22:00:15,027 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 22:00:15,027 INFO ]: Interpolant automaton has 3 states [2018-06-24 22:00:15,027 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 22:00:15,027 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:00:15,027 INFO ]: Start difference. First operand 54 states and 118 transitions. Second operand 3 states. [2018-06-24 22:00:15,066 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:00:15,066 INFO ]: Finished difference Result 72 states and 168 transitions. [2018-06-24 22:00:15,067 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 22:00:15,067 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 22:00:15,067 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:00:15,071 INFO ]: With dead ends: 72 [2018-06-24 22:00:15,071 INFO ]: Without dead ends: 72 [2018-06-24 22:00:15,071 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:00:15,071 INFO ]: Start minimizeSevpa. Operand 72 states. [2018-06-24 22:00:15,086 INFO ]: Finished minimizeSevpa. Reduced states from 72 to 57. [2018-06-24 22:00:15,086 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-24 22:00:15,088 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 121 transitions. [2018-06-24 22:00:15,088 INFO ]: Start accepts. Automaton has 57 states and 121 transitions. Word has length 6 [2018-06-24 22:00:15,088 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:00:15,088 INFO ]: Abstraction has 57 states and 121 transitions. [2018-06-24 22:00:15,088 INFO ]: Interpolant automaton has 3 states. [2018-06-24 22:00:15,088 INFO ]: Start isEmpty. Operand 57 states and 121 transitions. [2018-06-24 22:00:15,091 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 22:00:15,091 INFO ]: Found error trace [2018-06-24 22:00:15,091 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 22:00:15,091 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:00:15,091 INFO ]: Analyzing trace with hash 1329105178, now seen corresponding path program 1 times [2018-06-24 22:00:15,091 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:00:15,091 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:00:15,092 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:00:15,092 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:00:15,092 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:00:15,104 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:00:15,134 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:00:15,134 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 22:00:15,134 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 22:00:15,134 INFO ]: Interpolant automaton has 3 states [2018-06-24 22:00:15,134 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 22:00:15,134 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:00:15,134 INFO ]: Start difference. First operand 57 states and 121 transitions. Second operand 3 states. [2018-06-24 22:00:15,236 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:00:15,236 INFO ]: Finished difference Result 81 states and 187 transitions. [2018-06-24 22:00:15,237 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 22:00:15,237 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 22:00:15,237 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:00:15,240 INFO ]: With dead ends: 81 [2018-06-24 22:00:15,240 INFO ]: Without dead ends: 81 [2018-06-24 22:00:15,240 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:00:15,241 INFO ]: Start minimizeSevpa. Operand 81 states. [2018-06-24 22:00:15,256 INFO ]: Finished minimizeSevpa. Reduced states from 81 to 58. [2018-06-24 22:00:15,256 INFO ]: Start removeUnreachable. Operand 58 states. [2018-06-24 22:00:15,258 INFO ]: Finished removeUnreachable. Reduced from 58 states to 58 states and 124 transitions. [2018-06-24 22:00:15,258 INFO ]: Start accepts. Automaton has 58 states and 124 transitions. Word has length 6 [2018-06-24 22:00:15,258 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:00:15,258 INFO ]: Abstraction has 58 states and 124 transitions. [2018-06-24 22:00:15,258 INFO ]: Interpolant automaton has 3 states. [2018-06-24 22:00:15,258 INFO ]: Start isEmpty. Operand 58 states and 124 transitions. [2018-06-24 22:00:15,260 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 22:00:15,260 INFO ]: Found error trace [2018-06-24 22:00:15,260 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 22:00:15,260 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:00:15,261 INFO ]: Analyzing trace with hash 1328956223, now seen corresponding path program 1 times [2018-06-24 22:00:15,261 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:00:15,261 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:00:15,261 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:00:15,261 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:00:15,261 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:00:15,270 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:00:15,298 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:00:15,298 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 22:00:15,298 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 22:00:15,299 INFO ]: Interpolant automaton has 3 states [2018-06-24 22:00:15,299 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 22:00:15,299 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:00:15,299 INFO ]: Start difference. First operand 58 states and 124 transitions. Second operand 3 states. [2018-06-24 22:00:15,453 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:00:15,453 INFO ]: Finished difference Result 72 states and 163 transitions. [2018-06-24 22:00:15,454 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 22:00:15,454 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 22:00:15,454 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:00:15,456 INFO ]: With dead ends: 72 [2018-06-24 22:00:15,456 INFO ]: Without dead ends: 72 [2018-06-24 22:00:15,456 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:00:15,456 INFO ]: Start minimizeSevpa. Operand 72 states. [2018-06-24 22:00:15,466 INFO ]: Finished minimizeSevpa. Reduced states from 72 to 54. [2018-06-24 22:00:15,467 INFO ]: Start removeUnreachable. Operand 54 states. [2018-06-24 22:00:15,469 INFO ]: Finished removeUnreachable. Reduced from 54 states to 54 states and 112 transitions. [2018-06-24 22:00:15,469 INFO ]: Start accepts. Automaton has 54 states and 112 transitions. Word has length 6 [2018-06-24 22:00:15,469 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:00:15,469 INFO ]: Abstraction has 54 states and 112 transitions. [2018-06-24 22:00:15,469 INFO ]: Interpolant automaton has 3 states. [2018-06-24 22:00:15,469 INFO ]: Start isEmpty. Operand 54 states and 112 transitions. [2018-06-24 22:00:15,471 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 22:00:15,471 INFO ]: Found error trace [2018-06-24 22:00:15,471 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:00:15,471 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:00:15,471 INFO ]: Analyzing trace with hash -232872562, now seen corresponding path program 1 times [2018-06-24 22:00:15,471 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:00:15,471 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:00:15,472 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:00:15,472 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:00:15,472 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:00:15,480 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:00:15,509 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 22:00:15,509 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 22:00:15,509 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 22:00:15,510 INFO ]: Interpolant automaton has 3 states [2018-06-24 22:00:15,510 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 22:00:15,510 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:00:15,510 INFO ]: Start difference. First operand 54 states and 112 transitions. Second operand 3 states. [2018-06-24 22:00:15,631 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:00:15,631 INFO ]: Finished difference Result 69 states and 131 transitions. [2018-06-24 22:00:15,632 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 22:00:15,632 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-24 22:00:15,632 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:00:15,633 INFO ]: With dead ends: 69 [2018-06-24 22:00:15,633 INFO ]: Without dead ends: 69 [2018-06-24 22:00:15,633 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:00:15,634 INFO ]: Start minimizeSevpa. Operand 69 states. [2018-06-24 22:00:15,641 INFO ]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-06-24 22:00:15,641 INFO ]: Start removeUnreachable. Operand 69 states. [2018-06-24 22:00:15,642 INFO ]: Finished removeUnreachable. Reduced from 69 states to 69 states and 131 transitions. [2018-06-24 22:00:15,642 INFO ]: Start accepts. Automaton has 69 states and 131 transitions. Word has length 11 [2018-06-24 22:00:15,642 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:00:15,642 INFO ]: Abstraction has 69 states and 131 transitions. [2018-06-24 22:00:15,642 INFO ]: Interpolant automaton has 3 states. [2018-06-24 22:00:15,642 INFO ]: Start isEmpty. Operand 69 states and 131 transitions. [2018-06-24 22:00:15,644 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 22:00:15,644 INFO ]: Found error trace [2018-06-24 22:00:15,644 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:00:15,644 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:00:15,644 INFO ]: Analyzing trace with hash 1959092118, now seen corresponding path program 1 times [2018-06-24 22:00:15,644 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:00:15,645 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:00:15,645 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:00:15,645 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:00:15,645 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:00:15,661 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:00:15,701 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 22:00:15,701 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 22:00:15,701 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 22:00:15,702 INFO ]: Interpolant automaton has 3 states [2018-06-24 22:00:15,702 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 22:00:15,702 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:00:15,702 INFO ]: Start difference. First operand 69 states and 131 transitions. Second operand 3 states. [2018-06-24 22:00:16,005 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:00:16,005 INFO ]: Finished difference Result 84 states and 160 transitions. [2018-06-24 22:00:16,006 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 22:00:16,006 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-24 22:00:16,006 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:00:16,007 INFO ]: With dead ends: 84 [2018-06-24 22:00:16,007 INFO ]: Without dead ends: 84 [2018-06-24 22:00:16,007 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:00:16,007 INFO ]: Start minimizeSevpa. Operand 84 states. [2018-06-24 22:00:16,022 INFO ]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-06-24 22:00:16,022 INFO ]: Start removeUnreachable. Operand 84 states. [2018-06-24 22:00:16,023 INFO ]: Finished removeUnreachable. Reduced from 84 states to 84 states and 160 transitions. [2018-06-24 22:00:16,023 INFO ]: Start accepts. Automaton has 84 states and 160 transitions. Word has length 12 [2018-06-24 22:00:16,023 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:00:16,023 INFO ]: Abstraction has 84 states and 160 transitions. [2018-06-24 22:00:16,023 INFO ]: Interpolant automaton has 3 states. [2018-06-24 22:00:16,023 INFO ]: Start isEmpty. Operand 84 states and 160 transitions. [2018-06-24 22:00:16,030 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 22:00:16,030 INFO ]: Found error trace [2018-06-24 22:00:16,030 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:00:16,030 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:00:16,031 INFO ]: Analyzing trace with hash 1567203694, now seen corresponding path program 1 times [2018-06-24 22:00:16,031 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:00:16,031 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:00:16,031 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:00:16,031 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:00:16,031 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:00:16,041 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:00:16,069 INFO ]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 22:00:16,069 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 22:00:16,069 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 22:00:16,078 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:00:16,094 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:00:16,099 INFO ]: Computing forward predicates... [2018-06-24 22:00:16,114 INFO ]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-24 22:00:16,141 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 22:00:16,141 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2018-06-24 22:00:16,141 INFO ]: Interpolant automaton has 3 states [2018-06-24 22:00:16,141 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 22:00:16,141 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:00:16,141 INFO ]: Start difference. First operand 84 states and 160 transitions. Second operand 3 states. [2018-06-24 22:00:16,238 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:00:16,238 INFO ]: Finished difference Result 84 states and 155 transitions. [2018-06-24 22:00:16,238 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 22:00:16,238 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-24 22:00:16,238 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:00:16,239 INFO ]: With dead ends: 84 [2018-06-24 22:00:16,239 INFO ]: Without dead ends: 79 [2018-06-24 22:00:16,241 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:00:16,241 INFO ]: Start minimizeSevpa. Operand 79 states. [2018-06-24 22:00:16,256 INFO ]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-06-24 22:00:16,256 INFO ]: Start removeUnreachable. Operand 79 states. [2018-06-24 22:00:16,258 INFO ]: Finished removeUnreachable. Reduced from 79 states to 79 states and 150 transitions. [2018-06-24 22:00:16,258 INFO ]: Start accepts. Automaton has 79 states and 150 transitions. Word has length 12 [2018-06-24 22:00:16,258 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:00:16,258 INFO ]: Abstraction has 79 states and 150 transitions. [2018-06-24 22:00:16,258 INFO ]: Interpolant automaton has 3 states. [2018-06-24 22:00:16,258 INFO ]: Start isEmpty. Operand 79 states and 150 transitions. [2018-06-24 22:00:16,259 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 22:00:16,259 INFO ]: Found error trace [2018-06-24 22:00:16,259 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:00:16,259 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:00:16,259 INFO ]: Analyzing trace with hash 1794504325, now seen corresponding path program 1 times [2018-06-24 22:00:16,259 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:00:16,259 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:00:16,260 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:00:16,260 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:00:16,260 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:00:16,291 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:00:16,505 INFO ]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 22:00:16,505 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 22:00:16,505 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 22:00:16,518 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:00:16,541 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:00:16,543 INFO ]: Computing forward predicates... [2018-06-24 22:00:16,689 INFO ]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 22:00:16,707 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 22:00:16,708 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-24 22:00:16,708 INFO ]: Interpolant automaton has 10 states [2018-06-24 22:00:16,708 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 22:00:16,708 INFO ]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-06-24 22:00:16,708 INFO ]: Start difference. First operand 79 states and 150 transitions. Second operand 10 states. [2018-06-24 22:00:16,909 WARN ]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-06-24 22:00:17,998 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:00:17,998 INFO ]: Finished difference Result 124 states and 257 transitions. [2018-06-24 22:00:18,069 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-24 22:00:18,069 INFO ]: Start accepts. Automaton has 10 states. Word has length 12 [2018-06-24 22:00:18,069 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:00:18,071 INFO ]: With dead ends: 124 [2018-06-24 22:00:18,071 INFO ]: Without dead ends: 109 [2018-06-24 22:00:18,072 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2018-06-24 22:00:18,072 INFO ]: Start minimizeSevpa. Operand 109 states. [2018-06-24 22:00:18,082 INFO ]: Finished minimizeSevpa. Reduced states from 109 to 87. [2018-06-24 22:00:18,082 INFO ]: Start removeUnreachable. Operand 87 states. [2018-06-24 22:00:18,084 INFO ]: Finished removeUnreachable. Reduced from 87 states to 87 states and 159 transitions. [2018-06-24 22:00:18,084 INFO ]: Start accepts. Automaton has 87 states and 159 transitions. Word has length 12 [2018-06-24 22:00:18,084 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:00:18,084 INFO ]: Abstraction has 87 states and 159 transitions. [2018-06-24 22:00:18,084 INFO ]: Interpolant automaton has 10 states. [2018-06-24 22:00:18,084 INFO ]: Start isEmpty. Operand 87 states and 159 transitions. [2018-06-24 22:00:18,085 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 22:00:18,085 INFO ]: Found error trace [2018-06-24 22:00:18,085 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:00:18,085 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:00:18,085 INFO ]: Analyzing trace with hash 1651953216, now seen corresponding path program 1 times [2018-06-24 22:00:18,085 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:00:18,085 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:00:18,086 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:00:18,086 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:00:18,086 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:00:18,096 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:00:18,133 INFO ]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 22:00:18,133 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 22:00:18,133 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 22:00:18,133 INFO ]: Interpolant automaton has 3 states [2018-06-24 22:00:18,133 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 22:00:18,133 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:00:18,134 INFO ]: Start difference. First operand 87 states and 159 transitions. Second operand 3 states. [2018-06-24 22:00:18,168 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:00:18,168 INFO ]: Finished difference Result 89 states and 161 transitions. [2018-06-24 22:00:18,168 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 22:00:18,168 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-24 22:00:18,168 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:00:18,169 INFO ]: With dead ends: 89 [2018-06-24 22:00:18,169 INFO ]: Without dead ends: 84 [2018-06-24 22:00:18,169 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:00:18,169 INFO ]: Start minimizeSevpa. Operand 84 states. [2018-06-24 22:00:18,174 INFO ]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-06-24 22:00:18,174 INFO ]: Start removeUnreachable. Operand 84 states. [2018-06-24 22:00:18,175 INFO ]: Finished removeUnreachable. Reduced from 84 states to 84 states and 147 transitions. [2018-06-24 22:00:18,175 INFO ]: Start accepts. Automaton has 84 states and 147 transitions. Word has length 12 [2018-06-24 22:00:18,176 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:00:18,176 INFO ]: Abstraction has 84 states and 147 transitions. [2018-06-24 22:00:18,176 INFO ]: Interpolant automaton has 3 states. [2018-06-24 22:00:18,176 INFO ]: Start isEmpty. Operand 84 states and 147 transitions. [2018-06-24 22:00:18,176 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 22:00:18,176 INFO ]: Found error trace [2018-06-24 22:00:18,177 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:00:18,177 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:00:18,177 INFO ]: Analyzing trace with hash -164796383, now seen corresponding path program 1 times [2018-06-24 22:00:18,177 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:00:18,177 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:00:18,177 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:00:18,177 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:00:18,177 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:00:18,187 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:00:18,346 WARN ]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-06-24 22:00:18,388 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 22:00:18,389 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 22:00:18,389 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-06-24 22:00:18,389 INFO ]: Interpolant automaton has 8 states [2018-06-24 22:00:18,389 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 22:00:18,389 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-24 22:00:18,389 INFO ]: Start difference. First operand 84 states and 147 transitions. Second operand 8 states. [2018-06-24 22:00:18,852 WARN ]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-06-24 22:00:19,286 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:00:19,286 INFO ]: Finished difference Result 154 states and 325 transitions. [2018-06-24 22:00:19,286 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-24 22:00:19,286 INFO ]: Start accepts. Automaton has 8 states. Word has length 12 [2018-06-24 22:00:19,286 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:00:19,289 INFO ]: With dead ends: 154 [2018-06-24 22:00:19,289 INFO ]: Without dead ends: 154 [2018-06-24 22:00:19,289 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2018-06-24 22:00:19,289 INFO ]: Start minimizeSevpa. Operand 154 states. [2018-06-24 22:00:19,304 INFO ]: Finished minimizeSevpa. Reduced states from 154 to 101. [2018-06-24 22:00:19,304 INFO ]: Start removeUnreachable. Operand 101 states. [2018-06-24 22:00:19,306 INFO ]: Finished removeUnreachable. Reduced from 101 states to 101 states and 172 transitions. [2018-06-24 22:00:19,306 INFO ]: Start accepts. Automaton has 101 states and 172 transitions. Word has length 12 [2018-06-24 22:00:19,306 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:00:19,306 INFO ]: Abstraction has 101 states and 172 transitions. [2018-06-24 22:00:19,306 INFO ]: Interpolant automaton has 8 states. [2018-06-24 22:00:19,306 INFO ]: Start isEmpty. Operand 101 states and 172 transitions. [2018-06-24 22:00:19,307 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 22:00:19,307 INFO ]: Found error trace [2018-06-24 22:00:19,308 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-06-24 22:00:19,308 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:00:19,308 INFO ]: Analyzing trace with hash 349129274, now seen corresponding path program 2 times [2018-06-24 22:00:19,308 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:00:19,308 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:00:19,309 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:00:19,309 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:00:19,309 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:00:19,325 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:00:19,484 INFO ]: Checked inductivity of 14 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 22:00:19,484 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 22:00:19,484 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 22:00:19,499 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 22:00:19,550 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 22:00:19,550 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:00:19,552 INFO ]: Computing forward predicates... [2018-06-24 22:00:19,654 INFO ]: Checked inductivity of 14 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-24 22:00:19,677 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 22:00:19,677 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-06-24 22:00:19,677 INFO ]: Interpolant automaton has 15 states [2018-06-24 22:00:19,677 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-24 22:00:19,677 INFO ]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-06-24 22:00:19,677 INFO ]: Start difference. First operand 101 states and 172 transitions. Second operand 15 states. [2018-06-24 22:00:20,299 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:00:20,299 INFO ]: Finished difference Result 119 states and 216 transitions. [2018-06-24 22:00:20,299 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-24 22:00:20,299 INFO ]: Start accepts. Automaton has 15 states. Word has length 18 [2018-06-24 22:00:20,299 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:00:20,301 INFO ]: With dead ends: 119 [2018-06-24 22:00:20,301 INFO ]: Without dead ends: 119 [2018-06-24 22:00:20,301 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2018-06-24 22:00:20,301 INFO ]: Start minimizeSevpa. Operand 119 states. [2018-06-24 22:00:20,308 INFO ]: Finished minimizeSevpa. Reduced states from 119 to 104. [2018-06-24 22:00:20,308 INFO ]: Start removeUnreachable. Operand 104 states. [2018-06-24 22:00:20,309 INFO ]: Finished removeUnreachable. Reduced from 104 states to 104 states and 176 transitions. [2018-06-24 22:00:20,309 INFO ]: Start accepts. Automaton has 104 states and 176 transitions. Word has length 18 [2018-06-24 22:00:20,309 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:00:20,309 INFO ]: Abstraction has 104 states and 176 transitions. [2018-06-24 22:00:20,309 INFO ]: Interpolant automaton has 15 states. [2018-06-24 22:00:20,309 INFO ]: Start isEmpty. Operand 104 states and 176 transitions. [2018-06-24 22:00:20,311 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 22:00:20,311 INFO ]: Found error trace [2018-06-24 22:00:20,311 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:00:20,311 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:00:20,311 INFO ]: Analyzing trace with hash -572710114, now seen corresponding path program 1 times [2018-06-24 22:00:20,311 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:00:20,311 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:00:20,312 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:00:20,312 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 22:00:20,312 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:00:20,337 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:00:20,464 INFO ]: Checked inductivity of 8 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 22:00:20,464 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 22:00:20,464 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 22:00:20,472 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:00:20,500 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:00:20,502 INFO ]: Computing forward predicates... [2018-06-24 22:00:20,950 INFO ]: Checked inductivity of 8 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 22:00:20,980 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 22:00:20,980 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2018-06-24 22:00:20,980 INFO ]: Interpolant automaton has 17 states [2018-06-24 22:00:20,980 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-24 22:00:20,980 INFO ]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2018-06-24 22:00:20,980 INFO ]: Start difference. First operand 104 states and 176 transitions. Second operand 17 states. [2018-06-24 22:00:21,583 WARN ]: Spent 111.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2018-06-24 22:00:22,782 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:00:22,782 INFO ]: Finished difference Result 135 states and 261 transitions. [2018-06-24 22:00:22,782 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-24 22:00:22,783 INFO ]: Start accepts. Automaton has 17 states. Word has length 18 [2018-06-24 22:00:22,783 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:00:22,784 INFO ]: With dead ends: 135 [2018-06-24 22:00:22,784 INFO ]: Without dead ends: 132 [2018-06-24 22:00:22,785 INFO ]: 0 DeclaredPredicates, 54 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=195, Invalid=995, Unknown=0, NotChecked=0, Total=1190 [2018-06-24 22:00:22,785 INFO ]: Start minimizeSevpa. Operand 132 states. [2018-06-24 22:00:22,792 INFO ]: Finished minimizeSevpa. Reduced states from 132 to 102. [2018-06-24 22:00:22,792 INFO ]: Start removeUnreachable. Operand 102 states. [2018-06-24 22:00:22,793 INFO ]: Finished removeUnreachable. Reduced from 102 states to 102 states and 171 transitions. [2018-06-24 22:00:22,793 INFO ]: Start accepts. Automaton has 102 states and 171 transitions. Word has length 18 [2018-06-24 22:00:22,794 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:00:22,794 INFO ]: Abstraction has 102 states and 171 transitions. [2018-06-24 22:00:22,794 INFO ]: Interpolant automaton has 17 states. [2018-06-24 22:00:22,794 INFO ]: Start isEmpty. Operand 102 states and 171 transitions. [2018-06-24 22:00:22,795 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 22:00:22,795 INFO ]: Found error trace [2018-06-24 22:00:22,795 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:00:22,795 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:00:22,795 INFO ]: Analyzing trace with hash 1037901497, now seen corresponding path program 1 times [2018-06-24 22:00:22,795 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:00:22,795 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:00:22,796 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:00:22,796 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:00:22,796 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:00:22,804 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:00:22,853 INFO ]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-24 22:00:22,853 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 22:00:22,853 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 22:00:22,859 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:00:22,883 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:00:22,885 INFO ]: Computing forward predicates... [2018-06-24 22:00:22,889 INFO ]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 22:00:22,920 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 22:00:22,920 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2018-06-24 22:00:22,921 INFO ]: Interpolant automaton has 5 states [2018-06-24 22:00:22,921 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 22:00:22,921 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 22:00:22,921 INFO ]: Start difference. First operand 102 states and 171 transitions. Second operand 5 states. [2018-06-24 22:00:23,259 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:00:23,260 INFO ]: Finished difference Result 95 states and 166 transitions. [2018-06-24 22:00:23,260 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 22:00:23,260 INFO ]: Start accepts. Automaton has 5 states. Word has length 18 [2018-06-24 22:00:23,260 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:00:23,261 INFO ]: With dead ends: 95 [2018-06-24 22:00:23,261 INFO ]: Without dead ends: 83 [2018-06-24 22:00:23,261 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-24 22:00:23,261 INFO ]: Start minimizeSevpa. Operand 83 states. [2018-06-24 22:00:23,268 INFO ]: Finished minimizeSevpa. Reduced states from 83 to 66. [2018-06-24 22:00:23,268 INFO ]: Start removeUnreachable. Operand 66 states. [2018-06-24 22:00:23,268 INFO ]: Finished removeUnreachable. Reduced from 66 states to 66 states and 109 transitions. [2018-06-24 22:00:23,268 INFO ]: Start accepts. Automaton has 66 states and 109 transitions. Word has length 18 [2018-06-24 22:00:23,269 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:00:23,269 INFO ]: Abstraction has 66 states and 109 transitions. [2018-06-24 22:00:23,269 INFO ]: Interpolant automaton has 5 states. [2018-06-24 22:00:23,269 INFO ]: Start isEmpty. Operand 66 states and 109 transitions. [2018-06-24 22:00:23,269 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-24 22:00:23,269 INFO ]: Found error trace [2018-06-24 22:00:23,269 INFO ]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2018-06-24 22:00:23,270 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:00:23,274 INFO ]: Analyzing trace with hash -1665475739, now seen corresponding path program 3 times [2018-06-24 22:00:23,274 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:00:23,274 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:00:23,275 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:00:23,275 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:00:23,275 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:00:23,302 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:00:23,525 INFO ]: Checked inductivity of 30 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 22:00:23,525 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 22:00:23,525 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 22:00:23,532 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 22:00:23,555 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-24 22:00:23,555 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:00:23,559 INFO ]: Computing forward predicates... [2018-06-24 22:00:26,634 INFO ]: Checked inductivity of 30 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-24 22:00:26,653 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 22:00:26,653 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2018-06-24 22:00:26,654 INFO ]: Interpolant automaton has 23 states [2018-06-24 22:00:26,654 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-24 22:00:26,654 INFO ]: CoverageRelationStatistics Valid=52, Invalid=450, Unknown=4, NotChecked=0, Total=506 [2018-06-24 22:00:26,654 INFO ]: Start difference. First operand 66 states and 109 transitions. Second operand 23 states. [2018-06-24 22:00:27,394 WARN ]: Spent 683.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 29 [2018-06-24 22:00:28,459 WARN ]: Spent 975.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2018-06-24 22:00:31,730 WARN ]: Spent 3.25 s on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2018-06-24 22:00:33,084 WARN ]: Spent 894.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2018-06-24 22:00:34,906 WARN ]: Spent 1.80 s on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2018-06-24 22:00:36,405 WARN ]: Spent 1.34 s on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2018-06-24 22:00:40,297 WARN ]: Spent 311.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-06-24 22:00:40,740 WARN ]: Spent 410.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-06-24 22:00:43,247 WARN ]: Spent 2.48 s on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2018-06-24 22:00:49,666 WARN ]: Spent 332.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 30 [2018-06-24 22:00:58,871 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:00:58,871 INFO ]: Finished difference Result 89 states and 146 transitions. [2018-06-24 22:00:58,872 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-24 22:00:58,872 INFO ]: Start accepts. Automaton has 23 states. Word has length 24 [2018-06-24 22:00:58,872 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:00:58,873 INFO ]: With dead ends: 89 [2018-06-24 22:00:58,873 INFO ]: Without dead ends: 77 [2018-06-24 22:00:58,874 INFO ]: 0 DeclaredPredicates, 60 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 22.7s TimeCoverageRelationStatistics Valid=381, Invalid=1860, Unknown=15, NotChecked=0, Total=2256 [2018-06-24 22:00:58,874 INFO ]: Start minimizeSevpa. Operand 77 states. [2018-06-24 22:00:58,882 INFO ]: Finished minimizeSevpa. Reduced states from 77 to 70. [2018-06-24 22:00:58,883 INFO ]: Start removeUnreachable. Operand 70 states. [2018-06-24 22:00:58,883 INFO ]: Finished removeUnreachable. Reduced from 70 states to 70 states and 114 transitions. [2018-06-24 22:00:58,883 INFO ]: Start accepts. Automaton has 70 states and 114 transitions. Word has length 24 [2018-06-24 22:00:58,883 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:00:58,883 INFO ]: Abstraction has 70 states and 114 transitions. [2018-06-24 22:00:58,883 INFO ]: Interpolant automaton has 23 states. [2018-06-24 22:00:58,883 INFO ]: Start isEmpty. Operand 70 states and 114 transitions. [2018-06-24 22:00:58,884 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-24 22:00:58,884 INFO ]: Found error trace [2018-06-24 22:00:58,884 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:00:58,885 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:00:58,885 INFO ]: Analyzing trace with hash 2133174273, now seen corresponding path program 2 times [2018-06-24 22:00:58,885 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:00:58,885 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:00:58,886 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:00:58,886 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 22:00:58,886 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:00:58,911 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:00:59,472 INFO ]: Checked inductivity of 20 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 22:00:59,472 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 22:00:59,472 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 22:00:59,479 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 22:00:59,497 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 22:00:59,497 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:00:59,500 INFO ]: Computing forward predicates... [2018-06-24 22:01:00,010 INFO ]: Checked inductivity of 20 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 22:01:00,028 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 22:01:00,029 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2018-06-24 22:01:00,029 INFO ]: Interpolant automaton has 23 states [2018-06-24 22:01:00,029 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-24 22:01:00,029 INFO ]: CoverageRelationStatistics Valid=49, Invalid=457, Unknown=0, NotChecked=0, Total=506 [2018-06-24 22:01:00,029 INFO ]: Start difference. First operand 70 states and 114 transitions. Second operand 23 states. [2018-06-24 22:01:01,734 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:01:01,734 INFO ]: Finished difference Result 94 states and 164 transitions. [2018-06-24 22:01:01,735 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-24 22:01:01,735 INFO ]: Start accepts. Automaton has 23 states. Word has length 24 [2018-06-24 22:01:01,735 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:01:01,736 INFO ]: With dead ends: 94 [2018-06-24 22:01:01,736 INFO ]: Without dead ends: 66 [2018-06-24 22:01:01,736 INFO ]: 0 DeclaredPredicates, 68 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=293, Invalid=1687, Unknown=0, NotChecked=0, Total=1980 [2018-06-24 22:01:01,737 INFO ]: Start minimizeSevpa. Operand 66 states. [2018-06-24 22:01:01,739 INFO ]: Finished minimizeSevpa. Reduced states from 66 to 56. [2018-06-24 22:01:01,739 INFO ]: Start removeUnreachable. Operand 56 states. [2018-06-24 22:01:01,740 INFO ]: Finished removeUnreachable. Reduced from 56 states to 56 states and 88 transitions. [2018-06-24 22:01:01,740 INFO ]: Start accepts. Automaton has 56 states and 88 transitions. Word has length 24 [2018-06-24 22:01:01,740 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:01:01,740 INFO ]: Abstraction has 56 states and 88 transitions. [2018-06-24 22:01:01,740 INFO ]: Interpolant automaton has 23 states. [2018-06-24 22:01:01,740 INFO ]: Start isEmpty. Operand 56 states and 88 transitions. [2018-06-24 22:01:01,742 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-24 22:01:01,742 INFO ]: Found error trace [2018-06-24 22:01:01,742 INFO ]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2018-06-24 22:01:01,742 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:01:01,742 INFO ]: Analyzing trace with hash 686251635, now seen corresponding path program 1 times [2018-06-24 22:01:01,742 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:01:01,742 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:01:01,742 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:01,742 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 22:01:01,742 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:01,761 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:01:02,084 INFO ]: Checked inductivity of 57 backedges. 12 proven. 34 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-24 22:01:02,084 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 22:01:02,084 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 22:01:02,102 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:01:02,143 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:01:02,148 INFO ]: Computing forward predicates... [2018-06-24 22:01:02,414 INFO ]: Checked inductivity of 57 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-24 22:01:02,442 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 22:01:02,442 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10] total 25 [2018-06-24 22:01:02,443 INFO ]: Interpolant automaton has 25 states [2018-06-24 22:01:02,443 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-24 22:01:02,443 INFO ]: CoverageRelationStatistics Valid=57, Invalid=543, Unknown=0, NotChecked=0, Total=600 [2018-06-24 22:01:02,443 INFO ]: Start difference. First operand 56 states and 88 transitions. Second operand 25 states. [2018-06-24 22:01:03,611 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:01:03,611 INFO ]: Finished difference Result 35 states and 47 transitions. [2018-06-24 22:01:03,614 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-24 22:01:03,614 INFO ]: Start accepts. Automaton has 25 states. Word has length 31 [2018-06-24 22:01:03,614 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:01:03,614 INFO ]: With dead ends: 35 [2018-06-24 22:01:03,614 INFO ]: Without dead ends: 0 [2018-06-24 22:01:03,615 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=297, Invalid=1509, Unknown=0, NotChecked=0, Total=1806 [2018-06-24 22:01:03,615 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-24 22:01:03,615 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-24 22:01:03,615 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-24 22:01:03,615 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-24 22:01:03,615 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2018-06-24 22:01:03,615 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:01:03,615 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-24 22:01:03,615 INFO ]: Interpolant automaton has 25 states. [2018-06-24 22:01:03,615 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-24 22:01:03,615 INFO ]: Finished isEmpty. No accepting run. [2018-06-24 22:01:03,618 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 22:01:03,620 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 10:01:03 BasicIcfg [2018-06-24 22:01:03,620 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 22:01:03,622 INFO ]: Toolchain (without parser) took 50775.48 ms. Allocated memory was 307.2 MB in the beginning and 580.9 MB in the end (delta: 273.7 MB). Free memory was 260.6 MB in the beginning and 332.7 MB in the end (delta: -72.0 MB). Peak memory consumption was 201.6 MB. Max. memory is 3.6 GB. [2018-06-24 22:01:03,623 INFO ]: SmtParser took 0.09 ms. Allocated memory is still 307.2 MB. Free memory is still 272.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 22:01:03,623 INFO ]: ChcToBoogie took 79.96 ms. Allocated memory is still 307.2 MB. Free memory was 260.6 MB in the beginning and 258.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 22:01:03,624 INFO ]: Boogie Preprocessor took 56.07 ms. Allocated memory is still 307.2 MB. Free memory was 258.6 MB in the beginning and 256.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 22:01:03,624 INFO ]: RCFGBuilder took 522.84 ms. Allocated memory is still 307.2 MB. Free memory was 256.6 MB in the beginning and 241.6 MB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 3.6 GB. [2018-06-24 22:01:03,624 INFO ]: BlockEncodingV2 took 131.14 ms. Allocated memory is still 307.2 MB. Free memory was 241.6 MB in the beginning and 236.6 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 3.6 GB. [2018-06-24 22:01:03,629 INFO ]: TraceAbstraction took 49976.47 ms. Allocated memory was 307.2 MB in the beginning and 580.9 MB in the end (delta: 273.7 MB). Free memory was 235.6 MB in the beginning and 332.7 MB in the end (delta: -97.1 MB). Peak memory consumption was 176.6 MB. Max. memory is 3.6 GB. [2018-06-24 22:01:03,634 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 31 locations, 60 edges - StatisticsResult: Encoded RCFG 22 locations, 45 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.09 ms. Allocated memory is still 307.2 MB. Free memory is still 272.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 79.96 ms. Allocated memory is still 307.2 MB. Free memory was 260.6 MB in the beginning and 258.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 56.07 ms. Allocated memory is still 307.2 MB. Free memory was 258.6 MB in the beginning and 256.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 522.84 ms. Allocated memory is still 307.2 MB. Free memory was 256.6 MB in the beginning and 241.6 MB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 131.14 ms. Allocated memory is still 307.2 MB. Free memory was 241.6 MB in the beginning and 236.6 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 49976.47 ms. Allocated memory was 307.2 MB in the beginning and 580.9 MB in the end (delta: 273.7 MB). Free memory was 235.6 MB in the beginning and 332.7 MB in the end (delta: -97.1 MB). Peak memory consumption was 176.6 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 22 locations, 1 error locations. SAFE Result, 49.9s OverallTime, 17 OverallIterations, 5 TraceHistogramMax, 41.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 837 SDtfs, 962 SDslu, 2073 SDs, 0 SdLazy, 4236 SolverSat, 744 SolverUnsat, 11 SolverUnknown, 0 SolverNotchecked, 17.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 392 GetRequests, 157 SyntacticMatches, 1 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1210 ImplicationChecksByTransitivity, 29.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred in iteration=12, 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.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 210 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 390 NumberOfCodeBlocks, 390 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 365 ConstructedInterpolants, 19 QuantifiedInterpolants, 78226 SizeOfPredicates, 118 NumberOfNonLiveVariables, 1240 ConjunctsInSsa, 372 ConjunctsInUnsatCore, 25 InterpolantComputations, 11 PerfectInterpolantSequences, 182/300 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/rec__limit1unrolled.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_22-01-03-652.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/rec__limit1unrolled.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_22-01-03-652.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/rec__limit1unrolled.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_22-01-03-652.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/rec__limit1unrolled.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_22-01-03-652.csv Received shutdown request...