java -Xss1g -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/eldarica-misc/LIA/llreve/barthe_merged_unsafe.c-1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:09:20,801 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:09:20,804 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:09:20,818 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:09:20,818 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:09:20,819 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:09:20,820 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:09:20,822 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:09:20,824 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:09:20,824 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:09:20,825 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:09:20,826 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:09:20,826 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:09:20,828 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:09:20,828 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:09:20,829 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:09:20,833 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:09:20,836 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:09:20,846 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:09:20,848 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:09:20,849 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:09:20,852 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:09:20,852 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:09:20,853 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:09:20,854 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:09:20,861 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:09:20,862 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:09:20,862 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:09:20,863 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:09:20,863 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:09:20,864 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:09:20,865 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:09:20,865 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:09:20,869 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:09:20,870 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:09:20,871 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 01:09:20,891 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:09:20,891 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:09:20,892 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:09:20,892 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:09:20,893 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:09:20,893 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:09:20,893 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:09:20,893 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:09:20,893 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:09:20,894 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:09:20,894 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:09:20,894 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:09:20,894 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:09:20,894 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:09:20,895 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:09:20,895 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:09:20,895 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:09:20,896 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:09:20,897 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:09:20,939 INFO ]: Repository-Root is: /tmp [2018-06-22 01:09:20,954 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:09:20,959 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:09:20,961 INFO ]: Initializing SmtParser... [2018-06-22 01:09:20,961 INFO ]: SmtParser initialized [2018-06-22 01:09:20,961 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/barthe_merged_unsafe.c-1.smt2 [2018-06-22 01:09:20,963 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-22 01:09:21,040 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/barthe_merged_unsafe.c-1.smt2 unknown [2018-06-22 01:09:21,242 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/barthe_merged_unsafe.c-1.smt2 [2018-06-22 01:09:21,247 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:09:21,256 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:09:21,257 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:09:21,257 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:09:21,257 INFO ]: ChcToBoogie initialized [2018-06-22 01:09:21,261 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:09:21" (1/1) ... [2018-06-22 01:09:21,323 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:09:21 Unit [2018-06-22 01:09:21,323 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:09:21,323 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:09:21,323 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:09:21,323 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:09:21,338 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:09:21" (1/1) ... [2018-06-22 01:09:21,338 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:09:21" (1/1) ... [2018-06-22 01:09:21,343 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:09:21" (1/1) ... [2018-06-22 01:09:21,343 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:09:21" (1/1) ... [2018-06-22 01:09:21,347 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:09:21" (1/1) ... [2018-06-22 01:09:21,348 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:09:21" (1/1) ... [2018-06-22 01:09:21,349 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:09:21" (1/1) ... [2018-06-22 01:09:21,350 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:09:21,351 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:09:21,351 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:09:21,351 INFO ]: RCFGBuilder initialized [2018-06-22 01:09:21,351 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:09:21" (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-22 01:09:21,360 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:09:21,360 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:09:21,361 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:09:21,361 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:09:21,361 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:09:21,361 INFO ]: Found implementation of procedure Ultimate.START [2018-06-22 01:09:21,502 INFO ]: Using library mode [2018-06-22 01:09:21,502 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:09:21 BoogieIcfgContainer [2018-06-22 01:09:21,502 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:09:21,504 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:09:21,504 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:09:21,507 INFO ]: TraceAbstraction initialized [2018-06-22 01:09:21,507 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:09:21" (1/3) ... [2018-06-22 01:09:21,508 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b18c822 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:09:21, skipping insertion in model container [2018-06-22 01:09:21,508 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:09:21" (2/3) ... [2018-06-22 01:09:21,508 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b18c822 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:09:21, skipping insertion in model container [2018-06-22 01:09:21,509 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:09:21" (3/3) ... [2018-06-22 01:09:21,510 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:09:21,519 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:09:21,526 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:09:21,562 INFO ]: Using default assertion order modulation [2018-06-22 01:09:21,562 INFO ]: Interprodecural is true [2018-06-22 01:09:21,562 INFO ]: Hoare is false [2018-06-22 01:09:21,562 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:09:21,562 INFO ]: Backedges is TWOTRACK [2018-06-22 01:09:21,562 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:09:21,562 INFO ]: Difference is false [2018-06-22 01:09:21,562 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:09:21,562 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:09:21,576 INFO ]: Start isEmpty. Operand 11 states. [2018-06-22 01:09:21,587 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:09:21,587 INFO ]: Found error trace [2018-06-22 01:09:21,588 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:09:21,588 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:09:21,592 INFO ]: Analyzing trace with hash -1244060462, now seen corresponding path program 1 times [2018-06-22 01:09:21,595 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:09:21,595 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:09:21,632 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:21,632 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:09:21,632 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:21,674 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:21,776 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:21,779 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:09:21,779 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:09:21,781 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:09:21,797 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:09:21,798 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:09:21,805 INFO ]: Start difference. First operand 11 states. Second operand 3 states. [2018-06-22 01:09:21,898 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:09:21,898 INFO ]: Finished difference Result 10 states and 12 transitions. [2018-06-22 01:09:21,898 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:09:21,899 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-22 01:09:21,900 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:09:21,906 INFO ]: With dead ends: 10 [2018-06-22 01:09:21,906 INFO ]: Without dead ends: 10 [2018-06-22 01:09:21,908 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-22 01:09:21,921 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-22 01:09:21,937 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-22 01:09:21,938 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-22 01:09:21,939 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2018-06-22 01:09:21,940 INFO ]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 8 [2018-06-22 01:09:21,940 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:09:21,940 INFO ]: Abstraction has 10 states and 12 transitions. [2018-06-22 01:09:21,940 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:09:21,940 INFO ]: Start isEmpty. Operand 10 states and 12 transitions. [2018-06-22 01:09:21,940 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:09:21,940 INFO ]: Found error trace [2018-06-22 01:09:21,940 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:09:21,941 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:09:21,941 INFO ]: Analyzing trace with hash -29414762, now seen corresponding path program 1 times [2018-06-22 01:09:21,941 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:09:21,941 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:09:21,942 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:21,942 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:09:21,942 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:21,969 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:22,166 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:22,167 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:09:22,167 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-22 01:09:22,174 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:09:22,209 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:22,217 INFO ]: Computing forward predicates... [2018-06-22 01:09:22,329 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:22,372 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:09:22,372 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-22 01:09:22,373 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:09:22,373 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:09:22,373 INFO ]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:09:22,373 INFO ]: Start difference. First operand 10 states and 12 transitions. Second operand 5 states. [2018-06-22 01:09:22,655 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:09:22,655 INFO ]: Finished difference Result 12 states and 16 transitions. [2018-06-22 01:09:22,655 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:09:22,655 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-22 01:09:22,655 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:09:22,656 INFO ]: With dead ends: 12 [2018-06-22 01:09:22,656 INFO ]: Without dead ends: 12 [2018-06-22 01:09:22,656 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:09:22,657 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-22 01:09:22,658 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-22 01:09:22,658 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-22 01:09:22,659 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2018-06-22 01:09:22,659 INFO ]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 9 [2018-06-22 01:09:22,659 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:09:22,659 INFO ]: Abstraction has 12 states and 16 transitions. [2018-06-22 01:09:22,659 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:09:22,659 INFO ]: Start isEmpty. Operand 12 states and 16 transitions. [2018-06-22 01:09:22,660 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 01:09:22,660 INFO ]: Found error trace [2018-06-22 01:09:22,660 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:09:22,660 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:09:22,660 INFO ]: Analyzing trace with hash -48936, now seen corresponding path program 1 times [2018-06-22 01:09:22,660 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:09:22,660 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:09:22,661 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:22,661 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:09:22,661 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:22,695 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:22,769 INFO ]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:22,769 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:09:22,769 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-22 01:09:22,781 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:09:22,845 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:22,848 INFO ]: Computing forward predicates... [2018-06-22 01:09:22,862 INFO ]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:22,898 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:09:22,899 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 01:09:22,899 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:09:22,899 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:09:22,899 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:09:22,899 INFO ]: Start difference. First operand 12 states and 16 transitions. Second operand 4 states. [2018-06-22 01:09:23,057 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:09:23,058 INFO ]: Finished difference Result 14 states and 20 transitions. [2018-06-22 01:09:23,058 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 01:09:23,058 INFO ]: Start accepts. Automaton has 4 states. Word has length 10 [2018-06-22 01:09:23,059 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:09:23,059 INFO ]: With dead ends: 14 [2018-06-22 01:09:23,059 INFO ]: Without dead ends: 14 [2018-06-22 01:09:23,059 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:09:23,060 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-22 01:09:23,061 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 12. [2018-06-22 01:09:23,061 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-22 01:09:23,066 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2018-06-22 01:09:23,066 INFO ]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 10 [2018-06-22 01:09:23,066 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:09:23,066 INFO ]: Abstraction has 12 states and 16 transitions. [2018-06-22 01:09:23,066 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:09:23,066 INFO ]: Start isEmpty. Operand 12 states and 16 transitions. [2018-06-22 01:09:23,066 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 01:09:23,066 INFO ]: Found error trace [2018-06-22 01:09:23,067 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:09:23,067 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:09:23,067 INFO ]: Analyzing trace with hash -1986690538, now seen corresponding path program 2 times [2018-06-22 01:09:23,067 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:09:23,067 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:09:23,068 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:23,068 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:09:23,068 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:23,149 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:23,457 INFO ]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:09:23,458 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:09:23,458 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-22 01:09:23,466 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:09:23,543 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:09:23,543 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:23,547 INFO ]: Computing forward predicates... [2018-06-22 01:09:23,782 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:23,808 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:09:23,808 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2018-06-22 01:09:23,808 INFO ]: Interpolant automaton has 8 states [2018-06-22 01:09:23,808 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 01:09:23,808 INFO ]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:09:23,809 INFO ]: Start difference. First operand 12 states and 16 transitions. Second operand 8 states. [2018-06-22 01:09:23,941 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:09:23,941 INFO ]: Finished difference Result 16 states and 24 transitions. [2018-06-22 01:09:23,943 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 01:09:23,943 INFO ]: Start accepts. Automaton has 8 states. Word has length 11 [2018-06-22 01:09:23,944 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:09:23,944 INFO ]: With dead ends: 16 [2018-06-22 01:09:23,944 INFO ]: Without dead ends: 16 [2018-06-22 01:09:23,944 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:09:23,944 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-22 01:09:23,946 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 12. [2018-06-22 01:09:23,946 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-22 01:09:23,947 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2018-06-22 01:09:23,947 INFO ]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 11 [2018-06-22 01:09:23,947 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:09:23,947 INFO ]: Abstraction has 12 states and 16 transitions. [2018-06-22 01:09:23,947 INFO ]: Interpolant automaton has 8 states. [2018-06-22 01:09:23,947 INFO ]: Start isEmpty. Operand 12 states and 16 transitions. [2018-06-22 01:09:23,947 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 01:09:23,947 INFO ]: Found error trace [2018-06-22 01:09:23,947 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:09:23,947 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:09:23,948 INFO ]: Analyzing trace with hash -119763120, now seen corresponding path program 2 times [2018-06-22 01:09:23,948 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:09:23,948 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:09:23,948 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:23,949 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:09:23,949 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:23,966 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:24,019 INFO ]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:24,019 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:09:24,019 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-22 01:09:24,026 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:09:24,079 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:09:24,079 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:24,081 INFO ]: Computing forward predicates... [2018-06-22 01:09:24,089 INFO ]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:24,126 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:09:24,126 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-22 01:09:24,126 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:09:24,126 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:09:24,126 INFO ]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:09:24,126 INFO ]: Start difference. First operand 12 states and 16 transitions. Second operand 5 states. [2018-06-22 01:09:24,226 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:09:24,226 INFO ]: Finished difference Result 13 states and 18 transitions. [2018-06-22 01:09:24,227 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:09:24,227 INFO ]: Start accepts. Automaton has 5 states. Word has length 11 [2018-06-22 01:09:24,227 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:09:24,227 INFO ]: With dead ends: 13 [2018-06-22 01:09:24,227 INFO ]: Without dead ends: 13 [2018-06-22 01:09:24,227 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:09:24,228 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-22 01:09:24,229 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-22 01:09:24,229 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-22 01:09:24,230 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2018-06-22 01:09:24,230 INFO ]: Start accepts. Automaton has 13 states and 18 transitions. Word has length 11 [2018-06-22 01:09:24,230 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:09:24,230 INFO ]: Abstraction has 13 states and 18 transitions. [2018-06-22 01:09:24,230 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:09:24,230 INFO ]: Start isEmpty. Operand 13 states and 18 transitions. [2018-06-22 01:09:24,230 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 01:09:24,230 INFO ]: Found error trace [2018-06-22 01:09:24,230 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:09:24,230 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:09:24,230 INFO ]: Analyzing trace with hash 464064472, now seen corresponding path program 3 times [2018-06-22 01:09:24,230 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:09:24,230 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:09:24,231 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:24,231 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:09:24,231 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:24,247 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:24,448 INFO ]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:24,448 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:09:24,448 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-22 01:09:24,463 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:09:24,528 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 01:09:24,528 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:24,530 INFO ]: Computing forward predicates... [2018-06-22 01:09:24,543 INFO ]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:24,575 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:09:24,576 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 01:09:24,576 INFO ]: Interpolant automaton has 6 states [2018-06-22 01:09:24,576 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 01:09:24,576 INFO ]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-06-22 01:09:24,576 INFO ]: Start difference. First operand 13 states and 18 transitions. Second operand 6 states. [2018-06-22 01:09:24,785 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:09:24,785 INFO ]: Finished difference Result 14 states and 20 transitions. [2018-06-22 01:09:24,786 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 01:09:24,786 INFO ]: Start accepts. Automaton has 6 states. Word has length 12 [2018-06-22 01:09:24,786 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:09:24,787 INFO ]: With dead ends: 14 [2018-06-22 01:09:24,787 INFO ]: Without dead ends: 14 [2018-06-22 01:09:24,787 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-06-22 01:09:24,787 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-22 01:09:24,788 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-22 01:09:24,789 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-22 01:09:24,789 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. [2018-06-22 01:09:24,789 INFO ]: Start accepts. Automaton has 14 states and 20 transitions. Word has length 12 [2018-06-22 01:09:24,789 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:09:24,789 INFO ]: Abstraction has 14 states and 20 transitions. [2018-06-22 01:09:24,789 INFO ]: Interpolant automaton has 6 states. [2018-06-22 01:09:24,789 INFO ]: Start isEmpty. Operand 14 states and 20 transitions. [2018-06-22 01:09:24,790 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 01:09:24,790 INFO ]: Found error trace [2018-06-22 01:09:24,790 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:09:24,790 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:09:24,790 INFO ]: Analyzing trace with hash 1382850640, now seen corresponding path program 4 times [2018-06-22 01:09:24,790 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:09:24,790 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:09:24,791 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:24,791 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:09:24,791 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:24,808 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:24,882 INFO ]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:24,882 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:09:24,882 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-22 01:09:24,894 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:09:24,939 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:09:24,939 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:24,942 INFO ]: Computing forward predicates... [2018-06-22 01:09:24,950 INFO ]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:24,983 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:09:24,983 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-22 01:09:24,983 INFO ]: Interpolant automaton has 7 states [2018-06-22 01:09:24,983 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 01:09:24,983 INFO ]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:09:24,983 INFO ]: Start difference. First operand 14 states and 20 transitions. Second operand 7 states. [2018-06-22 01:09:25,263 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:09:25,263 INFO ]: Finished difference Result 15 states and 22 transitions. [2018-06-22 01:09:25,265 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 01:09:25,265 INFO ]: Start accepts. Automaton has 7 states. Word has length 13 [2018-06-22 01:09:25,265 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:09:25,265 INFO ]: With dead ends: 15 [2018-06-22 01:09:25,265 INFO ]: Without dead ends: 15 [2018-06-22 01:09:25,266 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:09:25,266 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-22 01:09:25,267 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-22 01:09:25,267 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 01:09:25,268 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 22 transitions. [2018-06-22 01:09:25,268 INFO ]: Start accepts. Automaton has 15 states and 22 transitions. Word has length 13 [2018-06-22 01:09:25,268 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:09:25,268 INFO ]: Abstraction has 15 states and 22 transitions. [2018-06-22 01:09:25,268 INFO ]: Interpolant automaton has 7 states. [2018-06-22 01:09:25,268 INFO ]: Start isEmpty. Operand 15 states and 22 transitions. [2018-06-22 01:09:25,268 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-22 01:09:25,268 INFO ]: Found error trace [2018-06-22 01:09:25,268 INFO ]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:09:25,268 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:09:25,269 INFO ]: Analyzing trace with hash -199549224, now seen corresponding path program 5 times [2018-06-22 01:09:25,269 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:09:25,269 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:09:25,269 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:25,269 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:09:25,269 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:25,285 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:25,365 INFO ]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:25,365 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:09:25,365 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-22 01:09:25,372 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:09:25,408 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-22 01:09:25,408 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:25,410 INFO ]: Computing forward predicates... [2018-06-22 01:09:25,430 INFO ]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:25,450 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:09:25,450 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-22 01:09:25,450 INFO ]: Interpolant automaton has 8 states [2018-06-22 01:09:25,450 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 01:09:25,451 INFO ]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:09:25,451 INFO ]: Start difference. First operand 15 states and 22 transitions. Second operand 8 states. [2018-06-22 01:09:25,482 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:09:25,482 INFO ]: Finished difference Result 16 states and 24 transitions. [2018-06-22 01:09:25,485 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 01:09:25,485 INFO ]: Start accepts. Automaton has 8 states. Word has length 14 [2018-06-22 01:09:25,485 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:09:25,485 INFO ]: With dead ends: 16 [2018-06-22 01:09:25,485 INFO ]: Without dead ends: 16 [2018-06-22 01:09:25,486 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:09:25,486 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-22 01:09:25,488 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-22 01:09:25,488 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-22 01:09:25,489 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 24 transitions. [2018-06-22 01:09:25,489 INFO ]: Start accepts. Automaton has 16 states and 24 transitions. Word has length 14 [2018-06-22 01:09:25,489 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:09:25,489 INFO ]: Abstraction has 16 states and 24 transitions. [2018-06-22 01:09:25,489 INFO ]: Interpolant automaton has 8 states. [2018-06-22 01:09:25,489 INFO ]: Start isEmpty. Operand 16 states and 24 transitions. [2018-06-22 01:09:25,489 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-22 01:09:25,489 INFO ]: Found error trace [2018-06-22 01:09:25,489 INFO ]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:09:25,490 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:09:25,490 INFO ]: Analyzing trace with hash -2009304752, now seen corresponding path program 6 times [2018-06-22 01:09:25,490 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:09:25,490 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:09:25,490 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:25,490 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:09:25,490 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:25,529 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:25,780 INFO ]: Checked inductivity of 28 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:25,781 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:09:25,781 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-22 01:09:25,787 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:09:25,850 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-22 01:09:25,850 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:25,852 INFO ]: Computing forward predicates... [2018-06-22 01:09:25,862 INFO ]: Checked inductivity of 28 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:25,884 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:09:25,884 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-22 01:09:25,884 INFO ]: Interpolant automaton has 9 states [2018-06-22 01:09:25,884 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 01:09:25,884 INFO ]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:09:25,884 INFO ]: Start difference. First operand 16 states and 24 transitions. Second operand 9 states. [2018-06-22 01:09:25,995 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:09:25,995 INFO ]: Finished difference Result 17 states and 26 transitions. [2018-06-22 01:09:25,996 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 01:09:25,996 INFO ]: Start accepts. Automaton has 9 states. Word has length 15 [2018-06-22 01:09:25,996 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:09:25,996 INFO ]: With dead ends: 17 [2018-06-22 01:09:25,996 INFO ]: Without dead ends: 17 [2018-06-22 01:09:25,997 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:09:25,997 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-22 01:09:25,998 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-22 01:09:25,998 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 01:09:25,999 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 26 transitions. [2018-06-22 01:09:25,999 INFO ]: Start accepts. Automaton has 17 states and 26 transitions. Word has length 15 [2018-06-22 01:09:25,999 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:09:25,999 INFO ]: Abstraction has 17 states and 26 transitions. [2018-06-22 01:09:25,999 INFO ]: Interpolant automaton has 9 states. [2018-06-22 01:09:25,999 INFO ]: Start isEmpty. Operand 17 states and 26 transitions. [2018-06-22 01:09:26,000 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-22 01:09:26,000 INFO ]: Found error trace [2018-06-22 01:09:26,000 INFO ]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:09:26,000 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:09:26,000 INFO ]: Analyzing trace with hash 2017816024, now seen corresponding path program 7 times [2018-06-22 01:09:26,000 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:09:26,000 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:09:26,001 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:26,001 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:09:26,001 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:26,021 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:26,617 INFO ]: Checked inductivity of 36 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:26,617 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:09:26,617 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-22 01:09:26,632 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:09:26,683 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:26,687 INFO ]: Computing forward predicates... [2018-06-22 01:09:26,699 INFO ]: Checked inductivity of 36 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:26,722 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:09:26,722 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-06-22 01:09:26,722 INFO ]: Interpolant automaton has 10 states [2018-06-22 01:09:26,722 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 01:09:26,722 INFO ]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:09:26,722 INFO ]: Start difference. First operand 17 states and 26 transitions. Second operand 10 states. [2018-06-22 01:09:26,762 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:09:26,762 INFO ]: Finished difference Result 18 states and 28 transitions. [2018-06-22 01:09:26,762 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 01:09:26,762 INFO ]: Start accepts. Automaton has 10 states. Word has length 16 [2018-06-22 01:09:26,762 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:09:26,762 INFO ]: With dead ends: 18 [2018-06-22 01:09:26,762 INFO ]: Without dead ends: 18 [2018-06-22 01:09:26,763 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:09:26,763 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-22 01:09:26,765 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-22 01:09:26,765 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-22 01:09:26,765 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 28 transitions. [2018-06-22 01:09:26,765 INFO ]: Start accepts. Automaton has 18 states and 28 transitions. Word has length 16 [2018-06-22 01:09:26,766 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:09:26,766 INFO ]: Abstraction has 18 states and 28 transitions. [2018-06-22 01:09:26,766 INFO ]: Interpolant automaton has 10 states. [2018-06-22 01:09:26,766 INFO ]: Start isEmpty. Operand 18 states and 28 transitions. [2018-06-22 01:09:26,770 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 01:09:26,770 INFO ]: Found error trace [2018-06-22 01:09:26,770 INFO ]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:09:26,770 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:09:26,770 INFO ]: Analyzing trace with hash -1990458800, now seen corresponding path program 8 times [2018-06-22 01:09:26,770 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:09:26,770 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:09:26,771 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:26,771 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:09:26,771 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:26,787 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:26,985 INFO ]: Checked inductivity of 45 backedges. 9 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:26,985 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:09:26,985 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-22 01:09:26,999 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:09:27,068 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:09:27,068 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:27,076 INFO ]: Computing forward predicates... [2018-06-22 01:09:27,091 INFO ]: Checked inductivity of 45 backedges. 9 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:27,116 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:09:27,116 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-06-22 01:09:27,117 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:09:27,117 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:09:27,117 INFO ]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:09:27,117 INFO ]: Start difference. First operand 18 states and 28 transitions. Second operand 11 states. [2018-06-22 01:09:27,278 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:09:27,278 INFO ]: Finished difference Result 19 states and 30 transitions. [2018-06-22 01:09:27,278 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 01:09:27,279 INFO ]: Start accepts. Automaton has 11 states. Word has length 17 [2018-06-22 01:09:27,279 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:09:27,279 INFO ]: With dead ends: 19 [2018-06-22 01:09:27,279 INFO ]: Without dead ends: 19 [2018-06-22 01:09:27,280 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:09:27,280 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-22 01:09:27,281 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-22 01:09:27,281 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 01:09:27,284 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 30 transitions. [2018-06-22 01:09:27,284 INFO ]: Start accepts. Automaton has 19 states and 30 transitions. Word has length 17 [2018-06-22 01:09:27,284 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:09:27,284 INFO ]: Abstraction has 19 states and 30 transitions. [2018-06-22 01:09:27,284 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:09:27,284 INFO ]: Start isEmpty. Operand 19 states and 30 transitions. [2018-06-22 01:09:27,284 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-22 01:09:27,284 INFO ]: Found error trace [2018-06-22 01:09:27,284 INFO ]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:09:27,285 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:09:27,285 INFO ]: Analyzing trace with hash -1692926760, now seen corresponding path program 9 times [2018-06-22 01:09:27,285 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:09:27,285 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:09:27,285 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:27,285 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:09:27,285 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:27,315 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:27,454 INFO ]: Checked inductivity of 55 backedges. 10 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:27,454 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:09:27,454 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-22 01:09:27,460 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:09:27,528 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-22 01:09:27,528 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:09:27,532 INFO ]: Computing forward predicates... [2018-06-22 01:09:27,549 INFO ]: Checked inductivity of 55 backedges. 10 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:09:27,583 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:09:27,583 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-06-22 01:09:27,583 INFO ]: Interpolant automaton has 12 states [2018-06-22 01:09:27,584 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 01:09:27,584 INFO ]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:09:27,584 INFO ]: Start difference. First operand 19 states and 30 transitions. Second operand 12 states. [2018-06-22 01:09:27,839 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:09:27,840 INFO ]: Finished difference Result 20 states and 32 transitions. [2018-06-22 01:09:27,840 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 01:09:27,840 INFO ]: Start accepts. Automaton has 12 states. Word has length 18 [2018-06-22 01:09:27,840 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:09:27,840 INFO ]: With dead ends: 20 [2018-06-22 01:09:27,840 INFO ]: Without dead ends: 20 [2018-06-22 01:09:27,841 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:09:27,841 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-22 01:09:27,842 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-22 01:09:27,842 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-22 01:09:27,843 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 32 transitions. [2018-06-22 01:09:27,843 INFO ]: Start accepts. Automaton has 20 states and 32 transitions. Word has length 18 [2018-06-22 01:09:27,843 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:09:27,843 INFO ]: Abstraction has 20 states and 32 transitions. [2018-06-22 01:09:27,843 INFO ]: Interpolant automaton has 12 states. [2018-06-22 01:09:27,843 INFO ]: Start isEmpty. Operand 20 states and 32 transitions. [2018-06-22 01:09:27,844 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-22 01:09:27,844 INFO ]: Found error trace [2018-06-22 01:09:27,844 INFO ]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:09:27,844 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:09:27,844 INFO ]: Analyzing trace with hash -1059368112, now seen corresponding path program 10 times [2018-06-22 01:09:27,844 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:09:27,844 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:09:27,845 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:27,845 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:09:27,845 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:09:27,897 INFO ]: Conjunction of SSA is sat [2018-06-22 01:09:27,913 INFO ]: Counterexample might be feasible [2018-06-22 01:09:27,939 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:09:27 BoogieIcfgContainer [2018-06-22 01:09:27,939 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:09:27,940 INFO ]: Toolchain (without parser) took 6692.69 ms. Allocated memory was 305.7 MB in the beginning and 340.8 MB in the end (delta: 35.1 MB). Free memory was 260.1 MB in the beginning and 207.7 MB in the end (delta: 52.3 MB). Peak memory consumption was 87.5 MB. Max. memory is 3.6 GB. [2018-06-22 01:09:27,942 INFO ]: SmtParser took 0.09 ms. Allocated memory is still 305.7 MB. Free memory is still 268.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:09:27,942 INFO ]: ChcToBoogie took 66.16 ms. Allocated memory is still 305.7 MB. Free memory was 260.1 MB in the beginning and 256.1 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:09:27,942 INFO ]: Boogie Preprocessor took 26.96 ms. Allocated memory is still 305.7 MB. Free memory is still 256.1 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:09:27,943 INFO ]: RCFGBuilder took 151.72 ms. Allocated memory is still 305.7 MB. Free memory was 256.1 MB in the beginning and 248.1 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:09:27,943 INFO ]: TraceAbstraction took 6434.94 ms. Allocated memory was 305.7 MB in the beginning and 340.8 MB in the end (delta: 35.1 MB). Free memory was 246.1 MB in the beginning and 207.7 MB in the end (delta: 38.4 MB). Peak memory consumption was 73.5 MB. Max. memory is 3.6 GB. [2018-06-22 01:09:27,947 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 305.7 MB. Free memory is still 268.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 66.16 ms. Allocated memory is still 305.7 MB. Free memory was 260.1 MB in the beginning and 256.1 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 26.96 ms. Allocated memory is still 305.7 MB. Free memory is still 256.1 MB. There was no memory consumed. Max. memory is 3.6 GB. * RCFGBuilder took 151.72 ms. Allocated memory is still 305.7 MB. Free memory was 256.1 MB in the beginning and 248.1 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 6434.94 ms. Allocated memory was 305.7 MB in the beginning and 340.8 MB in the end (delta: 35.1 MB). Free memory was 246.1 MB in the beginning and 207.7 MB in the end (delta: 38.4 MB). Peak memory consumption was 73.5 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [UNKNOWN] : assertion can be violated assertion can be violated We found a FailurePath: [L0] CALL call gotoProc(0, 0, 0, 0, 0, 0, 0, 0); [L0] gotoSwitch := gotoSwitch_in; [L0] assume !(hbv_False_1_Int == hbv_False_2_Int); [L0] hhv_inv_main15_0_Int, hhv_inv_main15_1_Int, hhv_inv_main15_2_Int, hhv_inv_main15_3_Int, hhv_inv_main15_4_Int, hhv_inv_main15_5_Int, hhv_inv_main15_6_Int := hbv_False_3_Int, hbv_False_4_Int, hbv_False_5_Int, hbv_False_6_Int, hbv_False_7_Int, hbv_False_1_Int, hbv_False_2_Int; [L0] havoc hbv_False_2_Int, hbv_False_6_Int, hbv_False_3_Int, hbv_False_5_Int, hbv_False_7_Int, hbv_False_4_Int, hbv_False_1_Int; [L0] assume (((((hhv_inv_main15_4_Int == 10 && hhv_inv_main15_3_Int == 5 * (hbv_inv_main15_1_Int + 1) + hhv_inv_main15_1_Int) && 0 <= hhv_inv_main15_0_Int + -1 * (hbv_inv_main15_1_Int + 1) + -1) && hhv_inv_main15_6_Int == hbv_inv_main15_3_Int + 10) && hhv_inv_main15_2_Int == hbv_inv_main15_1_Int + 1) && hhv_inv_main15_5_Int == hbv_inv_main15_2_Int + (5 * (hbv_inv_main15_1_Int + 1) + hhv_inv_main15_1_Int)) && hbv_inv_main15_1_Int == 10; [L0] hhv_inv_main15_0_Int, hhv_inv_main15_1_Int, hhv_inv_main15_2_Int, hhv_inv_main15_3_Int, hhv_inv_main15_4_Int, hhv_inv_main15_5_Int, hhv_inv_main15_6_Int := hhv_inv_main15_0_Int, hhv_inv_main15_1_Int, hbv_inv_main15_1_Int, hbv_inv_main15_4_Int, hbv_inv_main15_5_Int, hbv_inv_main15_2_Int, hbv_inv_main15_3_Int; [L0] havoc hbv_inv_main15_5_Int, hbv_inv_main15_4_Int, hbv_inv_main15_2_Int, hbv_inv_main15_1_Int, hbv_inv_main15_3_Int; [L0] assume (((((hhv_inv_main15_3_Int == 5 * (hbv_inv_main15_1_Int + 1) + hhv_inv_main15_1_Int && hhv_inv_main15_5_Int == hbv_inv_main15_3_Int + (5 * (hbv_inv_main15_1_Int + 1) + hhv_inv_main15_1_Int)) && hhv_inv_main15_6_Int == hbv_inv_main15_4_Int + (hbv_inv_main15_2_Int + 5)) && 0 <= hhv_inv_main15_0_Int + -1 * (hbv_inv_main15_1_Int + 1) + -1) && hhv_inv_main15_4_Int == hbv_inv_main15_2_Int + 5) && hhv_inv_main15_2_Int == hbv_inv_main15_1_Int + 1) && !(hbv_inv_main15_1_Int == 10); [L0] hhv_inv_main15_0_Int, hhv_inv_main15_1_Int, hhv_inv_main15_2_Int, hhv_inv_main15_3_Int, hhv_inv_main15_4_Int, hhv_inv_main15_5_Int, hhv_inv_main15_6_Int := hhv_inv_main15_0_Int, hhv_inv_main15_1_Int, hbv_inv_main15_1_Int, hbv_inv_main15_5_Int, hbv_inv_main15_2_Int, hbv_inv_main15_3_Int, hbv_inv_main15_4_Int; [L0] havoc hbv_inv_main15_5_Int, hbv_inv_main15_4_Int, hbv_inv_main15_2_Int, hbv_inv_main15_1_Int, hbv_inv_main15_3_Int; [L0] assume (((((hhv_inv_main15_3_Int == 5 * (hbv_inv_main15_1_Int + 1) + hhv_inv_main15_1_Int && hhv_inv_main15_5_Int == hbv_inv_main15_3_Int + (5 * (hbv_inv_main15_1_Int + 1) + hhv_inv_main15_1_Int)) && hhv_inv_main15_6_Int == hbv_inv_main15_4_Int + (hbv_inv_main15_2_Int + 5)) && 0 <= hhv_inv_main15_0_Int + -1 * (hbv_inv_main15_1_Int + 1) + -1) && hhv_inv_main15_4_Int == hbv_inv_main15_2_Int + 5) && hhv_inv_main15_2_Int == hbv_inv_main15_1_Int + 1) && !(hbv_inv_main15_1_Int == 10); [L0] hhv_inv_main15_0_Int, hhv_inv_main15_1_Int, hhv_inv_main15_2_Int, hhv_inv_main15_3_Int, hhv_inv_main15_4_Int, hhv_inv_main15_5_Int, hhv_inv_main15_6_Int := hhv_inv_main15_0_Int, hhv_inv_main15_1_Int, hbv_inv_main15_1_Int, hbv_inv_main15_5_Int, hbv_inv_main15_2_Int, hbv_inv_main15_3_Int, hbv_inv_main15_4_Int; [L0] havoc hbv_inv_main15_5_Int, hbv_inv_main15_4_Int, hbv_inv_main15_2_Int, hbv_inv_main15_1_Int, hbv_inv_main15_3_Int; [L0] assume (((((hhv_inv_main15_3_Int == 5 * (hbv_inv_main15_1_Int + 1) + hhv_inv_main15_1_Int && hhv_inv_main15_5_Int == hbv_inv_main15_3_Int + (5 * (hbv_inv_main15_1_Int + 1) + hhv_inv_main15_1_Int)) && hhv_inv_main15_6_Int == hbv_inv_main15_4_Int + (hbv_inv_main15_2_Int + 5)) && 0 <= hhv_inv_main15_0_Int + -1 * (hbv_inv_main15_1_Int + 1) + -1) && hhv_inv_main15_4_Int == hbv_inv_main15_2_Int + 5) && hhv_inv_main15_2_Int == hbv_inv_main15_1_Int + 1) && !(hbv_inv_main15_1_Int == 10); [L0] hhv_inv_main15_0_Int, hhv_inv_main15_1_Int, hhv_inv_main15_2_Int, hhv_inv_main15_3_Int, hhv_inv_main15_4_Int, hhv_inv_main15_5_Int, hhv_inv_main15_6_Int := hhv_inv_main15_0_Int, hhv_inv_main15_1_Int, hbv_inv_main15_1_Int, hbv_inv_main15_5_Int, hbv_inv_main15_2_Int, hbv_inv_main15_3_Int, hbv_inv_main15_4_Int; [L0] havoc hbv_inv_main15_5_Int, hbv_inv_main15_4_Int, hbv_inv_main15_2_Int, hbv_inv_main15_1_Int, hbv_inv_main15_3_Int; [L0] assume (((((hhv_inv_main15_3_Int == 5 * (hbv_inv_main15_1_Int + 1) + hhv_inv_main15_1_Int && hhv_inv_main15_5_Int == hbv_inv_main15_3_Int + (5 * (hbv_inv_main15_1_Int + 1) + hhv_inv_main15_1_Int)) && hhv_inv_main15_6_Int == hbv_inv_main15_4_Int + (hbv_inv_main15_2_Int + 5)) && 0 <= hhv_inv_main15_0_Int + -1 * (hbv_inv_main15_1_Int + 1) + -1) && hhv_inv_main15_4_Int == hbv_inv_main15_2_Int + 5) && hhv_inv_main15_2_Int == hbv_inv_main15_1_Int + 1) && !(hbv_inv_main15_1_Int == 10); [L0] hhv_inv_main15_0_Int, hhv_inv_main15_1_Int, hhv_inv_main15_2_Int, hhv_inv_main15_3_Int, hhv_inv_main15_4_Int, hhv_inv_main15_5_Int, hhv_inv_main15_6_Int := hhv_inv_main15_0_Int, hhv_inv_main15_1_Int, hbv_inv_main15_1_Int, hbv_inv_main15_5_Int, hbv_inv_main15_2_Int, hbv_inv_main15_3_Int, hbv_inv_main15_4_Int; [L0] havoc hbv_inv_main15_5_Int, hbv_inv_main15_4_Int, hbv_inv_main15_2_Int, hbv_inv_main15_1_Int, hbv_inv_main15_3_Int; [L0] assume (((((hhv_inv_main15_3_Int == 5 * (hbv_inv_main15_1_Int + 1) + hhv_inv_main15_1_Int && hhv_inv_main15_5_Int == hbv_inv_main15_3_Int + (5 * (hbv_inv_main15_1_Int + 1) + hhv_inv_main15_1_Int)) && hhv_inv_main15_6_Int == hbv_inv_main15_4_Int + (hbv_inv_main15_2_Int + 5)) && 0 <= hhv_inv_main15_0_Int + -1 * (hbv_inv_main15_1_Int + 1) + -1) && hhv_inv_main15_4_Int == hbv_inv_main15_2_Int + 5) && hhv_inv_main15_2_Int == hbv_inv_main15_1_Int + 1) && !(hbv_inv_main15_1_Int == 10); [L0] hhv_inv_main15_0_Int, hhv_inv_main15_1_Int, hhv_inv_main15_2_Int, hhv_inv_main15_3_Int, hhv_inv_main15_4_Int, hhv_inv_main15_5_Int, hhv_inv_main15_6_Int := hhv_inv_main15_0_Int, hhv_inv_main15_1_Int, hbv_inv_main15_1_Int, hbv_inv_main15_5_Int, hbv_inv_main15_2_Int, hbv_inv_main15_3_Int, hbv_inv_main15_4_Int; [L0] havoc hbv_inv_main15_5_Int, hbv_inv_main15_4_Int, hbv_inv_main15_2_Int, hbv_inv_main15_1_Int, hbv_inv_main15_3_Int; [L0] assume (((((hhv_inv_main15_3_Int == 5 * (hbv_inv_main15_1_Int + 1) + hhv_inv_main15_1_Int && hhv_inv_main15_5_Int == hbv_inv_main15_3_Int + (5 * (hbv_inv_main15_1_Int + 1) + hhv_inv_main15_1_Int)) && hhv_inv_main15_6_Int == hbv_inv_main15_4_Int + (hbv_inv_main15_2_Int + 5)) && 0 <= hhv_inv_main15_0_Int + -1 * (hbv_inv_main15_1_Int + 1) + -1) && hhv_inv_main15_4_Int == hbv_inv_main15_2_Int + 5) && hhv_inv_main15_2_Int == hbv_inv_main15_1_Int + 1) && !(hbv_inv_main15_1_Int == 10); [L0] hhv_inv_main15_0_Int, hhv_inv_main15_1_Int, hhv_inv_main15_2_Int, hhv_inv_main15_3_Int, hhv_inv_main15_4_Int, hhv_inv_main15_5_Int, hhv_inv_main15_6_Int := hhv_inv_main15_0_Int, hhv_inv_main15_1_Int, hbv_inv_main15_1_Int, hbv_inv_main15_5_Int, hbv_inv_main15_2_Int, hbv_inv_main15_3_Int, hbv_inv_main15_4_Int; [L0] havoc hbv_inv_main15_5_Int, hbv_inv_main15_4_Int, hbv_inv_main15_2_Int, hbv_inv_main15_1_Int, hbv_inv_main15_3_Int; [L0] assume (((((hhv_inv_main15_3_Int == 5 * (hbv_inv_main15_1_Int + 1) + hhv_inv_main15_1_Int && hhv_inv_main15_5_Int == hbv_inv_main15_3_Int + (5 * (hbv_inv_main15_1_Int + 1) + hhv_inv_main15_1_Int)) && hhv_inv_main15_6_Int == hbv_inv_main15_4_Int + (hbv_inv_main15_2_Int + 5)) && 0 <= hhv_inv_main15_0_Int + -1 * (hbv_inv_main15_1_Int + 1) + -1) && hhv_inv_main15_4_Int == hbv_inv_main15_2_Int + 5) && hhv_inv_main15_2_Int == hbv_inv_main15_1_Int + 1) && !(hbv_inv_main15_1_Int == 10); [L0] hhv_inv_main15_0_Int, hhv_inv_main15_1_Int, hhv_inv_main15_2_Int, hhv_inv_main15_3_Int, hhv_inv_main15_4_Int, hhv_inv_main15_5_Int, hhv_inv_main15_6_Int := hhv_inv_main15_0_Int, hhv_inv_main15_1_Int, hbv_inv_main15_1_Int, hbv_inv_main15_5_Int, hbv_inv_main15_2_Int, hbv_inv_main15_3_Int, hbv_inv_main15_4_Int; [L0] havoc hbv_inv_main15_5_Int, hbv_inv_main15_4_Int, hbv_inv_main15_2_Int, hbv_inv_main15_1_Int, hbv_inv_main15_3_Int; [L0] assume (((((hhv_inv_main15_3_Int == 5 * (hbv_inv_main15_1_Int + 1) + hhv_inv_main15_1_Int && hhv_inv_main15_5_Int == hbv_inv_main15_3_Int + (5 * (hbv_inv_main15_1_Int + 1) + hhv_inv_main15_1_Int)) && hhv_inv_main15_6_Int == hbv_inv_main15_4_Int + (hbv_inv_main15_2_Int + 5)) && 0 <= hhv_inv_main15_0_Int + -1 * (hbv_inv_main15_1_Int + 1) + -1) && hhv_inv_main15_4_Int == hbv_inv_main15_2_Int + 5) && hhv_inv_main15_2_Int == hbv_inv_main15_1_Int + 1) && !(hbv_inv_main15_1_Int == 10); [L0] hhv_inv_main15_0_Int, hhv_inv_main15_1_Int, hhv_inv_main15_2_Int, hhv_inv_main15_3_Int, hhv_inv_main15_4_Int, hhv_inv_main15_5_Int, hhv_inv_main15_6_Int := hhv_inv_main15_0_Int, hhv_inv_main15_1_Int, hbv_inv_main15_1_Int, hbv_inv_main15_5_Int, hbv_inv_main15_2_Int, hbv_inv_main15_3_Int, hbv_inv_main15_4_Int; [L0] havoc hbv_inv_main15_5_Int, hbv_inv_main15_4_Int, hbv_inv_main15_2_Int, hbv_inv_main15_1_Int, hbv_inv_main15_3_Int; [L0] assume (((((hhv_inv_main15_3_Int == 5 * (hbv_inv_main15_1_Int + 1) + hhv_inv_main15_1_Int && hhv_inv_main15_5_Int == hbv_inv_main15_3_Int + (5 * (hbv_inv_main15_1_Int + 1) + hhv_inv_main15_1_Int)) && hhv_inv_main15_6_Int == hbv_inv_main15_4_Int + (hbv_inv_main15_2_Int + 5)) && 0 <= hhv_inv_main15_0_Int + -1 * (hbv_inv_main15_1_Int + 1) + -1) && hhv_inv_main15_4_Int == hbv_inv_main15_2_Int + 5) && hhv_inv_main15_2_Int == hbv_inv_main15_1_Int + 1) && !(hbv_inv_main15_1_Int == 10); [L0] hhv_inv_main15_0_Int, hhv_inv_main15_1_Int, hhv_inv_main15_2_Int, hhv_inv_main15_3_Int, hhv_inv_main15_4_Int, hhv_inv_main15_5_Int, hhv_inv_main15_6_Int := hhv_inv_main15_0_Int, hhv_inv_main15_1_Int, hbv_inv_main15_1_Int, hbv_inv_main15_5_Int, hbv_inv_main15_2_Int, hbv_inv_main15_3_Int, hbv_inv_main15_4_Int; [L0] havoc hbv_inv_main15_5_Int, hbv_inv_main15_4_Int, hbv_inv_main15_2_Int, hbv_inv_main15_1_Int, hbv_inv_main15_3_Int; [L0] assume (((((hhv_inv_main15_3_Int == 5 * (hbv_inv_main15_1_Int + 1) + hhv_inv_main15_1_Int && hhv_inv_main15_5_Int == hbv_inv_main15_3_Int + (5 * (hbv_inv_main15_1_Int + 1) + hhv_inv_main15_1_Int)) && hhv_inv_main15_6_Int == hbv_inv_main15_4_Int + (hbv_inv_main15_2_Int + 5)) && 0 <= hhv_inv_main15_0_Int + -1 * (hbv_inv_main15_1_Int + 1) + -1) && hhv_inv_main15_4_Int == hbv_inv_main15_2_Int + 5) && hhv_inv_main15_2_Int == hbv_inv_main15_1_Int + 1) && !(hbv_inv_main15_1_Int == 10); [L0] hhv_inv_main15_0_Int, hhv_inv_main15_1_Int, hhv_inv_main15_2_Int, hhv_inv_main15_3_Int, hhv_inv_main15_4_Int, hhv_inv_main15_5_Int, hhv_inv_main15_6_Int := hhv_inv_main15_0_Int, hhv_inv_main15_1_Int, hbv_inv_main15_1_Int, hbv_inv_main15_5_Int, hbv_inv_main15_2_Int, hbv_inv_main15_3_Int, hbv_inv_main15_4_Int; [L0] havoc hbv_inv_main15_5_Int, hbv_inv_main15_4_Int, hbv_inv_main15_2_Int, hbv_inv_main15_1_Int, hbv_inv_main15_3_Int; [L0] assume ((((hhv_inv_main15_3_Int == hhv_inv_main15_1_Int && hhv_inv_main15_5_Int == hhv_inv_main15_1_Int) && hhv_inv_main15_4_Int == hhv_inv_main15_1_Int) && hhv_inv_main15_2_Int == 0) && hhv_inv_main15_6_Int == hhv_inv_main15_1_Int) && 0 <= hhv_inv_main15_0_Int + -1; [L0] hhv_inv_main6_0_Int, hhv_inv_main6_1_Int, hhv_inv_main6_2_Int, hhv_inv_main6_3_Int, hhv_inv_main6_4_Int, hhv_inv_main6_5_Int, hhv_inv_main6_6_Int := hhv_inv_main15_0_Int, hhv_inv_main15_1_Int, hbv_inv_main15_1_Int, hbv_inv_main15_2_Int, hbv_inv_main15_3_Int, hbv_inv_main15_4_Int, hbv_inv_main15_5_Int; [L0] havoc hbv_inv_main15_5_Int, hbv_inv_main15_4_Int, hbv_inv_main15_2_Int, hbv_inv_main15_1_Int, hbv_inv_main15_3_Int; [L0] assume true; [L0] RET call gotoProc(0, 0, 0, 0, 0, 0, 0, 0); [L0] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 11 locations, 1 error locations. UNSAFE Result, 6.3s OverallTime, 13 OverallIterations, 10 TraceHistogramMax, 1.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 114 SDtfs, 0 SDslu, 360 SDs, 0 SdLazy, 291 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 220 GetRequests, 155 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 319 NumberOfCodeBlocks, 319 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 277 ConstructedInterpolants, 0 QuantifiedInterpolants, 8476 SizeOfPredicates, 19 NumberOfNonLiveVariables, 2243 ConjunctsInSsa, 207 ConjunctsInUnsatCore, 23 InterpolantComputations, 1 PerfectInterpolantSequences, 109/452 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/barthe_merged_unsafe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-09-27-958.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/barthe_merged_unsafe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-09-27-958.csv Received shutdown request...