java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.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-25 09:24:46,951 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 09:24:46,953 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 09:24:46,963 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 09:24:46,963 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 09:24:46,964 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 09:24:46,965 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 09:24:46,969 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 09:24:46,970 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 09:24:46,971 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 09:24:46,972 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 09:24:46,972 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 09:24:46,973 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 09:24:46,974 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 09:24:46,975 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 09:24:46,976 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 09:24:46,979 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 09:24:46,991 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 09:24:46,993 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 09:24:46,994 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 09:24:46,995 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 09:24:46,997 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 09:24:46,997 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 09:24:46,997 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 09:24:46,998 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 09:24:46,999 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 09:24:47,005 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 09:24:47,006 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 09:24:47,007 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 09:24:47,007 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 09:24:47,008 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 09:24:47,008 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 09:24:47,009 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 09:24:47,009 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 09:24:47,010 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 09:24:47,010 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 09:24:47,035 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 09:24:47,036 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 09:24:47,036 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 09:24:47,036 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 09:24:47,040 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 09:24:47,041 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 09:24:47,041 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 09:24:47,041 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 09:24:47,042 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 09:24:47,042 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 09:24:47,042 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 09:24:47,042 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 09:24:47,042 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 09:24:47,044 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 09:24:47,044 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 09:24:47,044 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 09:24:47,045 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 09:24:47,045 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 09:24:47,045 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 09:24:47,045 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 09:24:47,045 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 09:24:47,047 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 09:24:47,047 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 09:24:47,096 INFO ]: Repository-Root is: /tmp [2018-06-25 09:24:47,110 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 09:24:47,113 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 09:24:47,115 INFO ]: Initializing SmtParser... [2018-06-25 09:24:47,115 INFO ]: SmtParser initialized [2018-06-25 09:24:47,116 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hopv/lia/mochi/dotprod5.smt2 [2018-06-25 09:24:47,117 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-25 09:24:47,211 INFO ]: Executing SMT file /storage/chc-comp/hopv/lia/mochi/dotprod5.smt2 unknown [2018-06-25 09:24:47,570 INFO ]: Succesfully executed SMT file /storage/chc-comp/hopv/lia/mochi/dotprod5.smt2 [2018-06-25 09:24:47,575 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 09:24:47,580 INFO ]: Walking toolchain with 4 elements. [2018-06-25 09:24:47,580 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 09:24:47,580 INFO ]: Initializing ChcToBoogie... [2018-06-25 09:24:47,580 INFO ]: ChcToBoogie initialized [2018-06-25 09:24:47,583 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:24:47" (1/1) ... [2018-06-25 09:24:47,647 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:24:47 Unit [2018-06-25 09:24:47,647 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 09:24:47,648 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 09:24:47,648 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 09:24:47,648 INFO ]: Boogie Preprocessor initialized [2018-06-25 09:24:47,667 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:24:47" (1/1) ... [2018-06-25 09:24:47,667 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:24:47" (1/1) ... [2018-06-25 09:24:47,676 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:24:47" (1/1) ... [2018-06-25 09:24:47,676 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:24:47" (1/1) ... [2018-06-25 09:24:47,694 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:24:47" (1/1) ... [2018-06-25 09:24:47,706 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:24:47" (1/1) ... [2018-06-25 09:24:47,708 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:24:47" (1/1) ... [2018-06-25 09:24:47,710 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 09:24:47,711 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 09:24:47,711 INFO ]: Initializing RCFGBuilder... [2018-06-25 09:24:47,711 INFO ]: RCFGBuilder initialized [2018-06-25 09:24:47,712 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:24:47" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 09:24:47,727 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 09:24:47,727 INFO ]: Found specification of procedure gotoProc [2018-06-25 09:24:47,727 INFO ]: Found implementation of procedure gotoProc [2018-06-25 09:24:47,727 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 09:24:47,727 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 09:24:47,727 INFO ]: Found implementation of procedure Ultimate.START [2018-06-25 09:24:48,454 INFO ]: Using library mode [2018-06-25 09:24:48,455 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:24:48 BoogieIcfgContainer [2018-06-25 09:24:48,456 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 09:24:48,457 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 09:24:48,457 INFO ]: Initializing TraceAbstraction... [2018-06-25 09:24:48,460 INFO ]: TraceAbstraction initialized [2018-06-25 09:24:48,460 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:24:47" (1/3) ... [2018-06-25 09:24:48,461 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62ac86ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 09:24:48, skipping insertion in model container [2018-06-25 09:24:48,461 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:24:47" (2/3) ... [2018-06-25 09:24:48,461 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62ac86ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 09:24:48, skipping insertion in model container [2018-06-25 09:24:48,461 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:24:48" (3/3) ... [2018-06-25 09:24:48,464 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-25 09:24:48,470 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 09:24:48,477 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 09:24:48,512 INFO ]: Using default assertion order modulation [2018-06-25 09:24:48,513 INFO ]: Interprodecural is true [2018-06-25 09:24:48,513 INFO ]: Hoare is false [2018-06-25 09:24:48,513 INFO ]: Compute interpolants for FPandBP [2018-06-25 09:24:48,513 INFO ]: Backedges is TWOTRACK [2018-06-25 09:24:48,513 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 09:24:48,513 INFO ]: Difference is false [2018-06-25 09:24:48,513 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 09:24:48,513 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 09:24:48,530 INFO ]: Start isEmpty. Operand 74 states. [2018-06-25 09:24:48,553 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-25 09:24:48,554 INFO ]: Found error trace [2018-06-25 09:24:48,555 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:24:48,555 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:24:48,559 INFO ]: Analyzing trace with hash 622284866, now seen corresponding path program 1 times [2018-06-25 09:24:48,560 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:24:48,561 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:24:48,600 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:48,600 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:24:48,600 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:48,655 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:48,829 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:24:48,831 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:24:48,831 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:24:48,832 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:24:48,847 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:24:48,847 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:24:48,850 INFO ]: Start difference. First operand 74 states. Second operand 4 states. [2018-06-25 09:24:49,851 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:24:49,851 INFO ]: Finished difference Result 99 states and 155 transitions. [2018-06-25 09:24:49,851 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:24:49,853 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-25 09:24:49,853 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:24:49,874 INFO ]: With dead ends: 99 [2018-06-25 09:24:49,874 INFO ]: Without dead ends: 99 [2018-06-25 09:24:49,875 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-25 09:24:49,892 INFO ]: Start minimizeSevpa. Operand 99 states. [2018-06-25 09:24:49,932 INFO ]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-06-25 09:24:49,934 INFO ]: Start removeUnreachable. Operand 99 states. [2018-06-25 09:24:49,939 INFO ]: Finished removeUnreachable. Reduced from 99 states to 99 states and 155 transitions. [2018-06-25 09:24:49,940 INFO ]: Start accepts. Automaton has 99 states and 155 transitions. Word has length 17 [2018-06-25 09:24:49,940 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:24:49,940 INFO ]: Abstraction has 99 states and 155 transitions. [2018-06-25 09:24:49,940 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:24:49,940 INFO ]: Start isEmpty. Operand 99 states and 155 transitions. [2018-06-25 09:24:49,945 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-25 09:24:49,945 INFO ]: Found error trace [2018-06-25 09:24:49,945 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:24:49,946 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:24:49,946 INFO ]: Analyzing trace with hash 213737614, now seen corresponding path program 1 times [2018-06-25 09:24:49,946 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:24:49,946 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:24:49,947 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:49,947 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:24:49,947 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:49,967 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:50,048 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:24:50,048 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:24:50,048 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-25 09:24:50,049 INFO ]: Interpolant automaton has 5 states [2018-06-25 09:24:50,049 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 09:24:50,049 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:24:50,050 INFO ]: Start difference. First operand 99 states and 155 transitions. Second operand 5 states. [2018-06-25 09:24:50,385 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:24:50,385 INFO ]: Finished difference Result 129 states and 231 transitions. [2018-06-25 09:24:50,387 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 09:24:50,387 INFO ]: Start accepts. Automaton has 5 states. Word has length 20 [2018-06-25 09:24:50,387 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:24:50,403 INFO ]: With dead ends: 129 [2018-06-25 09:24:50,403 INFO ]: Without dead ends: 129 [2018-06-25 09:24:50,404 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-06-25 09:24:50,404 INFO ]: Start minimizeSevpa. Operand 129 states. [2018-06-25 09:24:50,443 INFO ]: Finished minimizeSevpa. Reduced states from 129 to 104. [2018-06-25 09:24:50,443 INFO ]: Start removeUnreachable. Operand 104 states. [2018-06-25 09:24:50,448 INFO ]: Finished removeUnreachable. Reduced from 104 states to 104 states and 161 transitions. [2018-06-25 09:24:50,448 INFO ]: Start accepts. Automaton has 104 states and 161 transitions. Word has length 20 [2018-06-25 09:24:50,448 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:24:50,448 INFO ]: Abstraction has 104 states and 161 transitions. [2018-06-25 09:24:50,448 INFO ]: Interpolant automaton has 5 states. [2018-06-25 09:24:50,448 INFO ]: Start isEmpty. Operand 104 states and 161 transitions. [2018-06-25 09:24:50,464 INFO ]: Finished isEmpty. Found accepting run of length 85 [2018-06-25 09:24:50,464 INFO ]: Found error trace [2018-06-25 09:24:50,464 INFO ]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:24:50,464 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:24:50,464 INFO ]: Analyzing trace with hash 1881421639, now seen corresponding path program 1 times [2018-06-25 09:24:50,464 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:24:50,465 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:24:50,466 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:50,466 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:24:50,466 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:50,514 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:50,635 INFO ]: Checked inductivity of 121 backedges. 31 proven. 2 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-06-25 09:24:50,635 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:24:50,635 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) [2018-06-25 09:24:50,655 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:24:50,737 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:50,749 INFO ]: Computing forward predicates... [2018-06-25 09:24:50,787 INFO ]: Checked inductivity of 121 backedges. 31 proven. 2 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-06-25 09:24:50,822 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:24:50,823 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-25 09:24:50,823 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:24:50,823 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:24:50,823 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:24:50,823 INFO ]: Start difference. First operand 104 states and 161 transitions. Second operand 4 states. [2018-06-25 09:24:52,221 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:24:52,221 INFO ]: Finished difference Result 176 states and 274 transitions. [2018-06-25 09:24:52,221 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:24:52,221 INFO ]: Start accepts. Automaton has 4 states. Word has length 84 [2018-06-25 09:24:52,222 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:24:52,227 INFO ]: With dead ends: 176 [2018-06-25 09:24:52,227 INFO ]: Without dead ends: 176 [2018-06-25 09:24:52,228 INFO ]: 0 DeclaredPredicates, 89 GetRequests, 86 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-25 09:24:52,228 INFO ]: Start minimizeSevpa. Operand 176 states. [2018-06-25 09:24:52,248 INFO ]: Finished minimizeSevpa. Reduced states from 176 to 176. [2018-06-25 09:24:52,248 INFO ]: Start removeUnreachable. Operand 176 states. [2018-06-25 09:24:52,253 INFO ]: Finished removeUnreachable. Reduced from 176 states to 176 states and 274 transitions. [2018-06-25 09:24:52,253 INFO ]: Start accepts. Automaton has 176 states and 274 transitions. Word has length 84 [2018-06-25 09:24:52,253 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:24:52,253 INFO ]: Abstraction has 176 states and 274 transitions. [2018-06-25 09:24:52,253 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:24:52,254 INFO ]: Start isEmpty. Operand 176 states and 274 transitions. [2018-06-25 09:24:52,263 INFO ]: Finished isEmpty. Found accepting run of length 103 [2018-06-25 09:24:52,263 INFO ]: Found error trace [2018-06-25 09:24:52,264 INFO ]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:24:52,264 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:24:52,264 INFO ]: Analyzing trace with hash 2072651063, now seen corresponding path program 1 times [2018-06-25 09:24:52,264 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:24:52,264 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:24:52,265 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:52,265 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:24:52,265 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:52,289 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:52,403 INFO ]: Checked inductivity of 197 backedges. 41 proven. 9 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-06-25 09:24:52,403 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:24:52,403 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:24:52,411 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:24:52,478 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:52,483 INFO ]: Computing forward predicates... [2018-06-25 09:24:52,499 INFO ]: Checked inductivity of 197 backedges. 41 proven. 9 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-06-25 09:24:52,531 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:24:52,531 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-25 09:24:52,531 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:24:52,531 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:24:52,531 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:24:52,532 INFO ]: Start difference. First operand 176 states and 274 transitions. Second operand 4 states. [2018-06-25 09:24:53,553 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:24:53,553 INFO ]: Finished difference Result 243 states and 380 transitions. [2018-06-25 09:24:53,574 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:24:53,574 INFO ]: Start accepts. Automaton has 4 states. Word has length 102 [2018-06-25 09:24:53,574 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:24:53,583 INFO ]: With dead ends: 243 [2018-06-25 09:24:53,583 INFO ]: Without dead ends: 243 [2018-06-25 09:24:53,583 INFO ]: 0 DeclaredPredicates, 107 GetRequests, 104 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-25 09:24:53,583 INFO ]: Start minimizeSevpa. Operand 243 states. [2018-06-25 09:24:53,609 INFO ]: Finished minimizeSevpa. Reduced states from 243 to 243. [2018-06-25 09:24:53,609 INFO ]: Start removeUnreachable. Operand 243 states. [2018-06-25 09:24:53,615 INFO ]: Finished removeUnreachable. Reduced from 243 states to 243 states and 380 transitions. [2018-06-25 09:24:53,615 INFO ]: Start accepts. Automaton has 243 states and 380 transitions. Word has length 102 [2018-06-25 09:24:53,616 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:24:53,616 INFO ]: Abstraction has 243 states and 380 transitions. [2018-06-25 09:24:53,616 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:24:53,616 INFO ]: Start isEmpty. Operand 243 states and 380 transitions. [2018-06-25 09:24:53,628 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-25 09:24:53,628 INFO ]: Found error trace [2018-06-25 09:24:53,628 INFO ]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:24:53,628 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:24:53,628 INFO ]: Analyzing trace with hash -1390058064, now seen corresponding path program 1 times [2018-06-25 09:24:53,628 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:24:53,628 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:24:53,629 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:53,629 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:24:53,629 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:53,681 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:53,756 INFO ]: Checked inductivity of 49 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-25 09:24:53,756 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:24:53,756 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:24:53,756 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:24:53,756 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:24:53,756 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:24:53,756 INFO ]: Start difference. First operand 243 states and 380 transitions. Second operand 4 states. [2018-06-25 09:24:54,030 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:24:54,030 INFO ]: Finished difference Result 343 states and 529 transitions. [2018-06-25 09:24:54,033 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:24:54,033 INFO ]: Start accepts. Automaton has 4 states. Word has length 57 [2018-06-25 09:24:54,033 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:24:54,041 INFO ]: With dead ends: 343 [2018-06-25 09:24:54,041 INFO ]: Without dead ends: 310 [2018-06-25 09:24:54,042 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:24:54,042 INFO ]: Start minimizeSevpa. Operand 310 states. [2018-06-25 09:24:54,067 INFO ]: Finished minimizeSevpa. Reduced states from 310 to 310. [2018-06-25 09:24:54,067 INFO ]: Start removeUnreachable. Operand 310 states. [2018-06-25 09:24:54,073 INFO ]: Finished removeUnreachable. Reduced from 310 states to 310 states and 478 transitions. [2018-06-25 09:24:54,073 INFO ]: Start accepts. Automaton has 310 states and 478 transitions. Word has length 57 [2018-06-25 09:24:54,074 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:24:54,074 INFO ]: Abstraction has 310 states and 478 transitions. [2018-06-25 09:24:54,074 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:24:54,074 INFO ]: Start isEmpty. Operand 310 states and 478 transitions. [2018-06-25 09:24:54,085 INFO ]: Finished isEmpty. Found accepting run of length 59 [2018-06-25 09:24:54,085 INFO ]: Found error trace [2018-06-25 09:24:54,085 INFO ]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:24:54,085 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:24:54,085 INFO ]: Analyzing trace with hash 937774098, now seen corresponding path program 1 times [2018-06-25 09:24:54,085 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:24:54,085 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:24:54,086 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:54,086 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:24:54,086 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:54,117 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:54,243 INFO ]: Checked inductivity of 48 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-06-25 09:24:54,243 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:24:54,243 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-25 09:24:54,250 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:24:54,280 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:54,283 INFO ]: Computing forward predicates... [2018-06-25 09:24:54,328 INFO ]: Checked inductivity of 48 backedges. 31 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-25 09:24:54,360 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:24:54,360 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-25 09:24:54,360 INFO ]: Interpolant automaton has 8 states [2018-06-25 09:24:54,360 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 09:24:54,360 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-25 09:24:54,361 INFO ]: Start difference. First operand 310 states and 478 transitions. Second operand 8 states. [2018-06-25 09:24:55,336 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:24:55,336 INFO ]: Finished difference Result 457 states and 876 transitions. [2018-06-25 09:24:55,336 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-25 09:24:55,336 INFO ]: Start accepts. Automaton has 8 states. Word has length 58 [2018-06-25 09:24:55,336 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:24:55,349 INFO ]: With dead ends: 457 [2018-06-25 09:24:55,350 INFO ]: Without dead ends: 401 [2018-06-25 09:24:55,350 INFO ]: 0 DeclaredPredicates, 80 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2018-06-25 09:24:55,350 INFO ]: Start minimizeSevpa. Operand 401 states. [2018-06-25 09:24:55,396 INFO ]: Finished minimizeSevpa. Reduced states from 401 to 318. [2018-06-25 09:24:55,396 INFO ]: Start removeUnreachable. Operand 318 states. [2018-06-25 09:24:55,402 INFO ]: Finished removeUnreachable. Reduced from 318 states to 318 states and 507 transitions. [2018-06-25 09:24:55,403 INFO ]: Start accepts. Automaton has 318 states and 507 transitions. Word has length 58 [2018-06-25 09:24:55,403 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:24:55,403 INFO ]: Abstraction has 318 states and 507 transitions. [2018-06-25 09:24:55,403 INFO ]: Interpolant automaton has 8 states. [2018-06-25 09:24:55,403 INFO ]: Start isEmpty. Operand 318 states and 507 transitions. [2018-06-25 09:24:55,410 INFO ]: Finished isEmpty. Found accepting run of length 60 [2018-06-25 09:24:55,410 INFO ]: Found error trace [2018-06-25 09:24:55,410 INFO ]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:24:55,410 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:24:55,410 INFO ]: Analyzing trace with hash -2121728380, now seen corresponding path program 1 times [2018-06-25 09:24:55,410 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:24:55,410 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:24:55,411 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:55,411 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:24:55,411 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:55,433 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:55,487 INFO ]: Checked inductivity of 52 backedges. 22 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-25 09:24:55,487 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:24:55,487 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:24:55,494 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:24:55,543 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:55,546 INFO ]: Computing forward predicates... [2018-06-25 09:24:55,553 INFO ]: Checked inductivity of 52 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-25 09:24:55,584 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-25 09:24:55,584 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2018-06-25 09:24:55,585 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:24:55,585 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:24:55,585 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:24:55,585 INFO ]: Start difference. First operand 318 states and 507 transitions. Second operand 4 states. [2018-06-25 09:24:56,194 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:24:56,194 INFO ]: Finished difference Result 364 states and 578 transitions. [2018-06-25 09:24:56,195 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:24:56,195 INFO ]: Start accepts. Automaton has 4 states. Word has length 59 [2018-06-25 09:24:56,195 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:24:56,201 INFO ]: With dead ends: 364 [2018-06-25 09:24:56,201 INFO ]: Without dead ends: 310 [2018-06-25 09:24:56,201 INFO ]: 0 DeclaredPredicates, 64 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:24:56,202 INFO ]: Start minimizeSevpa. Operand 310 states. [2018-06-25 09:24:56,220 INFO ]: Finished minimizeSevpa. Reduced states from 310 to 310. [2018-06-25 09:24:56,220 INFO ]: Start removeUnreachable. Operand 310 states. [2018-06-25 09:24:56,225 INFO ]: Finished removeUnreachable. Reduced from 310 states to 310 states and 485 transitions. [2018-06-25 09:24:56,226 INFO ]: Start accepts. Automaton has 310 states and 485 transitions. Word has length 59 [2018-06-25 09:24:56,226 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:24:56,226 INFO ]: Abstraction has 310 states and 485 transitions. [2018-06-25 09:24:56,226 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:24:56,226 INFO ]: Start isEmpty. Operand 310 states and 485 transitions. [2018-06-25 09:24:56,232 INFO ]: Finished isEmpty. Found accepting run of length 75 [2018-06-25 09:24:56,232 INFO ]: Found error trace [2018-06-25 09:24:56,232 INFO ]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:24:56,232 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:24:56,233 INFO ]: Analyzing trace with hash -1386404345, now seen corresponding path program 1 times [2018-06-25 09:24:56,233 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:24:56,233 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:24:56,233 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:56,233 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:24:56,233 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:56,245 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:56,324 INFO ]: Checked inductivity of 87 backedges. 33 proven. 15 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-06-25 09:24:56,324 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:24:56,324 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-25 09:24:56,333 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:24:56,370 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:56,375 INFO ]: Computing forward predicates... [2018-06-25 09:24:56,386 INFO ]: Checked inductivity of 87 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-25 09:24:56,406 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-25 09:24:56,406 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2018-06-25 09:24:56,407 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:24:56,407 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:24:56,407 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:24:56,407 INFO ]: Start difference. First operand 310 states and 485 transitions. Second operand 4 states. [2018-06-25 09:24:56,738 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:24:56,739 INFO ]: Finished difference Result 423 states and 665 transitions. [2018-06-25 09:24:56,739 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:24:56,739 INFO ]: Start accepts. Automaton has 4 states. Word has length 74 [2018-06-25 09:24:56,739 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:24:56,746 INFO ]: With dead ends: 423 [2018-06-25 09:24:56,746 INFO ]: Without dead ends: 378 [2018-06-25 09:24:56,746 INFO ]: 0 DeclaredPredicates, 79 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:24:56,747 INFO ]: Start minimizeSevpa. Operand 378 states. [2018-06-25 09:24:56,767 INFO ]: Finished minimizeSevpa. Reduced states from 378 to 378. [2018-06-25 09:24:56,767 INFO ]: Start removeUnreachable. Operand 378 states. [2018-06-25 09:24:56,773 INFO ]: Finished removeUnreachable. Reduced from 378 states to 378 states and 587 transitions. [2018-06-25 09:24:56,773 INFO ]: Start accepts. Automaton has 378 states and 587 transitions. Word has length 74 [2018-06-25 09:24:56,773 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:24:56,773 INFO ]: Abstraction has 378 states and 587 transitions. [2018-06-25 09:24:56,773 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:24:56,773 INFO ]: Start isEmpty. Operand 378 states and 587 transitions. [2018-06-25 09:24:56,777 INFO ]: Finished isEmpty. Found accepting run of length 78 [2018-06-25 09:24:56,777 INFO ]: Found error trace [2018-06-25 09:24:56,777 INFO ]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:24:56,778 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:24:56,778 INFO ]: Analyzing trace with hash 806854389, now seen corresponding path program 1 times [2018-06-25 09:24:56,778 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:24:56,778 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:24:56,778 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:56,778 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:24:56,778 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:56,789 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:56,938 INFO ]: Checked inductivity of 100 backedges. 33 proven. 22 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-25 09:24:56,939 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:24:56,939 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) [2018-06-25 09:24:56,952 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:24:57,003 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:57,007 INFO ]: Computing forward predicates... [2018-06-25 09:24:57,024 INFO ]: Checked inductivity of 100 backedges. 72 proven. 9 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-06-25 09:24:57,059 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:24:57,059 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-25 09:24:57,059 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:24:57,059 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:24:57,059 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:24:57,059 INFO ]: Start difference. First operand 378 states and 587 transitions. Second operand 4 states. [2018-06-25 09:24:57,465 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:24:57,466 INFO ]: Finished difference Result 390 states and 602 transitions. [2018-06-25 09:24:57,466 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:24:57,466 INFO ]: Start accepts. Automaton has 4 states. Word has length 77 [2018-06-25 09:24:57,466 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:24:57,471 INFO ]: With dead ends: 390 [2018-06-25 09:24:57,471 INFO ]: Without dead ends: 378 [2018-06-25 09:24:57,471 INFO ]: 0 DeclaredPredicates, 82 GetRequests, 79 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-25 09:24:57,471 INFO ]: Start minimizeSevpa. Operand 378 states. [2018-06-25 09:24:57,492 INFO ]: Finished minimizeSevpa. Reduced states from 378 to 378. [2018-06-25 09:24:57,492 INFO ]: Start removeUnreachable. Operand 378 states. [2018-06-25 09:24:57,497 INFO ]: Finished removeUnreachable. Reduced from 378 states to 378 states and 585 transitions. [2018-06-25 09:24:57,498 INFO ]: Start accepts. Automaton has 378 states and 585 transitions. Word has length 77 [2018-06-25 09:24:57,498 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:24:57,498 INFO ]: Abstraction has 378 states and 585 transitions. [2018-06-25 09:24:57,498 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:24:57,498 INFO ]: Start isEmpty. Operand 378 states and 585 transitions. [2018-06-25 09:24:57,504 INFO ]: Finished isEmpty. Found accepting run of length 97 [2018-06-25 09:24:57,504 INFO ]: Found error trace [2018-06-25 09:24:57,504 INFO ]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-06-25 09:24:57,504 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:24:57,504 INFO ]: Analyzing trace with hash -1856268202, now seen corresponding path program 2 times [2018-06-25 09:24:57,504 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:24:57,504 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:24:57,505 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:57,505 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:24:57,505 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:57,529 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:57,715 INFO ]: Checked inductivity of 166 backedges. 25 proven. 22 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-06-25 09:24:57,716 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:24:57,716 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-25 09:24:57,728 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:24:57,781 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:24:57,781 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:57,786 INFO ]: Computing forward predicates... [2018-06-25 09:24:58,356 INFO ]: Checked inductivity of 166 backedges. 39 proven. 17 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-06-25 09:24:58,389 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:24:58,389 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 15 [2018-06-25 09:24:58,389 INFO ]: Interpolant automaton has 15 states [2018-06-25 09:24:58,389 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-25 09:24:58,390 INFO ]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-06-25 09:24:58,390 INFO ]: Start difference. First operand 378 states and 585 transitions. Second operand 15 states. [2018-06-25 09:25:00,655 WARN ]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-06-25 09:25:01,037 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:25:01,037 INFO ]: Finished difference Result 586 states and 968 transitions. [2018-06-25 09:25:01,042 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-06-25 09:25:01,042 INFO ]: Start accepts. Automaton has 15 states. Word has length 96 [2018-06-25 09:25:01,043 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:25:01,058 INFO ]: With dead ends: 586 [2018-06-25 09:25:01,058 INFO ]: Without dead ends: 586 [2018-06-25 09:25:01,059 INFO ]: 0 DeclaredPredicates, 157 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 817 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=404, Invalid=2788, Unknown=0, NotChecked=0, Total=3192 [2018-06-25 09:25:01,059 INFO ]: Start minimizeSevpa. Operand 586 states. [2018-06-25 09:25:01,096 INFO ]: Finished minimizeSevpa. Reduced states from 586 to 442. [2018-06-25 09:25:01,096 INFO ]: Start removeUnreachable. Operand 442 states. [2018-06-25 09:25:01,102 INFO ]: Finished removeUnreachable. Reduced from 442 states to 442 states and 708 transitions. [2018-06-25 09:25:01,103 INFO ]: Start accepts. Automaton has 442 states and 708 transitions. Word has length 96 [2018-06-25 09:25:01,103 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:25:01,103 INFO ]: Abstraction has 442 states and 708 transitions. [2018-06-25 09:25:01,103 INFO ]: Interpolant automaton has 15 states. [2018-06-25 09:25:01,103 INFO ]: Start isEmpty. Operand 442 states and 708 transitions. [2018-06-25 09:25:01,112 INFO ]: Finished isEmpty. Found accepting run of length 109 [2018-06-25 09:25:01,112 INFO ]: Found error trace [2018-06-25 09:25:01,113 INFO ]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 3, 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] [2018-06-25 09:25:01,113 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:25:01,113 INFO ]: Analyzing trace with hash -1571763526, now seen corresponding path program 1 times [2018-06-25 09:25:01,113 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:25:01,113 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:25:01,113 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:25:01,114 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:25:01,114 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:25:01,145 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:25:01,408 INFO ]: Checked inductivity of 204 backedges. 32 proven. 23 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2018-06-25 09:25:01,408 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:25:01,408 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) [2018-06-25 09:25:01,425 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:25:01,476 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:25:01,481 INFO ]: Computing forward predicates... [2018-06-25 09:25:01,716 INFO ]: Checked inductivity of 204 backedges. 89 proven. 10 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-06-25 09:25:01,739 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:25:01,739 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2018-06-25 09:25:01,740 INFO ]: Interpolant automaton has 21 states [2018-06-25 09:25:01,740 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-25 09:25:01,740 INFO ]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2018-06-25 09:25:01,740 INFO ]: Start difference. First operand 442 states and 708 transitions. Second operand 21 states. [2018-06-25 09:25:09,781 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:25:09,781 INFO ]: Finished difference Result 1927 states and 6827 transitions. [2018-06-25 09:25:09,781 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-06-25 09:25:09,781 INFO ]: Start accepts. Automaton has 21 states. Word has length 108 [2018-06-25 09:25:09,782 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:25:09,907 INFO ]: With dead ends: 1927 [2018-06-25 09:25:09,907 INFO ]: Without dead ends: 1909 [2018-06-25 09:25:09,908 INFO ]: 0 DeclaredPredicates, 194 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1370 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=728, Invalid=4384, Unknown=0, NotChecked=0, Total=5112 [2018-06-25 09:25:09,909 INFO ]: Start minimizeSevpa. Operand 1909 states. [2018-06-25 09:25:10,399 INFO ]: Finished minimizeSevpa. Reduced states from 1909 to 1021. [2018-06-25 09:25:10,399 INFO ]: Start removeUnreachable. Operand 1021 states. [2018-06-25 09:25:10,421 INFO ]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 2286 transitions. [2018-06-25 09:25:10,421 INFO ]: Start accepts. Automaton has 1021 states and 2286 transitions. Word has length 108 [2018-06-25 09:25:10,421 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:25:10,421 INFO ]: Abstraction has 1021 states and 2286 transitions. [2018-06-25 09:25:10,421 INFO ]: Interpolant automaton has 21 states. [2018-06-25 09:25:10,421 INFO ]: Start isEmpty. Operand 1021 states and 2286 transitions. [2018-06-25 09:25:10,442 INFO ]: Finished isEmpty. Found accepting run of length 185 [2018-06-25 09:25:10,442 INFO ]: Found error trace [2018-06-25 09:25:10,443 INFO ]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:25:10,443 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:25:10,443 INFO ]: Analyzing trace with hash -1560335174, now seen corresponding path program 1 times [2018-06-25 09:25:10,443 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:25:10,443 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:25:10,446 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:25:10,446 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:25:10,447 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:25:10,489 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:25:10,955 INFO ]: Checked inductivity of 672 backedges. 132 proven. 33 refuted. 0 times theorem prover too weak. 507 trivial. 0 not checked. [2018-06-25 09:25:10,955 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:25:10,955 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-25 09:25:10,961 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:25:11,043 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:25:11,051 INFO ]: Computing forward predicates... [2018-06-25 09:25:11,247 INFO ]: Checked inductivity of 672 backedges. 214 proven. 60 refuted. 0 times theorem prover too weak. 398 trivial. 0 not checked. [2018-06-25 09:25:11,269 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:25:11,269 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 28 [2018-06-25 09:25:11,269 INFO ]: Interpolant automaton has 28 states [2018-06-25 09:25:11,269 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-25 09:25:11,270 INFO ]: CoverageRelationStatistics Valid=70, Invalid=686, Unknown=0, NotChecked=0, Total=756 [2018-06-25 09:25:11,271 INFO ]: Start difference. First operand 1021 states and 2286 transitions. Second operand 28 states. [2018-06-25 09:25:19,441 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:25:19,442 INFO ]: Finished difference Result 4001 states and 28082 transitions. [2018-06-25 09:25:19,442 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-06-25 09:25:19,442 INFO ]: Start accepts. Automaton has 28 states. Word has length 184 [2018-06-25 09:25:19,442 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:25:19,833 INFO ]: With dead ends: 4001 [2018-06-25 09:25:19,833 INFO ]: Without dead ends: 3862 [2018-06-25 09:25:19,836 INFO ]: 0 DeclaredPredicates, 324 GetRequests, 211 SyntacticMatches, 3 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3590 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1482, Invalid=10950, Unknown=0, NotChecked=0, Total=12432 [2018-06-25 09:25:19,837 INFO ]: Start minimizeSevpa. Operand 3862 states. [2018-06-25 09:25:22,810 INFO ]: Finished minimizeSevpa. Reduced states from 3862 to 1475. [2018-06-25 09:25:22,810 INFO ]: Start removeUnreachable. Operand 1475 states. [2018-06-25 09:25:22,854 INFO ]: Finished removeUnreachable. Reduced from 1475 states to 1475 states and 4091 transitions. [2018-06-25 09:25:22,854 INFO ]: Start accepts. Automaton has 1475 states and 4091 transitions. Word has length 184 [2018-06-25 09:25:22,854 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:25:22,854 INFO ]: Abstraction has 1475 states and 4091 transitions. [2018-06-25 09:25:22,854 INFO ]: Interpolant automaton has 28 states. [2018-06-25 09:25:22,854 INFO ]: Start isEmpty. Operand 1475 states and 4091 transitions. [2018-06-25 09:25:22,888 INFO ]: Finished isEmpty. Found accepting run of length 203 [2018-06-25 09:25:22,888 INFO ]: Found error trace [2018-06-25 09:25:22,888 INFO ]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:25:22,888 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:25:22,888 INFO ]: Analyzing trace with hash -378452759, now seen corresponding path program 1 times [2018-06-25 09:25:22,888 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:25:22,888 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:25:22,889 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:25:22,889 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:25:22,889 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:25:22,920 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:25:23,119 INFO ]: Checked inductivity of 827 backedges. 193 proven. 26 refuted. 0 times theorem prover too weak. 608 trivial. 0 not checked. [2018-06-25 09:25:23,120 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:25:23,120 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) [2018-06-25 09:25:23,128 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:25:23,224 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:25:23,228 INFO ]: Computing forward predicates... [2018-06-25 09:25:23,263 INFO ]: Checked inductivity of 827 backedges. 326 proven. 9 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2018-06-25 09:25:23,295 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:25:23,295 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-25 09:25:23,296 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:25:23,296 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:25:23,296 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:25:23,296 INFO ]: Start difference. First operand 1475 states and 4091 transitions. Second operand 4 states. [2018-06-25 09:25:23,530 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:25:23,530 INFO ]: Finished difference Result 1597 states and 4514 transitions. [2018-06-25 09:25:23,530 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:25:23,530 INFO ]: Start accepts. Automaton has 4 states. Word has length 202 [2018-06-25 09:25:23,530 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:25:23,577 INFO ]: With dead ends: 1597 [2018-06-25 09:25:23,577 INFO ]: Without dead ends: 1475 [2018-06-25 09:25:23,578 INFO ]: 0 DeclaredPredicates, 207 GetRequests, 204 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-25 09:25:23,578 INFO ]: Start minimizeSevpa. Operand 1475 states. [2018-06-25 09:25:23,726 INFO ]: Finished minimizeSevpa. Reduced states from 1475 to 1475. [2018-06-25 09:25:23,726 INFO ]: Start removeUnreachable. Operand 1475 states. [2018-06-25 09:25:23,875 INFO ]: Finished removeUnreachable. Reduced from 1475 states to 1475 states and 4081 transitions. [2018-06-25 09:25:23,875 INFO ]: Start accepts. Automaton has 1475 states and 4081 transitions. Word has length 202 [2018-06-25 09:25:23,875 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:25:23,875 INFO ]: Abstraction has 1475 states and 4081 transitions. [2018-06-25 09:25:23,875 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:25:23,875 INFO ]: Start isEmpty. Operand 1475 states and 4081 transitions. [2018-06-25 09:25:23,898 INFO ]: Finished isEmpty. Found accepting run of length 223 [2018-06-25 09:25:23,898 INFO ]: Found error trace [2018-06-25 09:25:23,898 INFO ]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 10, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:25:23,898 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:25:23,898 INFO ]: Analyzing trace with hash -2080022922, now seen corresponding path program 2 times [2018-06-25 09:25:23,898 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:25:23,898 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:25:23,899 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:25:23,899 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:25:23,899 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:25:23,947 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:25:24,799 INFO ]: Checked inductivity of 1011 backedges. 136 proven. 53 refuted. 0 times theorem prover too weak. 822 trivial. 0 not checked. [2018-06-25 09:25:24,799 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:25:24,799 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) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:25:24,806 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:25:24,897 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:25:24,897 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:25:24,902 INFO ]: Computing forward predicates... [2018-06-25 09:25:25,166 INFO ]: Checked inductivity of 1011 backedges. 250 proven. 82 refuted. 0 times theorem prover too weak. 679 trivial. 0 not checked. [2018-06-25 09:25:25,185 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:25:25,186 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 22 [2018-06-25 09:25:25,186 INFO ]: Interpolant automaton has 22 states [2018-06-25 09:25:25,186 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-25 09:25:25,186 INFO ]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2018-06-25 09:25:25,186 INFO ]: Start difference. First operand 1475 states and 4081 transitions. Second operand 22 states. [2018-06-25 09:25:25,719 WARN ]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-06-25 09:25:27,960 WARN ]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-06-25 09:25:29,108 WARN ]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-25 09:25:30,113 WARN ]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-25 09:25:30,473 WARN ]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-06-25 09:25:34,381 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:25:34,381 INFO ]: Finished difference Result 6115 states and 42107 transitions. [2018-06-25 09:25:34,381 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-06-25 09:25:34,381 INFO ]: Start accepts. Automaton has 22 states. Word has length 222 [2018-06-25 09:25:34,381 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:25:35,241 INFO ]: With dead ends: 6115 [2018-06-25 09:25:35,241 INFO ]: Without dead ends: 6115 [2018-06-25 09:25:35,245 INFO ]: 0 DeclaredPredicates, 404 GetRequests, 247 SyntacticMatches, 3 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9412 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=3875, Invalid=20305, Unknown=0, NotChecked=0, Total=24180 [2018-06-25 09:25:35,265 INFO ]: Start minimizeSevpa. Operand 6115 states. [2018-06-25 09:25:38,178 INFO ]: Finished minimizeSevpa. Reduced states from 6115 to 1899. [2018-06-25 09:25:38,178 INFO ]: Start removeUnreachable. Operand 1899 states. [2018-06-25 09:25:38,244 INFO ]: Finished removeUnreachable. Reduced from 1899 states to 1899 states and 5603 transitions. [2018-06-25 09:25:38,244 INFO ]: Start accepts. Automaton has 1899 states and 5603 transitions. Word has length 222 [2018-06-25 09:25:38,244 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:25:38,244 INFO ]: Abstraction has 1899 states and 5603 transitions. [2018-06-25 09:25:38,244 INFO ]: Interpolant automaton has 22 states. [2018-06-25 09:25:38,244 INFO ]: Start isEmpty. Operand 1899 states and 5603 transitions. [2018-06-25 09:25:38,266 INFO ]: Finished isEmpty. Found accepting run of length 198 [2018-06-25 09:25:38,266 INFO ]: Found error trace [2018-06-25 09:25:38,267 INFO ]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 8, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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-25 09:25:38,267 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:25:38,267 INFO ]: Analyzing trace with hash -2076717471, now seen corresponding path program 1 times [2018-06-25 09:25:38,267 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:25:38,267 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:25:38,268 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:25:38,268 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:25:38,268 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:25:38,285 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:25:38,471 INFO ]: Checked inductivity of 783 backedges. 119 proven. 51 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2018-06-25 09:25:38,471 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:25:38,471 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-25 09:25:38,484 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-25 09:25:38,578 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:25:38,584 INFO ]: Computing forward predicates... [2018-06-25 09:25:38,601 INFO ]: Checked inductivity of 783 backedges. 253 proven. 39 refuted. 0 times theorem prover too weak. 491 trivial. 0 not checked. [2018-06-25 09:25:38,620 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:25:38,621 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-25 09:25:38,621 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:25:38,621 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:25:38,621 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:25:38,621 INFO ]: Start difference. First operand 1899 states and 5603 transitions. Second operand 4 states. [2018-06-25 09:25:38,896 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:25:38,896 INFO ]: Finished difference Result 2118 states and 6103 transitions. [2018-06-25 09:25:38,897 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:25:38,897 INFO ]: Start accepts. Automaton has 4 states. Word has length 197 [2018-06-25 09:25:38,897 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:25:38,970 INFO ]: With dead ends: 2118 [2018-06-25 09:25:38,970 INFO ]: Without dead ends: 1980 [2018-06-25 09:25:38,970 INFO ]: 0 DeclaredPredicates, 202 GetRequests, 199 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-25 09:25:38,971 INFO ]: Start minimizeSevpa. Operand 1980 states. [2018-06-25 09:25:39,134 INFO ]: Finished minimizeSevpa. Reduced states from 1980 to 1593. [2018-06-25 09:25:39,134 INFO ]: Start removeUnreachable. Operand 1593 states. [2018-06-25 09:25:39,182 INFO ]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 4213 transitions. [2018-06-25 09:25:39,182 INFO ]: Start accepts. Automaton has 1593 states and 4213 transitions. Word has length 197 [2018-06-25 09:25:39,182 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:25:39,182 INFO ]: Abstraction has 1593 states and 4213 transitions. [2018-06-25 09:25:39,182 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:25:39,182 INFO ]: Start isEmpty. Operand 1593 states and 4213 transitions. [2018-06-25 09:25:39,204 INFO ]: Finished isEmpty. Found accepting run of length 173 [2018-06-25 09:25:39,204 INFO ]: Found error trace [2018-06-25 09:25:39,205 INFO ]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2018-06-25 09:25:39,205 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:25:39,205 INFO ]: Analyzing trace with hash 413287958, now seen corresponding path program 3 times [2018-06-25 09:25:39,205 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:25:39,205 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:25:39,205 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:25:39,205 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:25:39,205 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:25:39,253 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:25:39,521 INFO ]: Checked inductivity of 612 backedges. 107 proven. 59 refuted. 0 times theorem prover too weak. 446 trivial. 0 not checked. [2018-06-25 09:25:39,521 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:25:39,521 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-25 09:25:39,526 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:25:39,712 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-06-25 09:25:39,712 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:25:39,718 INFO ]: Computing forward predicates... [2018-06-25 09:25:39,897 INFO ]: Checked inductivity of 612 backedges. 71 proven. 28 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2018-06-25 09:25:39,918 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:25:39,918 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 21 [2018-06-25 09:25:39,918 INFO ]: Interpolant automaton has 21 states [2018-06-25 09:25:39,919 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-25 09:25:39,919 INFO ]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2018-06-25 09:25:39,919 INFO ]: Start difference. First operand 1593 states and 4213 transitions. Second operand 21 states. [2018-06-25 09:25:42,147 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:25:42,147 INFO ]: Finished difference Result 2395 states and 6486 transitions. [2018-06-25 09:25:42,147 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-06-25 09:25:42,147 INFO ]: Start accepts. Automaton has 21 states. Word has length 172 [2018-06-25 09:25:42,148 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:25:42,208 INFO ]: With dead ends: 2395 [2018-06-25 09:25:42,208 INFO ]: Without dead ends: 1849 [2018-06-25 09:25:42,209 INFO ]: 0 DeclaredPredicates, 222 GetRequests, 168 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=521, Invalid=2449, Unknown=0, NotChecked=0, Total=2970 [2018-06-25 09:25:42,210 INFO ]: Start minimizeSevpa. Operand 1849 states. [2018-06-25 09:25:42,334 INFO ]: Finished minimizeSevpa. Reduced states from 1849 to 1551. [2018-06-25 09:25:42,334 INFO ]: Start removeUnreachable. Operand 1551 states. [2018-06-25 09:25:42,377 INFO ]: Finished removeUnreachable. Reduced from 1551 states to 1551 states and 4129 transitions. [2018-06-25 09:25:42,377 INFO ]: Start accepts. Automaton has 1551 states and 4129 transitions. Word has length 172 [2018-06-25 09:25:42,377 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:25:42,377 INFO ]: Abstraction has 1551 states and 4129 transitions. [2018-06-25 09:25:42,377 INFO ]: Interpolant automaton has 21 states. [2018-06-25 09:25:42,377 INFO ]: Start isEmpty. Operand 1551 states and 4129 transitions. [2018-06-25 09:25:42,398 INFO ]: Finished isEmpty. Found accepting run of length 261 [2018-06-25 09:25:42,398 INFO ]: Found error trace [2018-06-25 09:25:42,399 INFO ]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 12, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:25:42,399 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:25:42,399 INFO ]: Analyzing trace with hash -1493615750, now seen corresponding path program 3 times [2018-06-25 09:25:42,399 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:25:42,399 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:25:42,399 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:25:42,399 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:25:42,399 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:25:42,453 INFO ]: Conjunction of SSA is unsat Received shutdown request... [2018-06-25 09:25:43,242 WARN ]: Verification canceled [2018-06-25 09:25:43,245 WARN ]: Timeout [2018-06-25 09:25:43,245 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 09:25:43 BoogieIcfgContainer [2018-06-25 09:25:43,245 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 09:25:43,246 INFO ]: Toolchain (without parser) took 55670.91 ms. Allocated memory was 309.3 MB in the beginning and 1.3 GB in the end (delta: 990.9 MB). Free memory was 255.7 MB in the beginning and 763.9 MB in the end (delta: -508.2 MB). Peak memory consumption was 482.7 MB. Max. memory is 3.6 GB. [2018-06-25 09:25:43,246 INFO ]: SmtParser took 0.09 ms. Allocated memory is still 309.3 MB. Free memory is still 272.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 09:25:43,247 INFO ]: ChcToBoogie took 67.20 ms. Allocated memory is still 309.3 MB. Free memory was 255.7 MB in the beginning and 252.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:25:43,247 INFO ]: Boogie Preprocessor took 62.71 ms. Allocated memory is still 309.3 MB. Free memory was 252.7 MB in the beginning and 250.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:25:43,247 INFO ]: RCFGBuilder took 744.83 ms. Allocated memory is still 309.3 MB. Free memory was 250.7 MB in the beginning and 225.6 MB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 3.6 GB. [2018-06-25 09:25:43,247 INFO ]: TraceAbstraction took 54788.25 ms. Allocated memory was 309.3 MB in the beginning and 1.3 GB in the end (delta: 990.9 MB). Free memory was 225.6 MB in the beginning and 763.9 MB in the end (delta: -538.3 MB). Peak memory consumption was 452.6 MB. Max. memory is 3.6 GB. [2018-06-25 09:25:43,249 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.09 ms. Allocated memory is still 309.3 MB. Free memory is still 272.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 67.20 ms. Allocated memory is still 309.3 MB. Free memory was 255.7 MB in the beginning and 252.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 62.71 ms. Allocated memory is still 309.3 MB. Free memory was 252.7 MB in the beginning and 250.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 744.83 ms. Allocated memory is still 309.3 MB. Free memory was 250.7 MB in the beginning and 225.6 MB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 3.6 GB. * TraceAbstraction took 54788.25 ms. Allocated memory was 309.3 MB in the beginning and 1.3 GB in the end (delta: 990.9 MB). Free memory was 225.6 MB in the beginning and 763.9 MB in the end (delta: -538.3 MB). Peak memory consumption was 452.6 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 (line 0). Cancelled while BasicCegarLoop was analyzing trace of length 261 with TraceHistMax 14, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 8 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 74 locations, 1 error locations. TIMEOUT Result, 54.7s OverallTime, 17 OverallIterations, 14 TraceHistogramMax, 38.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2546 SDtfs, 2915 SDslu, 12325 SDs, 0 SdLazy, 32091 SolverSat, 4352 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 23.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2230 GetRequests, 1730 SyntacticMatches, 8 SemanticMatches, 492 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15784 ImplicationChecksByTransitivity, 12.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1899occurred in iteration=14, 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: 7.5s AutomataMinimizationTime, 16 MinimizatonAttempts, 8428 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 3364 NumberOfCodeBlocks, 3364 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 3335 ConstructedInterpolants, 0 QuantifiedInterpolants, 656530 SizeOfPredicates, 91 NumberOfNonLiveVariables, 5721 ConjunctsInSsa, 156 ConjunctsInUnsatCore, 29 InterpolantComputations, 5 PerfectInterpolantSequences, 9206/9809 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.xml/Csv-Benchmark-0-2018-06-25_09-25-43-261.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dotprod5.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_09-25-43-261.csv Completed graceful shutdown