java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_05.i_5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-09-30 20:42:31,855 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 20:42:31,857 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 20:42:31,873 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 20:42:31,873 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 20:42:31,874 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 20:42:31,875 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 20:42:31,877 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 20:42:31,879 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 20:42:31,879 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 20:42:31,880 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 20:42:31,881 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 20:42:31,881 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 20:42:31,882 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 20:42:31,883 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 20:42:31,884 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 20:42:31,885 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 20:42:31,887 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 20:42:31,889 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 20:42:31,890 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 20:42:31,891 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 20:42:31,892 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 20:42:31,895 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 20:42:31,895 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 20:42:31,896 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 20:42:31,897 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 20:42:31,898 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 20:42:31,899 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 20:42:31,899 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 20:42:31,900 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 20:42:31,901 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 20:42:31,901 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 20:42:31,902 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 20:42:31,902 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 20:42:31,903 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 20:42:31,904 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 20:42:31,904 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-09-30 20:42:31,927 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 20:42:31,928 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 20:42:31,928 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 20:42:31,929 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 20:42:31,929 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 20:42:31,929 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 20:42:31,930 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 20:42:31,930 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 20:42:31,930 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 20:42:31,930 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 20:42:31,931 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 20:42:31,931 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 20:42:31,931 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 20:42:31,931 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 20:42:31,931 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 20:42:31,932 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 20:42:31,932 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 20:42:31,932 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 20:42:31,932 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 20:42:31,932 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 20:42:31,933 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 20:42:31,933 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 20:42:31,933 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 20:42:31,933 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 20:42:31,933 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 20:42:31,934 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 20:42:31,934 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 20:42:31,934 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 20:42:31,934 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 20:42:31,934 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 20:42:31,935 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-09-30 20:42:31,976 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 20:42:31,994 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 20:42:32,002 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 20:42:32,003 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 20:42:32,004 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 20:42:32,005 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_05.i_5.bpl [2018-09-30 20:42:32,005 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_05.i_5.bpl' [2018-09-30 20:42:32,063 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 20:42:32,066 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 20:42:32,067 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 20:42:32,067 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 20:42:32,067 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 20:42:32,086 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:42:32" (1/1) ... [2018-09-30 20:42:32,102 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:42:32" (1/1) ... [2018-09-30 20:42:32,109 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 20:42:32,110 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 20:42:32,110 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 20:42:32,111 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 20:42:32,122 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:42:32" (1/1) ... [2018-09-30 20:42:32,123 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:42:32" (1/1) ... [2018-09-30 20:42:32,124 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:42:32" (1/1) ... [2018-09-30 20:42:32,125 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:42:32" (1/1) ... [2018-09-30 20:42:32,130 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:42:32" (1/1) ... [2018-09-30 20:42:32,133 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:42:32" (1/1) ... [2018-09-30 20:42:32,134 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:42:32" (1/1) ... [2018-09-30 20:42:32,137 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 20:42:32,138 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 20:42:32,138 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 20:42:32,138 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 20:42:32,139 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:42:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 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 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 20:42:32,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-30 20:42:32,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-30 20:42:32,445 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-30 20:42:32,445 INFO L202 PluginConnector]: Adding new model eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 08:42:32 BoogieIcfgContainer [2018-09-30 20:42:32,446 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 20:42:32,447 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 20:42:32,447 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 20:42:32,451 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 20:42:32,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:42:32" (1/2) ... [2018-09-30 20:42:32,452 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@278cc5a9 and model type eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 08:42:32, skipping insertion in model container [2018-09-30 20:42:32,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 08:42:32" (2/2) ... [2018-09-30 20:42:32,455 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_05.i_5.bpl [2018-09-30 20:42:32,466 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 20:42:32,475 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-30 20:42:32,539 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 20:42:32,541 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 20:42:32,541 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 20:42:32,541 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 20:42:32,541 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 20:42:32,541 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 20:42:32,542 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 20:42:32,542 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 20:42:32,542 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 20:42:32,571 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2018-09-30 20:42:32,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-30 20:42:32,580 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:42:32,581 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-09-30 20:42:32,591 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:42:32,598 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:42:32,599 INFO L82 PathProgramCache]: Analyzing trace with hash 889539531, now seen corresponding path program 1 times [2018-09-30 20:42:32,601 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:42:32,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:42:32,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:42:32,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:42:32,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:42:32,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:42:32,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:42:32,784 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:42:32,784 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:42:32,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:42:32,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:42:32,800 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:42:32,802 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2018-09-30 20:42:32,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:42:32,888 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. [2018-09-30 20:42:32,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:42:32,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2018-09-30 20:42:32,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:42:32,902 INFO L225 Difference]: With dead ends: 17 [2018-09-30 20:42:32,902 INFO L226 Difference]: Without dead ends: 11 [2018-09-30 20:42:32,905 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:42:32,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-30 20:42:32,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-09-30 20:42:32,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-30 20:42:32,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2018-09-30 20:42:32,938 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 6 [2018-09-30 20:42:32,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:42:32,938 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-09-30 20:42:32,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:42:32,939 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2018-09-30 20:42:32,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:42:32,939 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:42:32,940 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-09-30 20:42:32,940 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:42:32,940 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:42:32,940 INFO L82 PathProgramCache]: Analyzing trace with hash 198621957, now seen corresponding path program 1 times [2018-09-30 20:42:32,940 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:42:32,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:42:32,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:42:32,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:42:32,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:42:32,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:42:32,998 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:42:32,999 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:42:32,999 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:42:33,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:42:33,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:42:33,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:42:33,077 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:42:33,104 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:42:33,104 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-09-30 20:42:33,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 20:42:33,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 20:42:33,105 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:42:33,106 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 4 states. [2018-09-30 20:42:33,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:42:33,224 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2018-09-30 20:42:33,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-30 20:42:33,226 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-09-30 20:42:33,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:42:33,227 INFO L225 Difference]: With dead ends: 19 [2018-09-30 20:42:33,227 INFO L226 Difference]: Without dead ends: 13 [2018-09-30 20:42:33,233 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:42:33,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-09-30 20:42:33,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-09-30 20:42:33,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-09-30 20:42:33,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2018-09-30 20:42:33,238 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 8 [2018-09-30 20:42:33,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:42:33,240 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-09-30 20:42:33,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 20:42:33,240 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2018-09-30 20:42:33,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-30 20:42:33,241 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:42:33,241 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2018-09-30 20:42:33,242 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:42:33,242 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:42:33,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1946764223, now seen corresponding path program 2 times [2018-09-30 20:42:33,242 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:42:33,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:42:33,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:42:33,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:42:33,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:42:33,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:42:33,364 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:42:33,364 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:42:33,364 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-09-30 20:42:33,379 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:42:33,399 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-09-30 20:42:33,399 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:42:33,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:42:33,525 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-09-30 20:42:33,552 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-30 20:42:33,553 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-09-30 20:42:33,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:42:33,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:42:33,554 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:42:33,554 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 7 states. [2018-09-30 20:42:34,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:42:34,098 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2018-09-30 20:42:34,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-30 20:42:34,099 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2018-09-30 20:42:34,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:42:34,100 INFO L225 Difference]: With dead ends: 25 [2018-09-30 20:42:34,100 INFO L226 Difference]: Without dead ends: 19 [2018-09-30 20:42:34,101 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-09-30 20:42:34,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-09-30 20:42:34,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-09-30 20:42:34,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-09-30 20:42:34,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-09-30 20:42:34,108 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 10 [2018-09-30 20:42:34,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:42:34,109 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-09-30 20:42:34,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:42:34,109 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2018-09-30 20:42:34,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 20:42:34,110 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:42:34,110 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:42:34,114 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:42:34,114 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:42:34,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1085907505, now seen corresponding path program 1 times [2018-09-30 20:42:34,114 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:42:34,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:42:34,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:42:34,116 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:42:34,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:42:34,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:42:34,202 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-30 20:42:34,202 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:42:34,203 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-09-30 20:42:34,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:42:34,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:42:34,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:42:34,310 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-30 20:42:34,333 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:42:34,333 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-09-30 20:42:34,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-30 20:42:34,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-30 20:42:34,334 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:42:34,334 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 6 states. [2018-09-30 20:42:34,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:42:34,803 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-09-30 20:42:34,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-30 20:42:34,807 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-09-30 20:42:34,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:42:34,808 INFO L225 Difference]: With dead ends: 27 [2018-09-30 20:42:34,808 INFO L226 Difference]: Without dead ends: 19 [2018-09-30 20:42:34,808 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-09-30 20:42:34,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-09-30 20:42:34,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-09-30 20:42:34,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-09-30 20:42:34,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2018-09-30 20:42:34,819 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 16 [2018-09-30 20:42:34,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:42:34,820 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-09-30 20:42:34,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-30 20:42:34,820 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-09-30 20:42:34,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 20:42:34,821 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:42:34,821 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:42:34,823 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:42:34,823 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:42:34,823 INFO L82 PathProgramCache]: Analyzing trace with hash -366375799, now seen corresponding path program 2 times [2018-09-30 20:42:34,824 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:42:34,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:42:34,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:42:34,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:42:34,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:42:34,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:42:34,959 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-30 20:42:34,960 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:42:34,960 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-09-30 20:42:34,968 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:42:34,981 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:42:34,982 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:42:34,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:42:35,031 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-30 20:42:35,051 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:42:35,052 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-09-30 20:42:35,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:42:35,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:42:35,053 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:42:35,053 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 7 states. [2018-09-30 20:42:35,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:42:35,143 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-09-30 20:42:35,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-30 20:42:35,145 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-09-30 20:42:35,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:42:35,146 INFO L225 Difference]: With dead ends: 29 [2018-09-30 20:42:35,146 INFO L226 Difference]: Without dead ends: 21 [2018-09-30 20:42:35,147 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-09-30 20:42:35,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-09-30 20:42:35,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-09-30 20:42:35,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-09-30 20:42:35,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-09-30 20:42:35,154 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 18 [2018-09-30 20:42:35,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:42:35,154 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-09-30 20:42:35,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:42:35,154 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-09-30 20:42:35,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-30 20:42:35,155 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:42:35,155 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:42:35,156 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:42:35,156 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:42:35,156 INFO L82 PathProgramCache]: Analyzing trace with hash -386140989, now seen corresponding path program 3 times [2018-09-30 20:42:35,156 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:42:35,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:42:35,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:42:35,157 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:42:35,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:42:35,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:42:35,292 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-09-30 20:42:35,293 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:42:35,293 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 20:42:35,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 20:42:35,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 20:42:35,294 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:42:35,294 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 5 states. [2018-09-30 20:42:35,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:42:35,484 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-09-30 20:42:35,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 20:42:35,484 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-09-30 20:42:35,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:42:35,486 INFO L225 Difference]: With dead ends: 31 [2018-09-30 20:42:35,486 INFO L226 Difference]: Without dead ends: 25 [2018-09-30 20:42:35,487 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-09-30 20:42:35,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-09-30 20:42:35,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-09-30 20:42:35,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-09-30 20:42:35,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-09-30 20:42:35,493 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 20 [2018-09-30 20:42:35,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:42:35,493 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-09-30 20:42:35,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 20:42:35,494 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-09-30 20:42:35,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-30 20:42:35,495 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:42:35,495 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:42:35,495 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:42:35,495 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:42:35,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1646565475, now seen corresponding path program 1 times [2018-09-30 20:42:35,496 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:42:35,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:42:35,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:42:35,497 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:42:35,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:42:35,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:42:35,564 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-09-30 20:42:35,565 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:42:35,565 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-09-30 20:42:35,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:42:35,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:42:35,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:42:35,719 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-09-30 20:42:35,748 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:42:35,748 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2018-09-30 20:42:35,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 20:42:35,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 20:42:35,749 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:42:35,749 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 9 states. [2018-09-30 20:42:36,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:42:36,202 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2018-09-30 20:42:36,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-30 20:42:36,203 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-09-30 20:42:36,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:42:36,204 INFO L225 Difference]: With dead ends: 39 [2018-09-30 20:42:36,205 INFO L226 Difference]: Without dead ends: 33 [2018-09-30 20:42:36,205 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-09-30 20:42:36,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-09-30 20:42:36,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-09-30 20:42:36,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-09-30 20:42:36,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-09-30 20:42:36,215 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 22 [2018-09-30 20:42:36,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:42:36,215 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-09-30 20:42:36,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 20:42:36,215 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-09-30 20:42:36,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-09-30 20:42:36,216 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:42:36,217 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 3, 2, 1, 1, 1, 1] [2018-09-30 20:42:36,217 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:42:36,217 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:42:36,217 INFO L82 PathProgramCache]: Analyzing trace with hash 231899811, now seen corresponding path program 2 times [2018-09-30 20:42:36,218 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:42:36,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:42:36,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:42:36,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:42:36,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:42:36,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:42:36,408 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-09-30 20:42:36,409 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:42:36,409 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 20:42:36,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 20:42:36,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 20:42:36,410 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:42:36,410 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 4 states. [2018-09-30 20:42:36,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:42:36,490 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2018-09-30 20:42:36,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-30 20:42:36,490 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-09-30 20:42:36,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:42:36,491 INFO L225 Difference]: With dead ends: 47 [2018-09-30 20:42:36,491 INFO L226 Difference]: Without dead ends: 35 [2018-09-30 20:42:36,492 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-09-30 20:42:36,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-09-30 20:42:36,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-09-30 20:42:36,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-09-30 20:42:36,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2018-09-30 20:42:36,502 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 32 [2018-09-30 20:42:36,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:42:36,502 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2018-09-30 20:42:36,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 20:42:36,502 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-09-30 20:42:36,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-30 20:42:36,503 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:42:36,504 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 4, 3, 3, 3, 1, 1, 1, 1] [2018-09-30 20:42:36,504 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:42:36,504 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:42:36,504 INFO L82 PathProgramCache]: Analyzing trace with hash 2097831421, now seen corresponding path program 3 times [2018-09-30 20:42:36,504 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:42:36,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:42:36,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:42:36,506 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:42:36,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:42:36,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:42:36,646 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-09-30 20:42:36,646 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:42:36,646 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-09-30 20:42:36,659 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:42:36,707 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-09-30 20:42:36,708 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:42:36,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:42:36,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:42:36,770 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:42:36,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-30 20:42:36,869 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-09-30 20:42:37,107 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:42:37,108 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: Cannot provide value for term c_ULTIMATE.start_main_~array~7 of sort (Array Int Int) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.getValue(Scriptor.java:183) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.getValue(WrapperScript.java:146) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.PredicateTrie.compare(PredicateTrie.java:189) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.PredicateTrie.unifyPredicate(PredicateTrie.java:135) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getOrConstructPredicateInternal(BPredicateUnifier.java:243) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getOrConstructPredicate(BPredicateUnifier.java:209) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:236) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:375) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:313) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-09-30 20:42:37,115 INFO L168 Benchmark]: Toolchain (without parser) took 5051.12 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 298.7 MB). Peak memory consumption was 298.7 MB. Max. memory is 7.1 GB. [2018-09-30 20:42:37,117 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:42:37,118 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.91 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:42:37,118 INFO L168 Benchmark]: Boogie Preprocessor took 26.75 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:42:37,119 INFO L168 Benchmark]: RCFGBuilder took 308.32 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-30 20:42:37,121 INFO L168 Benchmark]: TraceAbstraction took 4667.16 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 277.6 MB). Peak memory consumption was 277.6 MB. Max. memory is 7.1 GB. [2018-09-30 20:42:37,127 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 42.91 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.75 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 308.32 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4667.16 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 277.6 MB). Peak memory consumption was 277.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: Cannot provide value for term c_ULTIMATE.start_main_~array~7 of sort (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: Cannot provide value for term c_ULTIMATE.start_main_~array~7 of sort (Array Int Int): de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.getValue(Scriptor.java:183) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/eureka_05.i_5.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_20-42-37-143.csv Received shutdown request...