java -Xss1g -Xmx8000000000 -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-comp18-benchmarks/lia/chc-lia-0269.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-20 22:57:33,333 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-20 22:57:33,334 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-20 22:57:33,345 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-20 22:57:33,346 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-20 22:57:33,349 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-20 22:57:33,350 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-20 22:57:33,352 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-20 22:57:33,353 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-20 22:57:33,355 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-20 22:57:33,356 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-20 22:57:33,356 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-20 22:57:33,357 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-20 22:57:33,358 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-20 22:57:33,361 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-20 22:57:33,361 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-20 22:57:33,363 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-20 22:57:33,376 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-20 22:57:33,378 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-20 22:57:33,379 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-20 22:57:33,380 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-20 22:57:33,382 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-20 22:57:33,382 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-20 22:57:33,382 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-20 22:57:33,383 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-20 22:57:33,388 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-20 22:57:33,389 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-20 22:57:33,389 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-20 22:57:33,390 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-20 22:57:33,390 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-20 22:57:33,391 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-20 22:57:33,392 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-20 22:57:33,392 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-20 22:57:33,392 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-20 22:57:33,393 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-20 22:57:33,393 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-20 22:57:33,414 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-20 22:57:33,414 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-20 22:57:33,414 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-20 22:57:33,415 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-20 22:57:33,415 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-20 22:57:33,416 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-20 22:57:33,416 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-20 22:57:33,416 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-20 22:57:33,416 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-20 22:57:33,416 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-20 22:57:33,417 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-20 22:57:33,417 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-20 22:57:33,417 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-20 22:57:33,417 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-20 22:57:33,417 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-20 22:57:33,417 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-20 22:57:33,418 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-20 22:57:33,421 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-20 22:57:33,421 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-20 22:57:33,474 INFO ]: Repository-Root is: /tmp [2018-06-20 22:57:33,488 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-20 22:57:33,494 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-20 22:57:33,496 INFO ]: Initializing SmtParser... [2018-06-20 22:57:33,496 INFO ]: SmtParser initialized [2018-06-20 22:57:33,496 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp18-benchmarks/lia/chc-lia-0269.smt2 [2018-06-20 22:57:33,498 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-20 22:57:33,586 INFO ]: Executing SMT file /storage/chc-comp18-benchmarks/lia/chc-lia-0269.smt2 unknown [2018-06-20 22:57:36,831 INFO ]: Succesfully executed SMT file /storage/chc-comp18-benchmarks/lia/chc-lia-0269.smt2 [2018-06-20 22:57:36,836 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-20 22:57:36,842 INFO ]: Walking toolchain with 4 elements. [2018-06-20 22:57:36,842 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-20 22:57:36,842 INFO ]: Initializing ChcToBoogie... [2018-06-20 22:57:36,842 INFO ]: ChcToBoogie initialized [2018-06-20 22:57:36,845 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 20.06 10:57:36" (1/1) ... [2018-06-20 22:57:37,026 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 20.06 10:57:37 Unit [2018-06-20 22:57:37,027 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-20 22:57:37,027 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-20 22:57:37,027 INFO ]: Initializing Boogie Preprocessor... [2018-06-20 22:57:37,027 INFO ]: Boogie Preprocessor initialized [2018-06-20 22:57:37,047 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 20.06 10:57:37" (1/1) ... [2018-06-20 22:57:37,047 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 20.06 10:57:37" (1/1) ... [2018-06-20 22:57:37,132 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 20.06 10:57:37" (1/1) ... [2018-06-20 22:57:37,132 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 20.06 10:57:37" (1/1) ... [2018-06-20 22:57:37,228 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 20.06 10:57:37" (1/1) ... [2018-06-20 22:57:37,233 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 20.06 10:57:37" (1/1) ... [2018-06-20 22:57:37,275 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 20.06 10:57:37" (1/1) ... [2018-06-20 22:57:37,321 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-20 22:57:37,321 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-20 22:57:37,321 INFO ]: Initializing RCFGBuilder... [2018-06-20 22:57:37,321 INFO ]: RCFGBuilder initialized [2018-06-20 22:57:37,322 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 20.06 10:57:37" (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-20 22:57:37,336 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-20 22:57:37,336 INFO ]: Found specification of procedure gotoProc [2018-06-20 22:57:37,336 INFO ]: Found implementation of procedure gotoProc [2018-06-20 22:57:37,336 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-20 22:57:37,336 INFO ]: Found specification of procedure Ultimate.START [2018-06-20 22:57:37,336 INFO ]: Found implementation of procedure Ultimate.START [2018-06-20 22:57:43,371 INFO ]: Using library mode [2018-06-20 22:57:43,371 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 10:57:43 BoogieIcfgContainer [2018-06-20 22:57:43,371 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-20 22:57:43,373 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-20 22:57:43,373 INFO ]: Initializing TraceAbstraction... [2018-06-20 22:57:43,376 INFO ]: TraceAbstraction initialized [2018-06-20 22:57:43,376 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 20.06 10:57:36" (1/3) ... [2018-06-20 22:57:43,377 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d9d2405 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 20.06 10:57:43, skipping insertion in model container [2018-06-20 22:57:43,377 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 20.06 10:57:37" (2/3) ... [2018-06-20 22:57:43,377 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d9d2405 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.06 10:57:43, skipping insertion in model container [2018-06-20 22:57:43,377 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 10:57:43" (3/3) ... [2018-06-20 22:57:43,379 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-20 22:57:43,388 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-20 22:57:43,396 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-20 22:57:43,434 INFO ]: Using default assertion order modulation [2018-06-20 22:57:43,434 INFO ]: Interprodecural is true [2018-06-20 22:57:43,434 INFO ]: Hoare is false [2018-06-20 22:57:43,434 INFO ]: Compute interpolants for FPandBP [2018-06-20 22:57:43,434 INFO ]: Backedges is TWOTRACK [2018-06-20 22:57:43,434 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-20 22:57:43,434 INFO ]: Difference is false [2018-06-20 22:57:43,434 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-20 22:57:43,434 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-20 22:57:43,448 INFO ]: Start isEmpty. Operand 55 states. [2018-06-20 22:57:43,461 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-20 22:57:43,461 INFO ]: Found error trace [2018-06-20 22:57:43,462 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-20 22:57:43,462 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-20 22:57:43,466 INFO ]: Analyzing trace with hash -687005385, now seen corresponding path program 1 times [2018-06-20 22:57:43,468 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-20 22:57:43,468 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-20 22:57:43,501 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-20 22:57:43,501 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-20 22:57:43,501 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-20 22:57:43,536 INFO ]: Conjunction of SSA is unsat [2018-06-20 22:57:43,571 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-20 22:57:43,573 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-20 22:57:43,573 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-20 22:57:43,575 INFO ]: Interpolant automaton has 2 states [2018-06-20 22:57:43,591 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-20 22:57:43,591 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-20 22:57:43,594 INFO ]: Start difference. First operand 55 states. Second operand 2 states. [2018-06-20 22:57:43,621 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-20 22:57:43,621 INFO ]: Finished difference Result 53 states and 131 transitions. [2018-06-20 22:57:43,621 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-20 22:57:43,622 INFO ]: Start accepts. Automaton has 2 states. Word has length 6 [2018-06-20 22:57:43,623 INFO ]: Finished accepts. some prefix is accepted. [2018-06-20 22:57:43,633 INFO ]: With dead ends: 53 [2018-06-20 22:57:43,633 INFO ]: Without dead ends: 53 [2018-06-20 22:57:43,635 INFO ]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-20 22:57:43,653 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-20 22:57:43,675 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-06-20 22:57:43,676 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-20 22:57:43,678 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 131 transitions. [2018-06-20 22:57:43,679 INFO ]: Start accepts. Automaton has 53 states and 131 transitions. Word has length 6 [2018-06-20 22:57:43,679 INFO ]: Finished accepts. word is rejected. [2018-06-20 22:57:43,679 INFO ]: Abstraction has 53 states and 131 transitions. [2018-06-20 22:57:43,679 INFO ]: Interpolant automaton has 2 states. [2018-06-20 22:57:43,679 INFO ]: Start isEmpty. Operand 53 states and 131 transitions. [2018-06-20 22:57:43,680 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-20 22:57:43,680 INFO ]: Found error trace [2018-06-20 22:57:43,680 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-20 22:57:43,680 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-20 22:57:43,681 INFO ]: Analyzing trace with hash -1356384506, now seen corresponding path program 1 times [2018-06-20 22:57:43,681 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-20 22:57:43,681 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-20 22:57:43,681 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-20 22:57:43,681 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-20 22:57:43,681 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-20 22:57:43,758 INFO ]: Conjunction of SSA is unsat [2018-06-20 22:57:43,903 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-20 22:57:43,903 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-20 22:57:43,903 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-20 22:57:43,905 INFO ]: Interpolant automaton has 3 states [2018-06-20 22:57:43,905 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-20 22:57:43,905 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-20 22:57:43,905 INFO ]: Start difference. First operand 53 states and 131 transitions. Second operand 3 states. [2018-06-20 22:57:44,886 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-20 22:57:44,886 INFO ]: Finished difference Result 94 states and 246 transitions. [2018-06-20 22:57:44,887 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-20 22:57:44,887 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-20 22:57:44,887 INFO ]: Finished accepts. some prefix is accepted. [2018-06-20 22:57:44,890 INFO ]: With dead ends: 94 [2018-06-20 22:57:44,890 INFO ]: Without dead ends: 94 [2018-06-20 22:57:44,891 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-20 22:57:44,891 INFO ]: Start minimizeSevpa. Operand 94 states. [2018-06-20 22:57:44,899 INFO ]: Finished minimizeSevpa. Reduced states from 94 to 54. [2018-06-20 22:57:44,899 INFO ]: Start removeUnreachable. Operand 54 states. [2018-06-20 22:57:44,901 INFO ]: Finished removeUnreachable. Reduced from 54 states to 54 states and 170 transitions. [2018-06-20 22:57:44,901 INFO ]: Start accepts. Automaton has 54 states and 170 transitions. Word has length 9 [2018-06-20 22:57:44,902 INFO ]: Finished accepts. word is rejected. [2018-06-20 22:57:44,902 INFO ]: Abstraction has 54 states and 170 transitions. [2018-06-20 22:57:44,902 INFO ]: Interpolant automaton has 3 states. [2018-06-20 22:57:44,902 INFO ]: Start isEmpty. Operand 54 states and 170 transitions. [2018-06-20 22:57:44,902 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-20 22:57:44,902 INFO ]: Found error trace [2018-06-20 22:57:44,903 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-20 22:57:44,903 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-20 22:57:44,903 INFO ]: Analyzing trace with hash -2143008300, now seen corresponding path program 1 times [2018-06-20 22:57:44,903 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-20 22:57:44,903 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-20 22:57:44,904 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-20 22:57:44,904 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-20 22:57:44,904 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-20 22:57:44,962 INFO ]: Conjunction of SSA is unsat [2018-06-20 22:57:45,055 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-20 22:57:45,055 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-20 22:57:45,055 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-20 22:57:45,055 INFO ]: Interpolant automaton has 3 states [2018-06-20 22:57:45,055 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-20 22:57:45,055 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-20 22:57:45,055 INFO ]: Start difference. First operand 54 states and 170 transitions. Second operand 3 states. [2018-06-20 22:57:45,977 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-20 22:57:46,006 INFO ]: Finished difference Result 75 states and 250 transitions. [2018-06-20 22:57:46,006 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-20 22:57:46,006 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-20 22:57:46,006 INFO ]: Finished accepts. some prefix is accepted. [2018-06-20 22:57:46,009 INFO ]: With dead ends: 75 [2018-06-20 22:57:46,009 INFO ]: Without dead ends: 75 [2018-06-20 22:57:46,010 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-20 22:57:46,010 INFO ]: Start minimizeSevpa. Operand 75 states. [2018-06-20 22:57:46,020 INFO ]: Finished minimizeSevpa. Reduced states from 75 to 55. [2018-06-20 22:57:46,020 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-20 22:57:46,022 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 212 transitions. [2018-06-20 22:57:46,022 INFO ]: Start accepts. Automaton has 55 states and 212 transitions. Word has length 11 [2018-06-20 22:57:46,022 INFO ]: Finished accepts. word is rejected. [2018-06-20 22:57:46,022 INFO ]: Abstraction has 55 states and 212 transitions. [2018-06-20 22:57:46,022 INFO ]: Interpolant automaton has 3 states. [2018-06-20 22:57:46,022 INFO ]: Start isEmpty. Operand 55 states and 212 transitions. [2018-06-20 22:57:46,023 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-20 22:57:46,024 INFO ]: Found error trace [2018-06-20 22:57:46,024 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-20 22:57:46,024 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-20 22:57:46,024 INFO ]: Analyzing trace with hash 897628166, now seen corresponding path program 1 times [2018-06-20 22:57:46,024 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-20 22:57:46,024 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-20 22:57:46,025 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-20 22:57:46,025 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-20 22:57:46,025 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-20 22:57:46,089 INFO ]: Conjunction of SSA is unsat [2018-06-20 22:57:46,168 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-20 22:57:46,168 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-20 22:57:46,168 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-20 22:57:46,168 INFO ]: Interpolant automaton has 3 states [2018-06-20 22:57:46,168 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-20 22:57:46,168 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-20 22:57:46,168 INFO ]: Start difference. First operand 55 states and 212 transitions. Second operand 3 states. [2018-06-20 22:57:46,963 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-20 22:57:46,963 INFO ]: Finished difference Result 93 states and 324 transitions. [2018-06-20 22:57:46,963 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-20 22:57:46,963 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-20 22:57:46,964 INFO ]: Finished accepts. some prefix is accepted. [2018-06-20 22:57:46,966 INFO ]: With dead ends: 93 [2018-06-20 22:57:46,966 INFO ]: Without dead ends: 93 [2018-06-20 22:57:46,966 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-20 22:57:46,966 INFO ]: Start minimizeSevpa. Operand 93 states. [2018-06-20 22:57:46,972 INFO ]: Finished minimizeSevpa. Reduced states from 93 to 55. [2018-06-20 22:57:46,972 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-20 22:57:46,974 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 212 transitions. [2018-06-20 22:57:46,974 INFO ]: Start accepts. Automaton has 55 states and 212 transitions. Word has length 11 [2018-06-20 22:57:46,974 INFO ]: Finished accepts. word is rejected. [2018-06-20 22:57:46,974 INFO ]: Abstraction has 55 states and 212 transitions. [2018-06-20 22:57:46,974 INFO ]: Interpolant automaton has 3 states. [2018-06-20 22:57:46,974 INFO ]: Start isEmpty. Operand 55 states and 212 transitions. [2018-06-20 22:57:46,975 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-20 22:57:46,975 INFO ]: Found error trace [2018-06-20 22:57:46,975 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-20 22:57:46,975 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-20 22:57:46,975 INFO ]: Analyzing trace with hash 2033874516, now seen corresponding path program 1 times [2018-06-20 22:57:46,975 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-20 22:57:46,975 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-20 22:57:46,976 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-20 22:57:46,976 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-20 22:57:46,976 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-20 22:57:47,007 INFO ]: Conjunction of SSA is unsat [2018-06-20 22:57:47,062 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-20 22:57:47,062 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-20 22:57:47,062 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-20 22:57:47,063 INFO ]: Interpolant automaton has 3 states [2018-06-20 22:57:47,063 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-20 22:57:47,063 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-20 22:57:47,063 INFO ]: Start difference. First operand 55 states and 212 transitions. Second operand 3 states. [2018-06-20 22:57:47,826 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-20 22:57:47,827 INFO ]: Finished difference Result 94 states and 366 transitions. [2018-06-20 22:57:47,827 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-20 22:57:47,827 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-20 22:57:47,827 INFO ]: Finished accepts. some prefix is accepted. [2018-06-20 22:57:47,828 INFO ]: With dead ends: 94 [2018-06-20 22:57:47,828 INFO ]: Without dead ends: 94 [2018-06-20 22:57:47,829 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-20 22:57:47,829 INFO ]: Start minimizeSevpa. Operand 94 states. [2018-06-20 22:57:47,835 INFO ]: Finished minimizeSevpa. Reduced states from 94 to 55. [2018-06-20 22:57:47,835 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-20 22:57:47,836 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 212 transitions. [2018-06-20 22:57:47,836 INFO ]: Start accepts. Automaton has 55 states and 212 transitions. Word has length 11 [2018-06-20 22:57:47,836 INFO ]: Finished accepts. word is rejected. [2018-06-20 22:57:47,836 INFO ]: Abstraction has 55 states and 212 transitions. [2018-06-20 22:57:47,836 INFO ]: Interpolant automaton has 3 states. [2018-06-20 22:57:47,836 INFO ]: Start isEmpty. Operand 55 states and 212 transitions. [2018-06-20 22:57:47,837 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-20 22:57:47,837 INFO ]: Found error trace [2018-06-20 22:57:47,837 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-20 22:57:47,837 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-20 22:57:47,837 INFO ]: Analyzing trace with hash 503361158, now seen corresponding path program 1 times [2018-06-20 22:57:47,837 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-20 22:57:47,837 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-20 22:57:47,838 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-20 22:57:47,838 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-20 22:57:47,838 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-20 22:57:47,864 INFO ]: Conjunction of SSA is unsat [2018-06-20 22:57:47,947 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-20 22:57:47,947 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-20 22:57:47,947 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-20 22:57:47,948 INFO ]: Interpolant automaton has 3 states [2018-06-20 22:57:47,948 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-20 22:57:47,948 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-20 22:57:47,948 INFO ]: Start difference. First operand 55 states and 212 transitions. Second operand 3 states. [2018-06-20 22:57:49,541 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-20 22:57:49,541 INFO ]: Finished difference Result 96 states and 330 transitions. [2018-06-20 22:57:49,542 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-20 22:57:49,542 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-20 22:57:49,542 INFO ]: Finished accepts. some prefix is accepted. [2018-06-20 22:57:49,543 INFO ]: With dead ends: 96 [2018-06-20 22:57:49,543 INFO ]: Without dead ends: 96 [2018-06-20 22:57:49,543 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-20 22:57:49,544 INFO ]: Start minimizeSevpa. Operand 96 states. [2018-06-20 22:57:49,549 INFO ]: Finished minimizeSevpa. Reduced states from 96 to 55. [2018-06-20 22:57:49,549 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-20 22:57:49,550 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 212 transitions. [2018-06-20 22:57:49,550 INFO ]: Start accepts. Automaton has 55 states and 212 transitions. Word has length 11 [2018-06-20 22:57:49,550 INFO ]: Finished accepts. word is rejected. [2018-06-20 22:57:49,550 INFO ]: Abstraction has 55 states and 212 transitions. [2018-06-20 22:57:49,550 INFO ]: Interpolant automaton has 3 states. [2018-06-20 22:57:49,550 INFO ]: Start isEmpty. Operand 55 states and 212 transitions. [2018-06-20 22:57:49,551 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-20 22:57:49,551 INFO ]: Found error trace [2018-06-20 22:57:49,551 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-20 22:57:49,551 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-20 22:57:49,551 INFO ]: Analyzing trace with hash 1754124112, now seen corresponding path program 1 times [2018-06-20 22:57:49,551 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-20 22:57:49,551 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-20 22:57:49,551 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-20 22:57:49,551 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-20 22:57:49,552 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-20 22:57:49,581 INFO ]: Conjunction of SSA is unsat [2018-06-20 22:57:49,665 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-20 22:57:49,665 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-20 22:57:49,665 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-20 22:57:49,666 INFO ]: Interpolant automaton has 3 states [2018-06-20 22:57:49,666 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-20 22:57:49,666 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-20 22:57:49,666 INFO ]: Start difference. First operand 55 states and 212 transitions. Second operand 3 states. [2018-06-20 22:57:50,767 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-20 22:57:50,767 INFO ]: Finished difference Result 98 states and 332 transitions. [2018-06-20 22:57:50,767 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-20 22:57:50,767 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-20 22:57:50,767 INFO ]: Finished accepts. some prefix is accepted. [2018-06-20 22:57:50,768 INFO ]: With dead ends: 98 [2018-06-20 22:57:50,768 INFO ]: Without dead ends: 98 [2018-06-20 22:57:50,769 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-20 22:57:50,769 INFO ]: Start minimizeSevpa. Operand 98 states. [2018-06-20 22:57:50,775 INFO ]: Finished minimizeSevpa. Reduced states from 98 to 55. [2018-06-20 22:57:50,775 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-20 22:57:50,776 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 212 transitions. [2018-06-20 22:57:50,776 INFO ]: Start accepts. Automaton has 55 states and 212 transitions. Word has length 11 [2018-06-20 22:57:50,776 INFO ]: Finished accepts. word is rejected. [2018-06-20 22:57:50,776 INFO ]: Abstraction has 55 states and 212 transitions. [2018-06-20 22:57:50,776 INFO ]: Interpolant automaton has 3 states. [2018-06-20 22:57:50,776 INFO ]: Start isEmpty. Operand 55 states and 212 transitions. [2018-06-20 22:57:50,781 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-20 22:57:50,781 INFO ]: Found error trace [2018-06-20 22:57:50,781 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-20 22:57:50,781 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-20 22:57:50,781 INFO ]: Analyzing trace with hash 672162834, now seen corresponding path program 1 times [2018-06-20 22:57:50,781 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-20 22:57:50,781 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-20 22:57:50,782 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-20 22:57:50,782 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-20 22:57:50,782 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-20 22:57:50,816 INFO ]: Conjunction of SSA is unsat [2018-06-20 22:57:50,911 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-20 22:57:50,911 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-20 22:57:50,912 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-20 22:57:50,912 INFO ]: Interpolant automaton has 3 states [2018-06-20 22:57:50,912 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-20 22:57:50,912 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-20 22:57:50,912 INFO ]: Start difference. First operand 55 states and 212 transitions. Second operand 3 states. [2018-06-20 22:57:51,621 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-20 22:57:51,621 INFO ]: Finished difference Result 98 states and 332 transitions. [2018-06-20 22:57:51,621 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-20 22:57:51,621 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-20 22:57:51,621 INFO ]: Finished accepts. some prefix is accepted. [2018-06-20 22:57:51,622 INFO ]: With dead ends: 98 [2018-06-20 22:57:51,622 INFO ]: Without dead ends: 98 [2018-06-20 22:57:51,623 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-20 22:57:51,623 INFO ]: Start minimizeSevpa. Operand 98 states. [2018-06-20 22:57:51,627 INFO ]: Finished minimizeSevpa. Reduced states from 98 to 55. [2018-06-20 22:57:51,627 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-20 22:57:51,628 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 212 transitions. [2018-06-20 22:57:51,628 INFO ]: Start accepts. Automaton has 55 states and 212 transitions. Word has length 11 [2018-06-20 22:57:51,628 INFO ]: Finished accepts. word is rejected. [2018-06-20 22:57:51,628 INFO ]: Abstraction has 55 states and 212 transitions. [2018-06-20 22:57:51,628 INFO ]: Interpolant automaton has 3 states. [2018-06-20 22:57:51,628 INFO ]: Start isEmpty. Operand 55 states and 212 transitions. [2018-06-20 22:57:51,630 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-20 22:57:51,630 INFO ]: Found error trace [2018-06-20 22:57:51,630 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-20 22:57:51,630 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-20 22:57:51,630 INFO ]: Analyzing trace with hash -1455314030, now seen corresponding path program 1 times [2018-06-20 22:57:51,630 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-20 22:57:51,630 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-20 22:57:51,631 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-20 22:57:51,631 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-20 22:57:51,631 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-20 22:57:51,657 INFO ]: Conjunction of SSA is unsat [2018-06-20 22:57:51,738 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-20 22:57:51,738 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-20 22:57:51,738 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-20 22:57:51,739 INFO ]: Interpolant automaton has 3 states [2018-06-20 22:57:51,739 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-20 22:57:51,739 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-20 22:57:51,739 INFO ]: Start difference. First operand 55 states and 212 transitions. Second operand 3 states. [2018-06-20 22:57:52,529 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-20 22:57:52,529 INFO ]: Finished difference Result 98 states and 332 transitions. [2018-06-20 22:57:52,529 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-20 22:57:52,529 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-20 22:57:52,529 INFO ]: Finished accepts. some prefix is accepted. [2018-06-20 22:57:52,530 INFO ]: With dead ends: 98 [2018-06-20 22:57:52,530 INFO ]: Without dead ends: 98 [2018-06-20 22:57:52,530 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-20 22:57:52,531 INFO ]: Start minimizeSevpa. Operand 98 states. [2018-06-20 22:57:52,534 INFO ]: Finished minimizeSevpa. Reduced states from 98 to 55. [2018-06-20 22:57:52,534 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-20 22:57:52,535 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 212 transitions. [2018-06-20 22:57:52,535 INFO ]: Start accepts. Automaton has 55 states and 212 transitions. Word has length 11 [2018-06-20 22:57:52,535 INFO ]: Finished accepts. word is rejected. [2018-06-20 22:57:52,535 INFO ]: Abstraction has 55 states and 212 transitions. [2018-06-20 22:57:52,535 INFO ]: Interpolant automaton has 3 states. [2018-06-20 22:57:52,535 INFO ]: Start isEmpty. Operand 55 states and 212 transitions. [2018-06-20 22:57:52,536 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-20 22:57:52,536 INFO ]: Found error trace [2018-06-20 22:57:52,536 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-20 22:57:52,536 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-20 22:57:52,536 INFO ]: Analyzing trace with hash -696013719, now seen corresponding path program 1 times [2018-06-20 22:57:52,536 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-20 22:57:52,536 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-20 22:57:52,537 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-20 22:57:52,537 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-20 22:57:52,537 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-20 22:57:52,925 INFO ]: Conjunction of SSA is unsat [2018-06-20 22:57:53,575 INFO ]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-20 22:57:53,575 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-20 22:57:53,575 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-20 22:57:53,581 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-20 22:57:54,683 INFO ]: Conjunction of SSA is unsat [2018-06-20 22:57:54,726 INFO ]: Computing forward predicates... [2018-06-20 22:57:55,114 WARN ]: Spent 103.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 3 Received shutdown request... [2018-06-20 22:58:41,100 INFO ]: Timeout while computing interpolants [2018-06-20 22:58:41,301 WARN ]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-20 22:58:41,301 WARN ]: Verification canceled [2018-06-20 22:58:41,306 WARN ]: Timeout [2018-06-20 22:58:41,306 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.06 10:58:41 BoogieIcfgContainer [2018-06-20 22:58:41,306 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-20 22:58:41,307 INFO ]: Toolchain (without parser) took 64470.48 ms. Allocated memory was 392.7 MB in the beginning and 2.5 GB in the end (delta: 2.2 GB). Free memory was 334.5 MB in the beginning and 2.3 GB in the end (delta: -2.0 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-06-20 22:58:41,309 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 308.8 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2018-06-20 22:58:41,309 INFO ]: ChcToBoogie took 184.94 ms. Allocated memory is still 392.7 MB. Free memory was 334.5 MB in the beginning and 295.0 MB in the end (delta: 39.5 MB). Peak memory consumption was 39.5 MB. Max. memory is 7.1 GB. [2018-06-20 22:58:41,309 INFO ]: Boogie Preprocessor took 293.20 ms. Allocated memory is still 392.7 MB. Free memory was 295.0 MB in the beginning and 273.7 MB in the end (delta: 21.3 MB). Peak memory consumption was 21.3 MB. Max. memory is 7.1 GB. [2018-06-20 22:58:41,310 INFO ]: RCFGBuilder took 6050.33 ms. Allocated memory was 392.7 MB in the beginning and 822.1 MB in the end (delta: 429.4 MB). Free memory was 273.7 MB in the beginning and 187.1 MB in the end (delta: 86.6 MB). Peak memory consumption was 521.1 MB. Max. memory is 7.1 GB. [2018-06-20 22:58:41,310 INFO ]: TraceAbstraction took 57933.77 ms. Allocated memory was 822.1 MB in the beginning and 2.5 GB in the end (delta: 1.7 GB). Free memory was 187.1 MB in the beginning and 2.3 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2018-06-20 22:58:41,319 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 308.8 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * ChcToBoogie took 184.94 ms. Allocated memory is still 392.7 MB. Free memory was 334.5 MB in the beginning and 295.0 MB in the end (delta: 39.5 MB). Peak memory consumption was 39.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 293.20 ms. Allocated memory is still 392.7 MB. Free memory was 295.0 MB in the beginning and 273.7 MB in the end (delta: 21.3 MB). Peak memory consumption was 21.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 6050.33 ms. Allocated memory was 392.7 MB in the beginning and 822.1 MB in the end (delta: 429.4 MB). Free memory was 273.7 MB in the beginning and 187.1 MB in the end (delta: 86.6 MB). Peak memory consumption was 521.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 57933.77 ms. Allocated memory was 822.1 MB in the beginning and 2.5 GB in the end (delta: 1.7 GB). Free memory was 187.1 MB in the beginning and 2.3 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 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 13 with TraceHistMax 1, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 245 quantified variables from 171 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 55 locations, 1 error locations. TIMEOUT Result, 57.8s OverallTime, 10 OverallIterations, 1 TraceHistogramMax, 7.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1604 SDtfs, 758 SDslu, 498 SDs, 0 SdLazy, 883 SolverSat, 71 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=0, 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, 9 MinimizatonAttempts, 307 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 92 NumberOfCodeBlocks, 92 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 83 ConstructedInterpolants, 0 QuantifiedInterpolants, 907 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 7/7 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/chc-lia-0269.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-20_22-58-41-328.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/chc-lia-0269.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-20_22-58-41-328.csv Completed graceful shutdown