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/hopv/lia/mochi/dotprod5.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 21:15:00,280 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 21:15:00,282 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 21:15:00,301 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 21:15:00,302 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 21:15:00,303 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 21:15:00,304 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 21:15:00,305 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 21:15:00,311 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 21:15:00,312 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 21:15:00,313 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 21:15:00,313 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 21:15:00,314 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 21:15:00,315 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 21:15:00,316 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 21:15:00,316 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 21:15:00,318 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 21:15:00,329 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 21:15:00,331 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 21:15:00,332 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 21:15:00,333 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 21:15:00,340 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 21:15:00,340 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 21:15:00,340 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 21:15:00,341 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 21:15:00,342 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 21:15:00,342 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 21:15:00,343 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 21:15:00,344 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 21:15:00,344 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 21:15:00,345 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 21:15:00,351 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 21:15:00,351 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 21:15:00,352 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 21:15:00,353 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 21:15:00,353 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 21:15:00,366 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 21:15:00,367 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 21:15:00,367 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 21:15:00,367 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 21:15:00,368 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 21:15:00,368 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 21:15:00,368 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 21:15:00,369 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 21:15:00,369 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 21:15:00,369 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 21:15:00,369 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 21:15:00,369 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 21:15:00,370 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:15:00,370 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 21:15:00,370 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 21:15:00,370 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 21:15:00,370 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 21:15:00,370 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 21:15:00,371 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 21:15:00,371 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 21:15:00,371 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 21:15:00,372 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 21:15:00,373 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 21:15:00,406 INFO ]: Repository-Root is: /tmp [2018-06-24 21:15:00,427 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 21:15:00,432 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 21:15:00,434 INFO ]: Initializing SmtParser... [2018-06-24 21:15:00,434 INFO ]: SmtParser initialized [2018-06-24 21:15:00,435 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hopv/lia/mochi/dotprod5.smt2 [2018-06-24 21:15:00,436 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 21:15:00,524 INFO ]: Executing SMT file /storage/chc-comp/hopv/lia/mochi/dotprod5.smt2 unknown [2018-06-24 21:15:00,913 INFO ]: Succesfully executed SMT file /storage/chc-comp/hopv/lia/mochi/dotprod5.smt2 [2018-06-24 21:15:00,917 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 21:15:00,923 INFO ]: Walking toolchain with 5 elements. [2018-06-24 21:15:00,923 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 21:15:00,923 INFO ]: Initializing ChcToBoogie... [2018-06-24 21:15:00,924 INFO ]: ChcToBoogie initialized [2018-06-24 21:15:00,927 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:15:00" (1/1) ... [2018-06-24 21:15:01,005 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:15:01 Unit [2018-06-24 21:15:01,005 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 21:15:01,006 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 21:15:01,006 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 21:15:01,006 INFO ]: Boogie Preprocessor initialized [2018-06-24 21:15:01,025 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:15:01" (1/1) ... [2018-06-24 21:15:01,026 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:15:01" (1/1) ... [2018-06-24 21:15:01,034 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:15:01" (1/1) ... [2018-06-24 21:15:01,034 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:15:01" (1/1) ... [2018-06-24 21:15:01,052 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:15:01" (1/1) ... [2018-06-24 21:15:01,065 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:15:01" (1/1) ... [2018-06-24 21:15:01,066 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:15:01" (1/1) ... [2018-06-24 21:15:01,069 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 21:15:01,070 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 21:15:01,070 INFO ]: Initializing RCFGBuilder... [2018-06-24 21:15:01,070 INFO ]: RCFGBuilder initialized [2018-06-24 21:15:01,070 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:15:01" (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) [2018-06-24 21:15:01,086 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 21:15:01,086 INFO ]: Found specification of procedure gotoProc [2018-06-24 21:15:01,086 INFO ]: Found implementation of procedure gotoProc [2018-06-24 21:15:01,086 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 21:15:01,086 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 21:15:01,086 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:15:01,701 INFO ]: Using library mode [2018-06-24 21:15:01,702 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:15:01 BoogieIcfgContainer [2018-06-24 21:15:01,702 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 21:15:01,702 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 21:15:01,702 INFO ]: Initializing BlockEncodingV2... [2018-06-24 21:15:01,705 INFO ]: BlockEncodingV2 initialized [2018-06-24 21:15:01,705 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:15:01" (1/1) ... [2018-06-24 21:15:01,728 INFO ]: Initial Icfg 74 locations, 115 edges [2018-06-24 21:15:01,730 INFO ]: Using Remove infeasible edges [2018-06-24 21:15:01,730 INFO ]: Using Maximize final states [2018-06-24 21:15:01,731 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 21:15:01,731 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 21:15:01,733 INFO ]: Using Remove sink states [2018-06-24 21:15:01,735 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 21:15:01,735 INFO ]: Using Use SBE [2018-06-24 21:15:01,787 INFO ]: SBE split 1 edges [2018-06-24 21:15:01,793 INFO ]: Removed 3 edges and 2 locations because of local infeasibility [2018-06-24 21:15:01,799 INFO ]: 0 new accepting states [2018-06-24 21:15:02,252 INFO ]: Removed 90 edges and 27 locations by large block encoding [2018-06-24 21:15:02,254 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:15:02,256 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 21:15:02,256 INFO ]: 0 new accepting states [2018-06-24 21:15:02,257 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 21:15:02,257 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:15:02,258 INFO ]: Encoded RCFG 45 locations, 87 edges [2018-06-24 21:15:02,258 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:15:02 BasicIcfg [2018-06-24 21:15:02,258 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 21:15:02,260 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 21:15:02,260 INFO ]: Initializing TraceAbstraction... [2018-06-24 21:15:02,263 INFO ]: TraceAbstraction initialized [2018-06-24 21:15:02,263 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:15:00" (1/4) ... [2018-06-24 21:15:02,264 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f8be99f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 09:15:02, skipping insertion in model container [2018-06-24 21:15:02,264 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:15:01" (2/4) ... [2018-06-24 21:15:02,264 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f8be99f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 09:15:02, skipping insertion in model container [2018-06-24 21:15:02,264 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:15:01" (3/4) ... [2018-06-24 21:15:02,264 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f8be99f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:15:02, skipping insertion in model container [2018-06-24 21:15:02,265 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:15:02" (4/4) ... [2018-06-24 21:15:02,266 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 21:15:02,274 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 21:15:02,280 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 21:15:02,329 INFO ]: Using default assertion order modulation [2018-06-24 21:15:02,330 INFO ]: Interprodecural is true [2018-06-24 21:15:02,330 INFO ]: Hoare is false [2018-06-24 21:15:02,330 INFO ]: Compute interpolants for FPandBP [2018-06-24 21:15:02,330 INFO ]: Backedges is TWOTRACK [2018-06-24 21:15:02,330 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 21:15:02,330 INFO ]: Difference is false [2018-06-24 21:15:02,330 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 21:15:02,330 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 21:15:02,340 INFO ]: Start isEmpty. Operand 45 states. [2018-06-24 21:15:02,354 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:15:02,355 INFO ]: Found error trace [2018-06-24 21:15:02,356 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:15:02,356 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:15:02,360 INFO ]: Analyzing trace with hash 87518370, now seen corresponding path program 1 times [2018-06-24 21:15:02,361 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:15:02,361 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:15:02,393 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:15:02,393 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:15:02,393 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:15:02,442 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:15:02,509 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:15:02,511 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:15:02,511 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:15:02,512 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:15:02,522 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:15:02,523 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:15:02,525 INFO ]: Start difference. First operand 45 states. Second operand 3 states. [2018-06-24 21:15:03,641 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:15:03,642 INFO ]: Finished difference Result 56 states and 117 transitions. [2018-06-24 21:15:03,642 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:15:03,643 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:15:03,643 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:15:03,658 INFO ]: With dead ends: 56 [2018-06-24 21:15:03,658 INFO ]: Without dead ends: 56 [2018-06-24 21:15:03,660 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 21:15:03,675 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-24 21:15:03,714 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-06-24 21:15:03,715 INFO ]: Start removeUnreachable. Operand 56 states. [2018-06-24 21:15:03,723 INFO ]: Finished removeUnreachable. Reduced from 56 states to 56 states and 117 transitions. [2018-06-24 21:15:03,724 INFO ]: Start accepts. Automaton has 56 states and 117 transitions. Word has length 5 [2018-06-24 21:15:03,725 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:15:03,725 INFO ]: Abstraction has 56 states and 117 transitions. [2018-06-24 21:15:03,725 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:15:03,725 INFO ]: Start isEmpty. Operand 56 states and 117 transitions. [2018-06-24 21:15:03,731 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:15:03,731 INFO ]: Found error trace [2018-06-24 21:15:03,732 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:15:03,732 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:15:03,732 INFO ]: Analyzing trace with hash -1579346488, now seen corresponding path program 1 times [2018-06-24 21:15:03,732 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:15:03,732 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:15:03,733 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:15:03,733 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:15:03,733 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:15:03,759 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:15:03,863 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:15:03,864 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:15:03,864 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:15:03,865 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:15:03,865 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:15:03,865 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:15:03,865 INFO ]: Start difference. First operand 56 states and 117 transitions. Second operand 3 states. [2018-06-24 21:15:03,983 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:15:03,983 INFO ]: Finished difference Result 76 states and 183 transitions. [2018-06-24 21:15:03,985 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:15:03,985 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 21:15:03,985 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:15:03,999 INFO ]: With dead ends: 76 [2018-06-24 21:15:03,999 INFO ]: Without dead ends: 76 [2018-06-24 21:15:04,000 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 21:15:04,000 INFO ]: Start minimizeSevpa. Operand 76 states. [2018-06-24 21:15:04,035 INFO ]: Finished minimizeSevpa. Reduced states from 76 to 58. [2018-06-24 21:15:04,035 INFO ]: Start removeUnreachable. Operand 58 states. [2018-06-24 21:15:04,041 INFO ]: Finished removeUnreachable. Reduced from 58 states to 58 states and 119 transitions. [2018-06-24 21:15:04,041 INFO ]: Start accepts. Automaton has 58 states and 119 transitions. Word has length 6 [2018-06-24 21:15:04,041 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:15:04,041 INFO ]: Abstraction has 58 states and 119 transitions. [2018-06-24 21:15:04,041 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:15:04,041 INFO ]: Start isEmpty. Operand 58 states and 119 transitions. [2018-06-24 21:15:04,050 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:15:04,050 INFO ]: Found error trace [2018-06-24 21:15:04,050 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:15:04,050 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:15:04,051 INFO ]: Analyzing trace with hash -1578422967, now seen corresponding path program 1 times [2018-06-24 21:15:04,051 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:15:04,051 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:15:04,051 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:15:04,051 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:15:04,051 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:15:04,075 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:15:04,194 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:15:04,194 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:15:04,194 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 21:15:04,194 INFO ]: Interpolant automaton has 4 states [2018-06-24 21:15:04,194 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 21:15:04,194 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:15:04,195 INFO ]: Start difference. First operand 58 states and 119 transitions. Second operand 4 states. [2018-06-24 21:15:04,322 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:15:04,322 INFO ]: Finished difference Result 89 states and 205 transitions. [2018-06-24 21:15:04,322 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 21:15:04,322 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-24 21:15:04,323 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:15:04,328 INFO ]: With dead ends: 89 [2018-06-24 21:15:04,328 INFO ]: Without dead ends: 89 [2018-06-24 21:15:04,329 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:15:04,329 INFO ]: Start minimizeSevpa. Operand 89 states. [2018-06-24 21:15:04,349 INFO ]: Finished minimizeSevpa. Reduced states from 89 to 61. [2018-06-24 21:15:04,349 INFO ]: Start removeUnreachable. Operand 61 states. [2018-06-24 21:15:04,351 INFO ]: Finished removeUnreachable. Reduced from 61 states to 61 states and 123 transitions. [2018-06-24 21:15:04,351 INFO ]: Start accepts. Automaton has 61 states and 123 transitions. Word has length 6 [2018-06-24 21:15:04,351 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:15:04,351 INFO ]: Abstraction has 61 states and 123 transitions. [2018-06-24 21:15:04,351 INFO ]: Interpolant automaton has 4 states. [2018-06-24 21:15:04,351 INFO ]: Start isEmpty. Operand 61 states and 123 transitions. [2018-06-24 21:15:04,356 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 21:15:04,356 INFO ]: Found error trace [2018-06-24 21:15:04,356 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:15:04,356 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:15:04,357 INFO ]: Analyzing trace with hash 40140192, now seen corresponding path program 1 times [2018-06-24 21:15:04,357 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:15:04,357 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:15:04,358 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:15:04,358 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:15:04,358 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:15:04,386 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:15:04,467 INFO ]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-24 21:15:04,467 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:15:04,467 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:15:04,467 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:15:04,467 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:15:04,467 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:15:04,468 INFO ]: Start difference. First operand 61 states and 123 transitions. Second operand 3 states. [2018-06-24 21:15:05,195 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:15:05,195 INFO ]: Finished difference Result 74 states and 133 transitions. [2018-06-24 21:15:05,196 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:15:05,196 INFO ]: Start accepts. Automaton has 3 states. Word has length 17 [2018-06-24 21:15:05,197 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:15:05,199 INFO ]: With dead ends: 74 [2018-06-24 21:15:05,199 INFO ]: Without dead ends: 74 [2018-06-24 21:15:05,199 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 21:15:05,199 INFO ]: Start minimizeSevpa. Operand 74 states. [2018-06-24 21:15:05,208 INFO ]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-06-24 21:15:05,208 INFO ]: Start removeUnreachable. Operand 74 states. [2018-06-24 21:15:05,211 INFO ]: Finished removeUnreachable. Reduced from 74 states to 74 states and 133 transitions. [2018-06-24 21:15:05,211 INFO ]: Start accepts. Automaton has 74 states and 133 transitions. Word has length 17 [2018-06-24 21:15:05,212 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:15:05,212 INFO ]: Abstraction has 74 states and 133 transitions. [2018-06-24 21:15:05,212 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:15:05,212 INFO ]: Start isEmpty. Operand 74 states and 133 transitions. [2018-06-24 21:15:05,215 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 21:15:05,215 INFO ]: Found error trace [2018-06-24 21:15:05,215 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:15:05,215 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:15:05,215 INFO ]: Analyzing trace with hash 328014002, now seen corresponding path program 1 times [2018-06-24 21:15:05,215 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:15:05,215 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:15:05,216 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:15:05,216 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:15:05,216 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:15:05,247 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:15:05,406 INFO ]: Checked inductivity of 13 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 21:15:05,406 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:15:05,406 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 21:15:05,420 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:15:05,485 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:15:05,496 INFO ]: Computing forward predicates... [2018-06-24 21:15:05,547 INFO ]: Checked inductivity of 13 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 21:15:05,585 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:15:05,585 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-24 21:15:05,585 INFO ]: Interpolant automaton has 7 states [2018-06-24 21:15:05,585 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 21:15:05,585 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:15:05,586 INFO ]: Start difference. First operand 74 states and 133 transitions. Second operand 7 states. [2018-06-24 21:15:07,209 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:15:07,209 INFO ]: Finished difference Result 142 states and 352 transitions. [2018-06-24 21:15:07,212 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 21:15:07,212 INFO ]: Start accepts. Automaton has 7 states. Word has length 18 [2018-06-24 21:15:07,212 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:15:07,217 INFO ]: With dead ends: 142 [2018-06-24 21:15:07,217 INFO ]: Without dead ends: 132 [2018-06-24 21:15:07,218 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2018-06-24 21:15:07,218 INFO ]: Start minimizeSevpa. Operand 132 states. [2018-06-24 21:15:07,244 INFO ]: Finished minimizeSevpa. Reduced states from 132 to 79. [2018-06-24 21:15:07,244 INFO ]: Start removeUnreachable. Operand 79 states. [2018-06-24 21:15:07,247 INFO ]: Finished removeUnreachable. Reduced from 79 states to 79 states and 150 transitions. [2018-06-24 21:15:07,247 INFO ]: Start accepts. Automaton has 79 states and 150 transitions. Word has length 18 [2018-06-24 21:15:07,247 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:15:07,247 INFO ]: Abstraction has 79 states and 150 transitions. [2018-06-24 21:15:07,247 INFO ]: Interpolant automaton has 7 states. [2018-06-24 21:15:07,247 INFO ]: Start isEmpty. Operand 79 states and 150 transitions. [2018-06-24 21:15:07,250 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-24 21:15:07,250 INFO ]: Found error trace [2018-06-24 21:15:07,250 INFO ]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:15:07,251 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:15:07,251 INFO ]: Analyzing trace with hash 1548779655, now seen corresponding path program 1 times [2018-06-24 21:15:07,251 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:15:07,251 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:15:07,251 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:15:07,251 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:15:07,252 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:15:07,274 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:15:07,345 INFO ]: Checked inductivity of 21 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-24 21:15:07,345 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:15:07,345 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) [2018-06-24 21:15:07,358 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:15:07,417 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:15:07,420 INFO ]: Computing forward predicates... [2018-06-24 21:15:07,426 INFO ]: Checked inductivity of 21 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-24 21:15:07,458 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:15:07,458 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2018-06-24 21:15:07,458 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:15:07,458 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:15:07,458 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:15:07,458 INFO ]: Start difference. First operand 79 states and 150 transitions. Second operand 3 states. [2018-06-24 21:15:07,718 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:15:07,718 INFO ]: Finished difference Result 94 states and 179 transitions. [2018-06-24 21:15:07,718 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:15:07,718 INFO ]: Start accepts. Automaton has 3 states. Word has length 22 [2018-06-24 21:15:07,718 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:15:07,720 INFO ]: With dead ends: 94 [2018-06-24 21:15:07,720 INFO ]: Without dead ends: 94 [2018-06-24 21:15:07,720 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 23 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 21:15:07,721 INFO ]: Start minimizeSevpa. Operand 94 states. [2018-06-24 21:15:07,735 INFO ]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-06-24 21:15:07,735 INFO ]: Start removeUnreachable. Operand 94 states. [2018-06-24 21:15:07,737 INFO ]: Finished removeUnreachable. Reduced from 94 states to 94 states and 179 transitions. [2018-06-24 21:15:07,737 INFO ]: Start accepts. Automaton has 94 states and 179 transitions. Word has length 22 [2018-06-24 21:15:07,737 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:15:07,737 INFO ]: Abstraction has 94 states and 179 transitions. [2018-06-24 21:15:07,737 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:15:07,738 INFO ]: Start isEmpty. Operand 94 states and 179 transitions. [2018-06-24 21:15:07,741 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-24 21:15:07,741 INFO ]: Found error trace [2018-06-24 21:15:07,741 INFO ]: trace histogram [5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-06-24 21:15:07,741 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:15:07,741 INFO ]: Analyzing trace with hash 89559145, now seen corresponding path program 2 times [2018-06-24 21:15:07,741 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:15:07,741 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:15:07,742 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:15:07,742 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:15:07,742 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:15:07,774 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:15:07,962 INFO ]: Checked inductivity of 48 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-06-24 21:15:07,962 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:15:07,962 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 21:15:07,971 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:15:08,041 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:15:08,041 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:15:08,044 INFO ]: Computing forward predicates... [2018-06-24 21:15:08,176 INFO ]: Checked inductivity of 48 backedges. 28 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-24 21:15:08,199 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:15:08,200 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 11 [2018-06-24 21:15:08,200 INFO ]: Interpolant automaton has 11 states [2018-06-24 21:15:08,200 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 21:15:08,200 INFO ]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-06-24 21:15:08,200 INFO ]: Start difference. First operand 94 states and 179 transitions. Second operand 11 states. [2018-06-24 21:15:09,132 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:15:09,133 INFO ]: Finished difference Result 188 states and 446 transitions. [2018-06-24 21:15:09,133 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-24 21:15:09,133 INFO ]: Start accepts. Automaton has 11 states. Word has length 30 [2018-06-24 21:15:09,133 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:15:09,139 INFO ]: With dead ends: 188 [2018-06-24 21:15:09,139 INFO ]: Without dead ends: 148 [2018-06-24 21:15:09,140 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2018-06-24 21:15:09,140 INFO ]: Start minimizeSevpa. Operand 148 states. [2018-06-24 21:15:09,158 INFO ]: Finished minimizeSevpa. Reduced states from 148 to 80. [2018-06-24 21:15:09,158 INFO ]: Start removeUnreachable. Operand 80 states. [2018-06-24 21:15:09,160 INFO ]: Finished removeUnreachable. Reduced from 80 states to 80 states and 145 transitions. [2018-06-24 21:15:09,161 INFO ]: Start accepts. Automaton has 80 states and 145 transitions. Word has length 30 [2018-06-24 21:15:09,161 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:15:09,161 INFO ]: Abstraction has 80 states and 145 transitions. [2018-06-24 21:15:09,161 INFO ]: Interpolant automaton has 11 states. [2018-06-24 21:15:09,161 INFO ]: Start isEmpty. Operand 80 states and 145 transitions. [2018-06-24 21:15:09,164 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-24 21:15:09,164 INFO ]: Found error trace [2018-06-24 21:15:09,164 INFO ]: trace histogram [6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:15:09,165 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:15:09,165 INFO ]: Analyzing trace with hash 1165759601, now seen corresponding path program 1 times [2018-06-24 21:15:09,165 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:15:09,165 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:15:09,165 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:15:09,165 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:15:09,165 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:15:09,193 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:15:09,259 INFO ]: Checked inductivity of 50 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-24 21:15:09,259 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:15:09,259 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) [2018-06-24 21:15:09,274 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:15:09,343 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:15:09,348 INFO ]: Computing forward predicates... [2018-06-24 21:15:09,554 INFO ]: Checked inductivity of 50 backedges. 31 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-24 21:15:09,575 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:15:09,575 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-24 21:15:09,575 INFO ]: Interpolant automaton has 7 states [2018-06-24 21:15:09,575 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 21:15:09,575 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:15:09,576 INFO ]: Start difference. First operand 80 states and 145 transitions. Second operand 7 states. [2018-06-24 21:15:10,164 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:15:10,164 INFO ]: Finished difference Result 128 states and 289 transitions. [2018-06-24 21:15:10,165 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 21:15:10,165 INFO ]: Start accepts. Automaton has 7 states. Word has length 32 [2018-06-24 21:15:10,165 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:15:10,169 INFO ]: With dead ends: 128 [2018-06-24 21:15:10,169 INFO ]: Without dead ends: 128 [2018-06-24 21:15:10,169 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-06-24 21:15:10,169 INFO ]: Start minimizeSevpa. Operand 128 states. [2018-06-24 21:15:10,186 INFO ]: Finished minimizeSevpa. Reduced states from 128 to 100. [2018-06-24 21:15:10,186 INFO ]: Start removeUnreachable. Operand 100 states. [2018-06-24 21:15:10,188 INFO ]: Finished removeUnreachable. Reduced from 100 states to 100 states and 196 transitions. [2018-06-24 21:15:10,188 INFO ]: Start accepts. Automaton has 100 states and 196 transitions. Word has length 32 [2018-06-24 21:15:10,189 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:15:10,189 INFO ]: Abstraction has 100 states and 196 transitions. [2018-06-24 21:15:10,189 INFO ]: Interpolant automaton has 7 states. [2018-06-24 21:15:10,189 INFO ]: Start isEmpty. Operand 100 states and 196 transitions. [2018-06-24 21:15:10,194 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-24 21:15:10,194 INFO ]: Found error trace [2018-06-24 21:15:10,194 INFO ]: trace histogram [6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:15:10,194 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:15:10,194 INFO ]: Analyzing trace with hash 1516559538, now seen corresponding path program 1 times [2018-06-24 21:15:10,194 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:15:10,194 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:15:10,195 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:15:10,195 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:15:10,195 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:15:10,218 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:15:10,541 INFO ]: Checked inductivity of 50 backedges. 19 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-06-24 21:15:10,541 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:15:10,541 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 21:15:10,555 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:15:10,626 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:15:10,629 INFO ]: Computing forward predicates... [2018-06-24 21:15:10,738 INFO ]: Checked inductivity of 50 backedges. 29 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-24 21:15:10,764 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:15:10,764 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-06-24 21:15:10,765 INFO ]: Interpolant automaton has 12 states [2018-06-24 21:15:10,765 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 21:15:10,765 INFO ]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-06-24 21:15:10,765 INFO ]: Start difference. First operand 100 states and 196 transitions. Second operand 12 states. [2018-06-24 21:15:11,594 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:15:11,594 INFO ]: Finished difference Result 176 states and 453 transitions. [2018-06-24 21:15:11,594 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-24 21:15:11,594 INFO ]: Start accepts. Automaton has 12 states. Word has length 32 [2018-06-24 21:15:11,594 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:15:11,601 INFO ]: With dead ends: 176 [2018-06-24 21:15:11,602 INFO ]: Without dead ends: 176 [2018-06-24 21:15:11,602 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2018-06-24 21:15:11,602 INFO ]: Start minimizeSevpa. Operand 176 states. [2018-06-24 21:15:11,640 INFO ]: Finished minimizeSevpa. Reduced states from 176 to 113. [2018-06-24 21:15:11,640 INFO ]: Start removeUnreachable. Operand 113 states. [2018-06-24 21:15:11,647 INFO ]: Finished removeUnreachable. Reduced from 113 states to 113 states and 256 transitions. [2018-06-24 21:15:11,647 INFO ]: Start accepts. Automaton has 113 states and 256 transitions. Word has length 32 [2018-06-24 21:15:11,647 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:15:11,647 INFO ]: Abstraction has 113 states and 256 transitions. [2018-06-24 21:15:11,648 INFO ]: Interpolant automaton has 12 states. [2018-06-24 21:15:11,648 INFO ]: Start isEmpty. Operand 113 states and 256 transitions. [2018-06-24 21:15:11,661 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-24 21:15:11,661 INFO ]: Found error trace [2018-06-24 21:15:11,661 INFO ]: trace histogram [6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:15:11,661 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:15:11,661 INFO ]: Analyzing trace with hash -1655059129, now seen corresponding path program 1 times [2018-06-24 21:15:11,661 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:15:11,661 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:15:11,662 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:15:11,662 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:15:11,662 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:15:11,676 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:15:11,768 INFO ]: Checked inductivity of 50 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-06-24 21:15:11,768 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:15:11,768 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 21:15:11,781 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:15:11,833 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:15:11,836 INFO ]: Computing forward predicates... [2018-06-24 21:15:11,841 INFO ]: Checked inductivity of 50 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-06-24 21:15:11,874 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:15:11,874 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2018-06-24 21:15:11,874 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:15:11,875 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:15:11,875 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:15:11,875 INFO ]: Start difference. First operand 113 states and 256 transitions. Second operand 3 states. [2018-06-24 21:15:12,039 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:15:12,039 INFO ]: Finished difference Result 129 states and 285 transitions. [2018-06-24 21:15:12,039 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:15:12,039 INFO ]: Start accepts. Automaton has 3 states. Word has length 32 [2018-06-24 21:15:12,040 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:15:12,042 INFO ]: With dead ends: 129 [2018-06-24 21:15:12,042 INFO ]: Without dead ends: 129 [2018-06-24 21:15:12,043 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 33 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 21:15:12,043 INFO ]: Start minimizeSevpa. Operand 129 states. [2018-06-24 21:15:12,056 INFO ]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-06-24 21:15:12,056 INFO ]: Start removeUnreachable. Operand 129 states. [2018-06-24 21:15:12,059 INFO ]: Finished removeUnreachable. Reduced from 129 states to 129 states and 285 transitions. [2018-06-24 21:15:12,059 INFO ]: Start accepts. Automaton has 129 states and 285 transitions. Word has length 32 [2018-06-24 21:15:12,059 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:15:12,059 INFO ]: Abstraction has 129 states and 285 transitions. [2018-06-24 21:15:12,059 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:15:12,059 INFO ]: Start isEmpty. Operand 129 states and 285 transitions. [2018-06-24 21:15:12,066 INFO ]: Finished isEmpty. Found accepting run of length 57 [2018-06-24 21:15:12,066 INFO ]: Found error trace [2018-06-24 21:15:12,066 INFO ]: trace histogram [10, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:15:12,066 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:15:12,067 INFO ]: Analyzing trace with hash -1410829628, now seen corresponding path program 1 times [2018-06-24 21:15:12,067 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:15:12,067 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:15:12,067 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:15:12,067 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:15:12,067 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:15:12,249 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:15:12,496 INFO ]: Checked inductivity of 180 backedges. 65 proven. 23 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-06-24 21:15:12,496 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:15:12,496 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 21:15:12,504 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:15:12,604 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:15:12,609 INFO ]: Computing forward predicates... [2018-06-24 21:15:13,278 INFO ]: Checked inductivity of 180 backedges. 71 proven. 42 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-06-24 21:15:13,298 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:15:13,298 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 17 [2018-06-24 21:15:13,299 INFO ]: Interpolant automaton has 17 states [2018-06-24 21:15:13,299 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-24 21:15:13,299 INFO ]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2018-06-24 21:15:13,299 INFO ]: Start difference. First operand 129 states and 285 transitions. Second operand 17 states. [2018-06-24 21:15:15,194 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:15:15,194 INFO ]: Finished difference Result 248 states and 665 transitions. [2018-06-24 21:15:15,194 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-24 21:15:15,194 INFO ]: Start accepts. Automaton has 17 states. Word has length 56 [2018-06-24 21:15:15,195 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:15:15,200 INFO ]: With dead ends: 248 [2018-06-24 21:15:15,200 INFO ]: Without dead ends: 248 [2018-06-24 21:15:15,201 INFO ]: 0 DeclaredPredicates, 105 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=294, Invalid=1512, Unknown=0, NotChecked=0, Total=1806 [2018-06-24 21:15:15,201 INFO ]: Start minimizeSevpa. Operand 248 states. [2018-06-24 21:15:15,240 INFO ]: Finished minimizeSevpa. Reduced states from 248 to 150. [2018-06-24 21:15:15,240 INFO ]: Start removeUnreachable. Operand 150 states. [2018-06-24 21:15:15,243 INFO ]: Finished removeUnreachable. Reduced from 150 states to 150 states and 358 transitions. [2018-06-24 21:15:15,244 INFO ]: Start accepts. Automaton has 150 states and 358 transitions. Word has length 56 [2018-06-24 21:15:15,244 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:15:15,244 INFO ]: Abstraction has 150 states and 358 transitions. [2018-06-24 21:15:15,244 INFO ]: Interpolant automaton has 17 states. [2018-06-24 21:15:15,244 INFO ]: Start isEmpty. Operand 150 states and 358 transitions. [2018-06-24 21:15:15,252 INFO ]: Finished isEmpty. Found accepting run of length 48 [2018-06-24 21:15:15,252 INFO ]: Found error trace [2018-06-24 21:15:15,252 INFO ]: trace histogram [9, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:15:15,253 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:15:15,253 INFO ]: Analyzing trace with hash -904902269, now seen corresponding path program 1 times [2018-06-24 21:15:15,253 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:15:15,253 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:15:15,253 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:15:15,253 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:15:15,253 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:15:15,264 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:15:15,342 INFO ]: Checked inductivity of 123 backedges. 37 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-06-24 21:15:15,342 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:15:15,342 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 21:15:15,358 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:15:15,440 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:15:15,444 INFO ]: Computing forward predicates... [2018-06-24 21:15:15,458 INFO ]: Checked inductivity of 123 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-06-24 21:15:15,489 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:15:15,489 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2018-06-24 21:15:15,514 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:15:15,514 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:15:15,514 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:15:15,514 INFO ]: Start difference. First operand 150 states and 358 transitions. Second operand 3 states. [2018-06-24 21:15:15,799 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:15:15,799 INFO ]: Finished difference Result 166 states and 394 transitions. [2018-06-24 21:15:15,799 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:15:15,799 INFO ]: Start accepts. Automaton has 3 states. Word has length 47 [2018-06-24 21:15:15,799 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:15:15,803 INFO ]: With dead ends: 166 [2018-06-24 21:15:15,803 INFO ]: Without dead ends: 166 [2018-06-24 21:15:15,803 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 48 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 21:15:15,803 INFO ]: Start minimizeSevpa. Operand 166 states. [2018-06-24 21:15:15,829 INFO ]: Finished minimizeSevpa. Reduced states from 166 to 160. [2018-06-24 21:15:15,829 INFO ]: Start removeUnreachable. Operand 160 states. [2018-06-24 21:15:15,833 INFO ]: Finished removeUnreachable. Reduced from 160 states to 160 states and 369 transitions. [2018-06-24 21:15:15,833 INFO ]: Start accepts. Automaton has 160 states and 369 transitions. Word has length 47 [2018-06-24 21:15:15,833 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:15:15,833 INFO ]: Abstraction has 160 states and 369 transitions. [2018-06-24 21:15:15,833 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:15:15,833 INFO ]: Start isEmpty. Operand 160 states and 369 transitions. [2018-06-24 21:15:15,843 INFO ]: Finished isEmpty. Found accepting run of length 63 [2018-06-24 21:15:15,843 INFO ]: Found error trace [2018-06-24 21:15:15,843 INFO ]: trace histogram [12, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:15:15,843 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:15:15,843 INFO ]: Analyzing trace with hash -902883248, now seen corresponding path program 1 times [2018-06-24 21:15:15,843 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:15:15,843 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:15:15,844 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:15:15,844 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:15:15,844 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:15:15,859 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:15:15,951 INFO ]: Checked inductivity of 223 backedges. 51 proven. 2 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2018-06-24 21:15:15,951 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:15:15,951 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:15:15,982 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:15:16,072 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:15:16,077 INFO ]: Computing forward predicates... [2018-06-24 21:15:16,092 INFO ]: Checked inductivity of 223 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2018-06-24 21:15:16,123 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:15:16,123 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2018-06-24 21:15:16,123 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:15:16,123 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:15:16,124 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:15:16,124 INFO ]: Start difference. First operand 160 states and 369 transitions. Second operand 3 states. [2018-06-24 21:15:16,331 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:15:16,331 INFO ]: Finished difference Result 179 states and 405 transitions. [2018-06-24 21:15:16,332 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:15:16,332 INFO ]: Start accepts. Automaton has 3 states. Word has length 62 [2018-06-24 21:15:16,332 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:15:16,336 INFO ]: With dead ends: 179 [2018-06-24 21:15:16,336 INFO ]: Without dead ends: 179 [2018-06-24 21:15:16,336 INFO ]: 0 DeclaredPredicates, 64 GetRequests, 63 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 21:15:16,336 INFO ]: Start minimizeSevpa. Operand 179 states. [2018-06-24 21:15:16,355 INFO ]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-06-24 21:15:16,355 INFO ]: Start removeUnreachable. Operand 179 states. [2018-06-24 21:15:16,360 INFO ]: Finished removeUnreachable. Reduced from 179 states to 179 states and 405 transitions. [2018-06-24 21:15:16,360 INFO ]: Start accepts. Automaton has 179 states and 405 transitions. Word has length 62 [2018-06-24 21:15:16,360 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:15:16,360 INFO ]: Abstraction has 179 states and 405 transitions. [2018-06-24 21:15:16,360 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:15:16,360 INFO ]: Start isEmpty. Operand 179 states and 405 transitions. [2018-06-24 21:15:16,366 INFO ]: Finished isEmpty. Found accepting run of length 79 [2018-06-24 21:15:16,366 INFO ]: Found error trace [2018-06-24 21:15:16,367 INFO ]: trace histogram [15, 6, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:15:16,368 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:15:16,368 INFO ]: Analyzing trace with hash -707328544, now seen corresponding path program 1 times [2018-06-24 21:15:16,368 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:15:16,368 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:15:16,369 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:15:16,369 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:15:16,369 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:15:16,381 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:15:16,505 INFO ]: Checked inductivity of 353 backedges. 64 proven. 3 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2018-06-24 21:15:16,505 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:15:16,505 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:15:16,520 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:15:16,629 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:15:16,633 INFO ]: Computing forward predicates... [2018-06-24 21:15:16,645 INFO ]: Checked inductivity of 353 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-06-24 21:15:16,675 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:15:16,675 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2018-06-24 21:15:16,675 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:15:16,675 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:15:16,675 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:15:16,675 INFO ]: Start difference. First operand 179 states and 405 transitions. Second operand 3 states. [2018-06-24 21:15:16,790 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:15:16,790 INFO ]: Finished difference Result 195 states and 429 transitions. [2018-06-24 21:15:16,791 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:15:16,791 INFO ]: Start accepts. Automaton has 3 states. Word has length 78 [2018-06-24 21:15:16,791 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:15:16,795 INFO ]: With dead ends: 195 [2018-06-24 21:15:16,795 INFO ]: Without dead ends: 195 [2018-06-24 21:15:16,795 INFO ]: 0 DeclaredPredicates, 80 GetRequests, 79 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 21:15:16,795 INFO ]: Start minimizeSevpa. Operand 195 states. [2018-06-24 21:15:16,810 INFO ]: Finished minimizeSevpa. Reduced states from 195 to 195. [2018-06-24 21:15:16,810 INFO ]: Start removeUnreachable. Operand 195 states. [2018-06-24 21:15:16,814 INFO ]: Finished removeUnreachable. Reduced from 195 states to 195 states and 429 transitions. [2018-06-24 21:15:16,814 INFO ]: Start accepts. Automaton has 195 states and 429 transitions. Word has length 78 [2018-06-24 21:15:16,814 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:15:16,814 INFO ]: Abstraction has 195 states and 429 transitions. [2018-06-24 21:15:16,814 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:15:16,814 INFO ]: Start isEmpty. Operand 195 states and 429 transitions. [2018-06-24 21:15:16,822 INFO ]: Finished isEmpty. Found accepting run of length 140 [2018-06-24 21:15:16,822 INFO ]: Found error trace [2018-06-24 21:15:16,822 INFO ]: trace histogram [27, 10, 9, 9, 8, 8, 8, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:15:16,822 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:15:16,822 INFO ]: Analyzing trace with hash 1346578562, now seen corresponding path program 1 times [2018-06-24 21:15:16,822 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:15:16,822 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:15:16,826 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:15:16,826 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:15:16,826 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:15:16,844 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:15:16,984 INFO ]: Checked inductivity of 1185 backedges. 152 proven. 38 refuted. 0 times theorem prover too weak. 995 trivial. 0 not checked. [2018-06-24 21:15:16,984 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:15:16,984 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-24 21:15:16,998 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:15:17,221 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:15:17,233 INFO ]: Computing forward predicates... [2018-06-24 21:15:17,270 INFO ]: Checked inductivity of 1185 backedges. 612 proven. 0 refuted. 0 times theorem prover too weak. 573 trivial. 0 not checked. [2018-06-24 21:15:17,301 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:15:17,302 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2018-06-24 21:15:17,302 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:15:17,302 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:15:17,302 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:15:17,302 INFO ]: Start difference. First operand 195 states and 429 transitions. Second operand 3 states. [2018-06-24 21:15:17,647 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:15:17,647 INFO ]: Finished difference Result 209 states and 455 transitions. [2018-06-24 21:15:17,647 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:15:17,647 INFO ]: Start accepts. Automaton has 3 states. Word has length 139 [2018-06-24 21:15:17,647 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:15:17,649 INFO ]: With dead ends: 209 [2018-06-24 21:15:17,649 INFO ]: Without dead ends: 209 [2018-06-24 21:15:17,649 INFO ]: 0 DeclaredPredicates, 141 GetRequests, 140 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 21:15:17,650 INFO ]: Start minimizeSevpa. Operand 209 states. [2018-06-24 21:15:17,665 INFO ]: Finished minimizeSevpa. Reduced states from 209 to 209. [2018-06-24 21:15:17,665 INFO ]: Start removeUnreachable. Operand 209 states. [2018-06-24 21:15:17,672 INFO ]: Finished removeUnreachable. Reduced from 209 states to 209 states and 455 transitions. [2018-06-24 21:15:17,672 INFO ]: Start accepts. Automaton has 209 states and 455 transitions. Word has length 139 [2018-06-24 21:15:17,672 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:15:17,672 INFO ]: Abstraction has 209 states and 455 transitions. [2018-06-24 21:15:17,672 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:15:17,672 INFO ]: Start isEmpty. Operand 209 states and 455 transitions. [2018-06-24 21:15:17,683 INFO ]: Finished isEmpty. Found accepting run of length 217 [2018-06-24 21:15:17,683 INFO ]: Found error trace [2018-06-24 21:15:17,683 INFO ]: trace histogram [42, 16, 14, 14, 12, 12, 12, 7, 7, 7, 5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:15:17,683 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:15:17,684 INFO ]: Analyzing trace with hash -1107841731, now seen corresponding path program 1 times [2018-06-24 21:15:17,684 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:15:17,684 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:15:17,684 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:15:17,684 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:15:17,684 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:15:17,759 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:15:17,981 INFO ]: Checked inductivity of 2917 backedges. 346 proven. 143 refuted. 0 times theorem prover too weak. 2428 trivial. 0 not checked. [2018-06-24 21:15:17,981 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:15:17,981 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-24 21:15:17,994 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:15:18,321 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:15:18,335 INFO ]: Computing forward predicates... [2018-06-24 21:15:18,665 INFO ]: Checked inductivity of 2917 backedges. 417 proven. 459 refuted. 0 times theorem prover too weak. 2041 trivial. 0 not checked. [2018-06-24 21:15:18,686 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:15:18,686 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 17] total 18 [2018-06-24 21:15:18,687 INFO ]: Interpolant automaton has 18 states [2018-06-24 21:15:18,687 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-24 21:15:18,687 INFO ]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2018-06-24 21:15:18,687 INFO ]: Start difference. First operand 209 states and 455 transitions. Second operand 18 states. [2018-06-24 21:15:21,669 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:15:21,669 INFO ]: Finished difference Result 398 states and 1065 transitions. [2018-06-24 21:15:21,669 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-24 21:15:21,669 INFO ]: Start accepts. Automaton has 18 states. Word has length 216 [2018-06-24 21:15:21,669 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:15:21,678 INFO ]: With dead ends: 398 [2018-06-24 21:15:21,678 INFO ]: Without dead ends: 398 [2018-06-24 21:15:21,679 INFO ]: 0 DeclaredPredicates, 265 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=259, Invalid=1997, Unknown=0, NotChecked=0, Total=2256 [2018-06-24 21:15:21,680 INFO ]: Start minimizeSevpa. Operand 398 states. [2018-06-24 21:15:21,722 INFO ]: Finished minimizeSevpa. Reduced states from 398 to 268. [2018-06-24 21:15:21,722 INFO ]: Start removeUnreachable. Operand 268 states. [2018-06-24 21:15:21,727 INFO ]: Finished removeUnreachable. Reduced from 268 states to 268 states and 596 transitions. [2018-06-24 21:15:21,727 INFO ]: Start accepts. Automaton has 268 states and 596 transitions. Word has length 216 [2018-06-24 21:15:21,728 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:15:21,728 INFO ]: Abstraction has 268 states and 596 transitions. [2018-06-24 21:15:21,728 INFO ]: Interpolant automaton has 18 states. [2018-06-24 21:15:21,728 INFO ]: Start isEmpty. Operand 268 states and 596 transitions. [2018-06-24 21:15:21,746 INFO ]: Finished isEmpty. Found accepting run of length 251 [2018-06-24 21:15:21,746 INFO ]: Found error trace [2018-06-24 21:15:21,746 INFO ]: trace histogram [48, 18, 16, 16, 16, 16, 16, 7, 7, 7, 5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:15:21,746 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:15:21,747 INFO ]: Analyzing trace with hash -810834936, now seen corresponding path program 1 times [2018-06-24 21:15:21,747 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:15:21,747 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:15:21,747 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:15:21,747 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:15:21,747 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:15:21,896 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:15:22,254 INFO ]: Checked inductivity of 3960 backedges. 663 proven. 63 refuted. 0 times theorem prover too weak. 3234 trivial. 0 not checked. [2018-06-24 21:15:22,254 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:15:22,254 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:15:22,259 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:15:22,569 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:15:22,585 INFO ]: Computing forward predicates... [2018-06-24 21:15:22,769 INFO ]: Checked inductivity of 3960 backedges. 491 proven. 466 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2018-06-24 21:15:22,791 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:15:22,791 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 17 [2018-06-24 21:15:22,791 INFO ]: Interpolant automaton has 17 states [2018-06-24 21:15:22,791 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-24 21:15:22,792 INFO ]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2018-06-24 21:15:22,792 INFO ]: Start difference. First operand 268 states and 596 transitions. Second operand 17 states. [2018-06-24 21:15:25,868 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:15:25,868 INFO ]: Finished difference Result 670 states and 1804 transitions. [2018-06-24 21:15:25,868 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-06-24 21:15:25,868 INFO ]: Start accepts. Automaton has 17 states. Word has length 250 [2018-06-24 21:15:25,868 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:15:25,883 INFO ]: With dead ends: 670 [2018-06-24 21:15:25,883 INFO ]: Without dead ends: 670 [2018-06-24 21:15:25,884 INFO ]: 0 DeclaredPredicates, 322 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1656 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=544, Invalid=5156, Unknown=0, NotChecked=0, Total=5700 [2018-06-24 21:15:25,886 INFO ]: Start minimizeSevpa. Operand 670 states. [2018-06-24 21:15:25,949 INFO ]: Finished minimizeSevpa. Reduced states from 670 to 400. [2018-06-24 21:15:25,949 INFO ]: Start removeUnreachable. Operand 400 states. [2018-06-24 21:15:25,957 INFO ]: Finished removeUnreachable. Reduced from 400 states to 400 states and 881 transitions. [2018-06-24 21:15:25,957 INFO ]: Start accepts. Automaton has 400 states and 881 transitions. Word has length 250 [2018-06-24 21:15:25,957 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:15:25,957 INFO ]: Abstraction has 400 states and 881 transitions. [2018-06-24 21:15:25,957 INFO ]: Interpolant automaton has 17 states. [2018-06-24 21:15:25,958 INFO ]: Start isEmpty. Operand 400 states and 881 transitions. [2018-06-24 21:15:25,989 INFO ]: Finished isEmpty. Found accepting run of length 251 [2018-06-24 21:15:25,989 INFO ]: Found error trace [2018-06-24 21:15:25,989 INFO ]: trace histogram [48, 18, 16, 16, 16, 16, 16, 7, 7, 7, 5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:15:25,989 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:15:25,989 INFO ]: Analyzing trace with hash 1308838443, now seen corresponding path program 1 times [2018-06-24 21:15:25,989 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:15:25,989 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:15:25,991 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:15:25,991 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:15:25,991 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:15:26,125 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:15:26,459 INFO ]: Checked inductivity of 3960 backedges. 382 proven. 10 refuted. 0 times theorem prover too weak. 3568 trivial. 0 not checked. [2018-06-24 21:15:26,459 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:15:26,459 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:15:26,465 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:15:26,811 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:15:26,824 INFO ]: Computing forward predicates... [2018-06-24 21:15:27,162 INFO ]: Checked inductivity of 3960 backedges. 826 proven. 445 refuted. 0 times theorem prover too weak. 2689 trivial. 0 not checked. [2018-06-24 21:15:27,196 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:15:27,196 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14] total 20 [2018-06-24 21:15:27,196 INFO ]: Interpolant automaton has 20 states [2018-06-24 21:15:27,196 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-24 21:15:27,196 INFO ]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2018-06-24 21:15:27,197 INFO ]: Start difference. First operand 400 states and 881 transitions. Second operand 20 states. [2018-06-24 21:15:33,454 WARN ]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-24 21:15:35,665 WARN ]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-06-24 21:15:36,248 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:15:36,248 INFO ]: Finished difference Result 1085 states and 3507 transitions. [2018-06-24 21:15:36,248 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-06-24 21:15:36,248 INFO ]: Start accepts. Automaton has 20 states. Word has length 250 [2018-06-24 21:15:36,248 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:15:36,275 INFO ]: With dead ends: 1085 [2018-06-24 21:15:36,275 INFO ]: Without dead ends: 933 [2018-06-24 21:15:36,280 INFO ]: 0 DeclaredPredicates, 387 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7378 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1877, Invalid=18715, Unknown=0, NotChecked=0, Total=20592 [2018-06-24 21:15:36,281 INFO ]: Start minimizeSevpa. Operand 933 states. [2018-06-24 21:15:36,406 INFO ]: Finished minimizeSevpa. Reduced states from 933 to 737. [2018-06-24 21:15:36,406 INFO ]: Start removeUnreachable. Operand 737 states. [2018-06-24 21:15:36,417 INFO ]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1646 transitions. [2018-06-24 21:15:36,417 INFO ]: Start accepts. Automaton has 737 states and 1646 transitions. Word has length 250 [2018-06-24 21:15:36,418 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:15:36,418 INFO ]: Abstraction has 737 states and 1646 transitions. [2018-06-24 21:15:36,418 INFO ]: Interpolant automaton has 20 states. [2018-06-24 21:15:36,418 INFO ]: Start isEmpty. Operand 737 states and 1646 transitions. [2018-06-24 21:15:36,452 INFO ]: Finished isEmpty. Found accepting run of length 473 [2018-06-24 21:15:36,452 INFO ]: Found error trace [2018-06-24 21:15:36,452 INFO ]: trace histogram [87, 34, 34, 34, 34, 34, 33, 14, 14, 14, 14, 10, 10, 10, 8, 7, 7, 7, 7, 7, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:15:36,452 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:15:36,453 INFO ]: Analyzing trace with hash 550525008, now seen corresponding path program 2 times [2018-06-24 21:15:36,453 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:15:36,453 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:15:36,453 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:15:36,453 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:15:36,453 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:15:36,711 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:15:37,808 INFO ]: Checked inductivity of 14661 backedges. 1039 proven. 1240 refuted. 0 times theorem prover too weak. 12382 trivial. 0 not checked. [2018-06-24 21:15:37,808 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:15:37,808 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:15:37,814 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:15:38,485 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:15:38,485 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:15:38,521 INFO ]: Computing forward predicates... [2018-06-24 21:15:38,756 INFO ]: Checked inductivity of 14661 backedges. 2419 proven. 12 refuted. 0 times theorem prover too weak. 12230 trivial. 0 not checked. [2018-06-24 21:15:38,779 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:15:38,779 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 12 [2018-06-24 21:15:38,780 INFO ]: Interpolant automaton has 12 states [2018-06-24 21:15:38,780 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 21:15:38,780 INFO ]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-06-24 21:15:38,780 INFO ]: Start difference. First operand 737 states and 1646 transitions. Second operand 12 states. [2018-06-24 21:15:39,870 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:15:39,870 INFO ]: Finished difference Result 1234 states and 2671 transitions. [2018-06-24 21:15:39,870 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-06-24 21:15:39,870 INFO ]: Start accepts. Automaton has 12 states. Word has length 472 [2018-06-24 21:15:39,870 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:15:39,907 INFO ]: With dead ends: 1234 [2018-06-24 21:15:39,907 INFO ]: Without dead ends: 1234 [2018-06-24 21:15:39,908 INFO ]: 0 DeclaredPredicates, 519 GetRequests, 472 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 607 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=356, Invalid=1996, Unknown=0, NotChecked=0, Total=2352 [2018-06-24 21:15:39,909 INFO ]: Start minimizeSevpa. Operand 1234 states. [2018-06-24 21:15:40,008 INFO ]: Finished minimizeSevpa. Reduced states from 1234 to 826. [2018-06-24 21:15:40,008 INFO ]: Start removeUnreachable. Operand 826 states. [2018-06-24 21:15:40,020 INFO ]: Finished removeUnreachable. Reduced from 826 states to 826 states and 1760 transitions. [2018-06-24 21:15:40,020 INFO ]: Start accepts. Automaton has 826 states and 1760 transitions. Word has length 472 [2018-06-24 21:15:40,020 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:15:40,020 INFO ]: Abstraction has 826 states and 1760 transitions. [2018-06-24 21:15:40,020 INFO ]: Interpolant automaton has 12 states. [2018-06-24 21:15:40,021 INFO ]: Start isEmpty. Operand 826 states and 1760 transitions. [2018-06-24 21:15:40,048 INFO ]: Finished isEmpty. Found accepting run of length 325 [2018-06-24 21:15:40,048 INFO ]: Found error trace [2018-06-24 21:15:40,048 INFO ]: trace histogram [61, 23, 22, 22, 22, 22, 22, 8, 8, 8, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:15:40,048 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:15:40,049 INFO ]: Analyzing trace with hash -234227230, now seen corresponding path program 3 times [2018-06-24 21:15:40,049 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:15:40,049 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:15:40,049 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:15:40,049 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:15:40,049 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:15:40,208 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:15:40,551 WARN ]: Spent 110.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 3 [2018-06-24 21:15:41,185 INFO ]: Checked inductivity of 6755 backedges. 519 proven. 480 refuted. 0 times theorem prover too weak. 5756 trivial. 0 not checked. [2018-06-24 21:15:41,185 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:15:41,185 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:15:41,197 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:15:41,423 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-06-24 21:15:41,423 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:15:41,443 INFO ]: Computing forward predicates... [2018-06-24 21:15:41,880 INFO ]: Checked inductivity of 6755 backedges. 1937 proven. 21 refuted. 0 times theorem prover too weak. 4797 trivial. 0 not checked. [2018-06-24 21:15:41,900 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:15:41,900 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2018-06-24 21:15:41,901 INFO ]: Interpolant automaton has 25 states [2018-06-24 21:15:41,901 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-24 21:15:41,901 INFO ]: CoverageRelationStatistics Valid=55, Invalid=545, Unknown=0, NotChecked=0, Total=600 [2018-06-24 21:15:41,901 INFO ]: Start difference. First operand 826 states and 1760 transitions. Second operand 25 states. [2018-06-24 21:15:47,390 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:15:47,390 INFO ]: Finished difference Result 2132 states and 5612 transitions. [2018-06-24 21:15:47,391 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-06-24 21:15:47,391 INFO ]: Start accepts. Automaton has 25 states. Word has length 324 [2018-06-24 21:15:47,391 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:15:47,427 INFO ]: With dead ends: 2132 [2018-06-24 21:15:47,427 INFO ]: Without dead ends: 1753 [2018-06-24 21:15:47,428 INFO ]: 0 DeclaredPredicates, 416 GetRequests, 315 SyntacticMatches, 2 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2947 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1034, Invalid=9066, Unknown=0, NotChecked=0, Total=10100 [2018-06-24 21:15:47,429 INFO ]: Start minimizeSevpa. Operand 1753 states. [2018-06-24 21:15:47,595 INFO ]: Finished minimizeSevpa. Reduced states from 1753 to 1083. [2018-06-24 21:15:47,595 INFO ]: Start removeUnreachable. Operand 1083 states. [2018-06-24 21:15:47,615 INFO ]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 2611 transitions. [2018-06-24 21:15:47,615 INFO ]: Start accepts. Automaton has 1083 states and 2611 transitions. Word has length 324 [2018-06-24 21:15:47,616 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:15:47,616 INFO ]: Abstraction has 1083 states and 2611 transitions. [2018-06-24 21:15:47,616 INFO ]: Interpolant automaton has 25 states. [2018-06-24 21:15:47,616 INFO ]: Start isEmpty. Operand 1083 states and 2611 transitions. [2018-06-24 21:15:47,644 INFO ]: Finished isEmpty. Found accepting run of length 459 [2018-06-24 21:15:47,644 INFO ]: Found error trace [2018-06-24 21:15:47,644 INFO ]: trace histogram [88, 32, 32, 32, 32, 32, 26, 15, 15, 15, 13, 12, 12, 12, 12, 12, 9, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:15:47,644 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:15:47,645 INFO ]: Analyzing trace with hash 2025905721, now seen corresponding path program 4 times [2018-06-24 21:15:47,645 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:15:47,645 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:15:47,646 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:15:47,646 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:15:47,646 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:15:47,853 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:15:48,241 WARN ]: Spent 103.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 3 [2018-06-24 21:15:48,631 INFO ]: Checked inductivity of 13664 backedges. 835 proven. 1206 refuted. 0 times theorem prover too weak. 11623 trivial. 0 not checked. [2018-06-24 21:15:48,631 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:15:48,631 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:15:48,637 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:15:49,285 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:15:49,285 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:15:49,311 INFO ]: Computing forward predicates... [2018-06-24 21:15:49,900 INFO ]: Checked inductivity of 13664 backedges. 1079 proven. 872 refuted. 0 times theorem prover too weak. 11713 trivial. 0 not checked. [2018-06-24 21:15:49,939 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:15:49,939 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20] total 33 [2018-06-24 21:15:49,939 INFO ]: Interpolant automaton has 33 states [2018-06-24 21:15:49,940 INFO ]: Constructing interpolant automaton starting with 33 interpolants. [2018-06-24 21:15:49,940 INFO ]: CoverageRelationStatistics Valid=76, Invalid=980, Unknown=0, NotChecked=0, Total=1056 [2018-06-24 21:15:49,940 INFO ]: Start difference. First operand 1083 states and 2611 transitions. Second operand 33 states. Received shutdown request... [2018-06-24 21:15:57,223 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-06-24 21:15:57,223 WARN ]: Verification canceled [2018-06-24 21:15:57,226 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 21:15:57,227 WARN ]: Timeout [2018-06-24 21:15:57,227 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:15:57 BasicIcfg [2018-06-24 21:15:57,227 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 21:15:57,228 INFO ]: Toolchain (without parser) took 56310.16 ms. Allocated memory was 308.8 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 257.4 MB in the beginning and 1.3 GB in the end (delta: -1.0 GB). Peak memory consumption was 117.3 MB. Max. memory is 3.6 GB. [2018-06-24 21:15:57,228 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 308.8 MB. Free memory is still 274.4 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 21:15:57,229 INFO ]: ChcToBoogie took 81.92 ms. Allocated memory is still 308.8 MB. Free memory was 257.4 MB in the beginning and 254.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:15:57,229 INFO ]: Boogie Preprocessor took 63.47 ms. Allocated memory is still 308.8 MB. Free memory was 254.4 MB in the beginning and 252.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:15:57,229 INFO ]: RCFGBuilder took 632.11 ms. Allocated memory is still 308.8 MB. Free memory was 252.4 MB in the beginning and 227.3 MB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:15:57,230 INFO ]: BlockEncodingV2 took 556.35 ms. Allocated memory is still 308.8 MB. Free memory was 227.3 MB in the beginning and 202.4 MB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:15:57,230 INFO ]: TraceAbstraction took 54967.37 ms. Allocated memory was 308.8 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 202.4 MB in the beginning and 1.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 62.3 MB. Max. memory is 3.6 GB. [2018-06-24 21:15:57,236 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 74 locations, 115 edges - StatisticsResult: Encoded RCFG 45 locations, 87 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 308.8 MB. Free memory is still 274.4 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 81.92 ms. Allocated memory is still 308.8 MB. Free memory was 257.4 MB in the beginning and 254.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 63.47 ms. Allocated memory is still 308.8 MB. Free memory was 254.4 MB in the beginning and 252.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 632.11 ms. Allocated memory is still 308.8 MB. Free memory was 252.4 MB in the beginning and 227.3 MB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 556.35 ms. Allocated memory is still 308.8 MB. Free memory was 227.3 MB in the beginning and 202.4 MB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 54967.37 ms. Allocated memory was 308.8 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 202.4 MB in the beginning and 1.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 62.3 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (1083states) and interpolant automaton (currently 132 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (1042 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 45 locations, 1 error locations. TIMEOUT Result, 54.9s OverallTime, 21 OverallIterations, 88 TraceHistogramMax, 38.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2636 SDtfs, 1640 SDslu, 11061 SDs, 0 SdLazy, 36614 SolverSat, 4881 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 24.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3222 GetRequests, 2532 SyntacticMatches, 6 SemanticMatches, 684 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21646 ImplicationChecksByTransitivity, 15.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1083occurred in iteration=20, 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.9s AutomataMinimizationTime, 20 MinimizatonAttempts, 2036 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 1.1s SsaConstructionTime, 3.8s SatisfiabilityAnalysisTime, 8.9s InterpolantComputationTime, 5070 NumberOfCodeBlocks, 4865 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 5032 ConstructedInterpolants, 0 QuantifiedInterpolants, 1816383 SizeOfPredicates, 179 NumberOfNonLiveVariables, 26892 ConjunctsInSsa, 268 ConjunctsInUnsatCore, 38 InterpolantComputations, 10 PerfectInterpolantSequences, 90860/96438 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dotprod5.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_21-15-57-251.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dotprod5.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_21-15-57-251.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dotprod5.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_21-15-57-251.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dotprod5.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_21-15-57-251.csv Completed graceful shutdown