java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/array-memsafety/reverse_array_alloca_unsafe_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-47db877 [2018-01-23 14:20:45,699 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-23 14:20:45,700 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-23 14:20:45,716 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-23 14:20:45,716 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-23 14:20:45,717 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-23 14:20:45,718 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-23 14:20:45,720 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-23 14:20:45,722 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-23 14:20:45,723 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-23 14:20:45,724 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-23 14:20:45,724 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-23 14:20:45,725 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-23 14:20:45,726 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-23 14:20:45,727 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-23 14:20:45,730 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-23 14:20:45,732 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-23 14:20:45,734 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-23 14:20:45,736 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-23 14:20:45,737 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-23 14:20:45,739 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-23 14:20:45,740 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-23 14:20:45,740 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-23 14:20:45,741 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-23 14:20:45,742 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-23 14:20:45,743 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-23 14:20:45,743 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-23 14:20:45,744 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-23 14:20:45,744 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-23 14:20:45,745 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-23 14:20:45,745 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-23 14:20:45,746 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Camel+AI_EQ.epf [2018-01-23 14:20:45,754 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-23 14:20:45,754 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-23 14:20:45,755 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-23 14:20:45,755 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-23 14:20:45,755 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-23 14:20:45,755 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-23 14:20:45,755 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-23 14:20:45,756 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-23 14:20:45,756 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-23 14:20:45,756 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-23 14:20:45,756 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-23 14:20:45,756 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-23 14:20:45,757 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-23 14:20:45,757 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-23 14:20:45,757 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-23 14:20:45,757 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-23 14:20:45,757 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-23 14:20:45,757 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-23 14:20:45,757 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-23 14:20:45,758 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-23 14:20:45,758 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-23 14:20:45,758 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-23 14:20:45,758 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-23 14:20:45,758 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-23 14:20:45,758 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-23 14:20:45,759 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-23 14:20:45,759 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-23 14:20:45,759 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-23 14:20:45,759 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-23 14:20:45,759 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-23 14:20:45,759 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-23 14:20:45,760 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-23 14:20:45,760 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-23 14:20:45,760 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-23 14:20:45,760 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-23 14:20:45,761 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-23 14:20:45,761 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-23 14:20:45,795 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-23 14:20:45,805 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-23 14:20:45,809 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-23 14:20:45,810 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-23 14:20:45,810 INFO L276 PluginConnector]: CDTParser initialized [2018-01-23 14:20:45,811 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/reverse_array_alloca_unsafe_false-valid-deref.i [2018-01-23 14:20:46,010 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-23 14:20:46,016 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-23 14:20:46,017 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-23 14:20:46,017 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-23 14:20:46,023 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-23 14:20:46,023 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 02:20:46" (1/1) ... [2018-01-23 14:20:46,026 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27ddb07a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:20:46, skipping insertion in model container [2018-01-23 14:20:46,026 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 02:20:46" (1/1) ... [2018-01-23 14:20:46,045 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-23 14:20:46,086 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-23 14:20:46,211 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-23 14:20:46,234 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-23 14:20:46,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:20:46 WrapperNode [2018-01-23 14:20:46,242 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-23 14:20:46,243 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-23 14:20:46,243 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-23 14:20:46,243 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-23 14:20:46,261 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:20:46" (1/1) ... [2018-01-23 14:20:46,261 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:20:46" (1/1) ... [2018-01-23 14:20:46,270 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:20:46" (1/1) ... [2018-01-23 14:20:46,270 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:20:46" (1/1) ... [2018-01-23 14:20:46,273 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:20:46" (1/1) ... [2018-01-23 14:20:46,276 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:20:46" (1/1) ... [2018-01-23 14:20:46,277 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:20:46" (1/1) ... [2018-01-23 14:20:46,279 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-23 14:20:46,279 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-23 14:20:46,280 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-23 14:20:46,280 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-23 14:20:46,280 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:20:46" (1/1) ... No working directory specified, using /storage/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-01-23 14:20:46,343 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-23 14:20:46,343 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-23 14:20:46,343 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-23 14:20:46,343 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-23 14:20:46,344 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-23 14:20:46,344 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-23 14:20:46,344 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-23 14:20:46,344 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-23 14:20:46,344 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-23 14:20:46,344 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-23 14:20:46,344 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-23 14:20:46,345 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-23 14:20:46,576 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-23 14:20:46,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 02:20:46 BoogieIcfgContainer [2018-01-23 14:20:46,577 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-23 14:20:46,578 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-23 14:20:46,578 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-23 14:20:46,579 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-23 14:20:46,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.01 02:20:46" (1/3) ... [2018-01-23 14:20:46,580 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d1f71c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 02:20:46, skipping insertion in model container [2018-01-23 14:20:46,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:20:46" (2/3) ... [2018-01-23 14:20:46,581 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d1f71c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 02:20:46, skipping insertion in model container [2018-01-23 14:20:46,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 02:20:46" (3/3) ... [2018-01-23 14:20:46,583 INFO L105 eAbstractionObserver]: Analyzing ICFG reverse_array_alloca_unsafe_false-valid-deref.i [2018-01-23 14:20:46,589 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-23 14:20:46,596 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-23 14:20:46,647 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:20:46,647 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:20:46,647 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:20:46,647 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:20:46,647 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:20:46,647 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:20:46,648 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:20:46,648 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-23 14:20:46,649 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:20:46,670 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-01-23 14:20:46,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-23 14:20:46,677 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:20:46,678 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-23 14:20:46,678 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-23 14:20:46,683 INFO L82 PathProgramCache]: Analyzing trace with hash 109556, now seen corresponding path program 1 times [2018-01-23 14:20:46,686 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:20:46,687 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:20:46,737 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:20:46,737 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:20:46,738 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:20:46,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:20:46,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:20:46,789 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-23 14:20:46,794 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:20:46,801 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:20:46,801 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:20:46,802 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:20:46,802 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:20:46,802 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:20:46,802 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:20:46,802 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:20:46,802 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-23 14:20:46,802 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:20:46,804 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-01-23 14:20:46,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-23 14:20:46,805 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:20:46,805 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:20:46,805 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:20:46,805 INFO L82 PathProgramCache]: Analyzing trace with hash 964801099, now seen corresponding path program 1 times [2018-01-23 14:20:46,806 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:20:46,806 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:20:46,806 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:20:46,807 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:20:46,807 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:20:46,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:20:46,842 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:20:46,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:20:46,880 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:20:46,880 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:20:46,882 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:20:46,898 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:20:46,899 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:20:46,901 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 2 states. [2018-01-23 14:20:47,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:20:47,009 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2018-01-23 14:20:47,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:20:47,041 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-01-23 14:20:47,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:20:47,053 INFO L225 Difference]: With dead ends: 70 [2018-01-23 14:20:47,053 INFO L226 Difference]: Without dead ends: 42 [2018-01-23 14:20:47,057 INFO L525 BasicCegarLoop]: 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-01-23 14:20:47,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-01-23 14:20:47,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-01-23 14:20:47,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-23 14:20:47,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-01-23 14:20:47,090 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 20 [2018-01-23 14:20:47,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:20:47,091 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-01-23 14:20:47,091 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:20:47,091 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-01-23 14:20:47,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-23 14:20:47,092 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:20:47,092 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:20:47,092 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:20:47,092 INFO L82 PathProgramCache]: Analyzing trace with hash -342950740, now seen corresponding path program 1 times [2018-01-23 14:20:47,092 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:20:47,092 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:20:47,093 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:20:47,093 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:20:47,093 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:20:47,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:20:47,118 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:20:47,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:20:47,263 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:20:47,263 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-23 14:20:47,265 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-23 14:20:47,265 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-23 14:20:47,265 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:20:47,265 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 3 states. [2018-01-23 14:20:47,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:20:47,304 INFO L93 Difference]: Finished difference Result 109 states and 122 transitions. [2018-01-23 14:20:47,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-23 14:20:47,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-01-23 14:20:47,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:20:47,310 INFO L225 Difference]: With dead ends: 109 [2018-01-23 14:20:47,310 INFO L226 Difference]: Without dead ends: 75 [2018-01-23 14:20:47,311 INFO L525 BasicCegarLoop]: 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-01-23 14:20:47,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-23 14:20:47,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 43. [2018-01-23 14:20:47,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-23 14:20:47,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-01-23 14:20:47,319 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 25 [2018-01-23 14:20:47,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:20:47,319 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-01-23 14:20:47,319 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-23 14:20:47,319 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-01-23 14:20:47,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-23 14:20:47,320 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:20:47,321 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:20:47,321 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:20:47,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1957871850, now seen corresponding path program 1 times [2018-01-23 14:20:47,321 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:20:47,321 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:20:47,323 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:20:47,323 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:20:47,323 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:20:47,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:20:47,343 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:20:47,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:20:47,389 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:20:47,390 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-23 14:20:47,390 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-23 14:20:47,390 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-23 14:20:47,390 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-23 14:20:47,391 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 4 states. [2018-01-23 14:20:47,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:20:47,467 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2018-01-23 14:20:47,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-23 14:20:47,468 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-01-23 14:20:47,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:20:47,469 INFO L225 Difference]: With dead ends: 75 [2018-01-23 14:20:47,469 INFO L226 Difference]: Without dead ends: 52 [2018-01-23 14:20:47,470 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-23 14:20:47,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-23 14:20:47,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 45. [2018-01-23 14:20:47,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-23 14:20:47,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2018-01-23 14:20:47,476 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 25 [2018-01-23 14:20:47,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:20:47,477 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2018-01-23 14:20:47,477 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-23 14:20:47,477 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-01-23 14:20:47,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-23 14:20:47,478 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:20:47,478 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:20:47,478 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:20:47,479 INFO L82 PathProgramCache]: Analyzing trace with hash -92922, now seen corresponding path program 1 times [2018-01-23 14:20:47,479 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:20:47,479 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:20:47,480 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:20:47,480 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:20:47,480 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:20:47,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:20:47,511 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:20:47,939 WARN L146 SmtUtils]: Spent 177ms on a formula simplification. DAG size of input: 64 DAG size of output 32 [2018-01-23 14:20:48,139 WARN L146 SmtUtils]: Spent 173ms on a formula simplification. DAG size of input: 71 DAG size of output 39 [2018-01-23 14:20:48,287 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 71 DAG size of output 39 [2018-01-23 14:20:48,480 WARN L146 SmtUtils]: Spent 167ms on a formula simplification. DAG size of input: 62 DAG size of output 36 [2018-01-23 14:20:48,652 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:20:48,653 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:20:48,653 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-23 14:20:48,673 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:20:48,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:20:48,697 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:20:48,796 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-01-23 14:20:48,797 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:20:48,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-01-23 14:20:48,819 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:20:48,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2018-01-23 14:20:48,833 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-23 14:20:48,838 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:20:48,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:20:48,843 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:109, output treesize:26 [2018-01-23 14:20:48,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-01-23 14:20:48,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2018-01-23 14:20:48,924 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:20:48,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:20:48,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:20:48,933 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:4 [2018-01-23 14:20:48,957 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:20:48,983 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:20:48,983 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 17 [2018-01-23 14:20:48,983 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-23 14:20:48,984 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-23 14:20:48,984 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2018-01-23 14:20:48,984 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 17 states. [2018-01-23 14:20:49,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:20:49,674 INFO L93 Difference]: Finished difference Result 102 states and 113 transitions. [2018-01-23 14:20:49,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-23 14:20:49,675 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2018-01-23 14:20:49,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:20:49,676 INFO L225 Difference]: With dead ends: 102 [2018-01-23 14:20:49,676 INFO L226 Difference]: Without dead ends: 81 [2018-01-23 14:20:49,677 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=158, Invalid=598, Unknown=0, NotChecked=0, Total=756 [2018-01-23 14:20:49,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-23 14:20:49,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 56. [2018-01-23 14:20:49,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-23 14:20:49,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2018-01-23 14:20:49,684 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 30 [2018-01-23 14:20:49,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:20:49,684 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2018-01-23 14:20:49,684 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-23 14:20:49,684 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2018-01-23 14:20:49,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-23 14:20:49,685 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:20:49,686 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:20:49,686 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:20:49,686 INFO L82 PathProgramCache]: Analyzing trace with hash 2111018345, now seen corresponding path program 1 times [2018-01-23 14:20:49,686 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:20:49,686 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:20:49,687 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:20:49,688 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:20:49,688 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:20:49,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:20:49,708 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:20:49,879 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-23 14:20:49,879 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:20:49,879 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-23 14:20:49,879 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-23 14:20:49,880 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-23 14:20:49,880 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-01-23 14:20:49,880 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand 11 states. [2018-01-23 14:20:50,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:20:50,129 INFO L93 Difference]: Finished difference Result 128 states and 143 transitions. [2018-01-23 14:20:50,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-23 14:20:50,129 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-01-23 14:20:50,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:20:50,130 INFO L225 Difference]: With dead ends: 128 [2018-01-23 14:20:50,130 INFO L226 Difference]: Without dead ends: 121 [2018-01-23 14:20:50,131 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2018-01-23 14:20:50,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-23 14:20:50,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 89. [2018-01-23 14:20:50,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-23 14:20:50,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 101 transitions. [2018-01-23 14:20:50,139 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 101 transitions. Word has length 32 [2018-01-23 14:20:50,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:20:50,139 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 101 transitions. [2018-01-23 14:20:50,139 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-23 14:20:50,139 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 101 transitions. [2018-01-23 14:20:50,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-23 14:20:50,140 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:20:50,140 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:20:50,141 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:20:50,141 INFO L82 PathProgramCache]: Analyzing trace with hash 2032509349, now seen corresponding path program 1 times [2018-01-23 14:20:50,141 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:20:50,141 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:20:50,141 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:20:50,142 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:20:50,142 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:20:50,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:20:50,152 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:20:50,206 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:20:50,207 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:20:50,207 INFO L209 onRefinementStrategy]: 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-01-23 14:20:50,213 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:20:50,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:20:50,230 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:20:50,250 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:20:50,272 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:20:50,272 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-01-23 14:20:50,273 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-23 14:20:50,273 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-23 14:20:50,273 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2018-01-23 14:20:50,273 INFO L87 Difference]: Start difference. First operand 89 states and 101 transitions. Second operand 8 states. [2018-01-23 14:20:50,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:20:50,367 INFO L93 Difference]: Finished difference Result 185 states and 209 transitions. [2018-01-23 14:20:50,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-23 14:20:50,368 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-01-23 14:20:50,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:20:50,369 INFO L225 Difference]: With dead ends: 185 [2018-01-23 14:20:50,369 INFO L226 Difference]: Without dead ends: 156 [2018-01-23 14:20:50,370 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=48, Unknown=0, NotChecked=0, Total=90 [2018-01-23 14:20:50,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-01-23 14:20:50,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 103. [2018-01-23 14:20:50,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-23 14:20:50,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2018-01-23 14:20:50,384 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 32 [2018-01-23 14:20:50,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:20:50,384 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2018-01-23 14:20:50,385 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-23 14:20:50,385 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2018-01-23 14:20:50,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-23 14:20:50,386 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:20:50,387 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:20:50,387 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:20:50,387 INFO L82 PathProgramCache]: Analyzing trace with hash -2121909337, now seen corresponding path program 1 times [2018-01-23 14:20:50,387 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:20:50,387 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:20:50,388 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:20:50,388 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:20:50,389 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:20:50,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:20:50,406 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:20:50,584 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:20:50,584 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:20:50,584 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:20:50,589 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:20:50,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:20:50,602 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:20:50,665 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-01-23 14:20:50,665 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:20:50,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-01-23 14:20:50,686 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:20:50,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2018-01-23 14:20:50,687 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-23 14:20:50,692 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:20:50,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:20:50,699 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:127, output treesize:32 [2018-01-23 14:20:50,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-01-23 14:20:50,755 INFO L682 Elim1Store]: detected equality via solver [2018-01-23 14:20:50,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-01-23 14:20:50,756 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:20:50,759 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:20:50,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:20:50,763 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:4 [2018-01-23 14:20:50,772 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:20:50,793 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:20:50,793 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 19 [2018-01-23 14:20:50,793 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-23 14:20:50,793 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-23 14:20:50,794 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2018-01-23 14:20:50,794 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand 19 states. [2018-01-23 14:20:51,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:20:51,476 INFO L93 Difference]: Finished difference Result 234 states and 263 transitions. [2018-01-23 14:20:51,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-23 14:20:51,476 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 32 [2018-01-23 14:20:51,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:20:51,477 INFO L225 Difference]: With dead ends: 234 [2018-01-23 14:20:51,477 INFO L226 Difference]: Without dead ends: 227 [2018-01-23 14:20:51,478 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=368, Invalid=1272, Unknown=0, NotChecked=0, Total=1640 [2018-01-23 14:20:51,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-01-23 14:20:51,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 117. [2018-01-23 14:20:51,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-01-23 14:20:51,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 133 transitions. [2018-01-23 14:20:51,494 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 133 transitions. Word has length 32 [2018-01-23 14:20:51,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:20:51,494 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 133 transitions. [2018-01-23 14:20:51,494 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-23 14:20:51,495 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 133 transitions. [2018-01-23 14:20:51,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-23 14:20:51,496 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:20:51,496 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:20:51,496 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:20:51,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1617625150, now seen corresponding path program 1 times [2018-01-23 14:20:51,497 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:20:51,497 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:20:51,498 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:20:51,498 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:20:51,498 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:20:51,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:20:51,513 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:20:52,259 WARN L146 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 72 DAG size of output 40 [2018-01-23 14:20:52,506 WARN L146 SmtUtils]: Spent 193ms on a formula simplification. DAG size of input: 82 DAG size of output 43 [2018-01-23 14:20:52,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:20:52,721 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:20:52,721 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:20:52,726 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:20:52,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:20:52,740 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:20:52,863 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:20:52,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-01-23 14:20:52,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-01-23 14:20:52,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:20:52,871 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:20:52,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:20:52,875 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:11 [2018-01-23 14:20:52,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 29 [2018-01-23 14:20:52,908 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:20:52,909 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:20:52,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 41 [2018-01-23 14:20:52,910 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:20:52,917 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:20:52,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2018-01-23 14:20:52,923 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:20:52,923 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:20:52,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 41 [2018-01-23 14:20:52,925 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:20:52,931 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:20:52,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:20:52,946 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:106, output treesize:25 [2018-01-23 14:20:52,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2018-01-23 14:20:53,000 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:20:53,001 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:20:53,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-01-23 14:20:53,003 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:20:53,005 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:20:53,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:20:53,008 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:3 [2018-01-23 14:20:53,025 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:20:53,045 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:20:53,045 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 26 [2018-01-23 14:20:53,046 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-23 14:20:53,046 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-23 14:20:53,046 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2018-01-23 14:20:53,046 INFO L87 Difference]: Start difference. First operand 117 states and 133 transitions. Second operand 26 states. [2018-01-23 14:20:54,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:20:54,692 INFO L93 Difference]: Finished difference Result 250 states and 281 transitions. [2018-01-23 14:20:54,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-01-23 14:20:54,692 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 34 [2018-01-23 14:20:54,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:20:54,693 INFO L225 Difference]: With dead ends: 250 [2018-01-23 14:20:54,693 INFO L226 Difference]: Without dead ends: 220 [2018-01-23 14:20:54,695 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 951 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=559, Invalid=2863, Unknown=0, NotChecked=0, Total=3422 [2018-01-23 14:20:54,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-01-23 14:20:54,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 109. [2018-01-23 14:20:54,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-01-23 14:20:54,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 122 transitions. [2018-01-23 14:20:54,708 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 122 transitions. Word has length 34 [2018-01-23 14:20:54,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:20:54,708 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 122 transitions. [2018-01-23 14:20:54,709 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-23 14:20:54,709 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 122 transitions. [2018-01-23 14:20:54,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-23 14:20:54,710 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:20:54,710 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:20:54,710 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:20:54,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1234541807, now seen corresponding path program 2 times [2018-01-23 14:20:54,711 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:20:54,711 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:20:54,712 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:20:54,712 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:20:54,712 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:20:54,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:20:54,723 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:20:54,788 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:20:54,788 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:20:54,788 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:20:54,796 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-23 14:20:54,807 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:20:54,810 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:20:54,812 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:20:54,813 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:20:54,878 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:20:54,898 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:20:54,898 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-01-23 14:20:54,898 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-23 14:20:54,899 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-23 14:20:54,899 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-01-23 14:20:54,899 INFO L87 Difference]: Start difference. First operand 109 states and 122 transitions. Second operand 11 states. [2018-01-23 14:20:55,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:20:55,003 INFO L93 Difference]: Finished difference Result 201 states and 226 transitions. [2018-01-23 14:20:55,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-23 14:20:55,004 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2018-01-23 14:20:55,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:20:55,005 INFO L225 Difference]: With dead ends: 201 [2018-01-23 14:20:55,005 INFO L226 Difference]: Without dead ends: 172 [2018-01-23 14:20:55,006 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2018-01-23 14:20:55,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-01-23 14:20:55,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 121. [2018-01-23 14:20:55,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-01-23 14:20:55,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 135 transitions. [2018-01-23 14:20:55,019 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 135 transitions. Word has length 37 [2018-01-23 14:20:55,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:20:55,019 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 135 transitions. [2018-01-23 14:20:55,019 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-23 14:20:55,020 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 135 transitions. [2018-01-23 14:20:55,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-23 14:20:55,021 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:20:55,021 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:20:55,021 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:20:55,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1211909553, now seen corresponding path program 2 times [2018-01-23 14:20:55,021 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:20:55,021 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:20:55,022 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:20:55,022 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:20:55,022 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:20:55,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:20:55,033 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:20:55,205 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:20:55,206 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:20:55,206 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:20:55,214 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-23 14:20:55,224 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:20:55,229 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:20:55,231 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:20:55,234 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:20:55,331 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:20:55,352 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:20:55,352 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-01-23 14:20:55,352 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-23 14:20:55,353 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-23 14:20:55,353 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2018-01-23 14:20:55,353 INFO L87 Difference]: Start difference. First operand 121 states and 135 transitions. Second operand 13 states. [2018-01-23 14:20:55,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:20:55,450 INFO L93 Difference]: Finished difference Result 232 states and 258 transitions. [2018-01-23 14:20:55,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-23 14:20:55,450 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2018-01-23 14:20:55,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:20:55,451 INFO L225 Difference]: With dead ends: 232 [2018-01-23 14:20:55,451 INFO L226 Difference]: Without dead ends: 194 [2018-01-23 14:20:55,452 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2018-01-23 14:20:55,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-01-23 14:20:55,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 126. [2018-01-23 14:20:55,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-01-23 14:20:55,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 142 transitions. [2018-01-23 14:20:55,461 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 142 transitions. Word has length 37 [2018-01-23 14:20:55,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:20:55,461 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 142 transitions. [2018-01-23 14:20:55,461 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-23 14:20:55,461 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 142 transitions. [2018-01-23 14:20:55,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-23 14:20:55,462 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:20:55,462 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:20:55,462 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:20:55,462 INFO L82 PathProgramCache]: Analyzing trace with hash 859940133, now seen corresponding path program 3 times [2018-01-23 14:20:55,462 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:20:55,462 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:20:55,463 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:20:55,463 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:20:55,463 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:20:55,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:20:55,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:20:55,495 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-23 14:20:55,502 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:20:55,508 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:20:55,509 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:20:55,525 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:20:55,525 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:20:55,525 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:20:55,525 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:20:55,526 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:20:55,526 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:20:55,526 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:20:55,526 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-23 14:20:55,526 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:20:55,527 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-01-23 14:20:55,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-23 14:20:55,528 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:20:55,528 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:20:55,528 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-23 14:20:55,528 INFO L82 PathProgramCache]: Analyzing trace with hash -168828260, now seen corresponding path program 1 times [2018-01-23 14:20:55,528 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:20:55,529 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:20:55,529 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:20:55,529 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:20:55,529 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:20:55,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:20:55,533 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:20:55,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:20:55,538 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:20:55,538 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:20:55,538 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:20:55,539 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:20:55,539 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:20:55,539 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 2 states. [2018-01-23 14:20:55,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:20:55,540 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2018-01-23 14:20:55,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:20:55,540 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-01-23 14:20:55,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:20:55,541 INFO L225 Difference]: With dead ends: 70 [2018-01-23 14:20:55,541 INFO L226 Difference]: Without dead ends: 40 [2018-01-23 14:20:55,541 INFO L525 BasicCegarLoop]: 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-01-23 14:20:55,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-23 14:20:55,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-01-23 14:20:55,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-23 14:20:55,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2018-01-23 14:20:55,543 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 18 [2018-01-23 14:20:55,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:20:55,544 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2018-01-23 14:20:55,544 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:20:55,544 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2018-01-23 14:20:55,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-23 14:20:55,544 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:20:55,544 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:20:55,544 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-23 14:20:55,545 INFO L82 PathProgramCache]: Analyzing trace with hash -371306179, now seen corresponding path program 1 times [2018-01-23 14:20:55,545 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:20:55,545 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:20:55,546 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:20:55,546 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:20:55,546 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:20:55,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:20:55,551 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:20:55,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:20:55,597 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:20:55,597 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-23 14:20:55,597 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-23 14:20:55,597 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-23 14:20:55,597 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:20:55,597 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 3 states. [2018-01-23 14:20:55,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:20:55,626 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2018-01-23 14:20:55,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-23 14:20:55,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-01-23 14:20:55,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:20:55,627 INFO L225 Difference]: With dead ends: 105 [2018-01-23 14:20:55,627 INFO L226 Difference]: Without dead ends: 73 [2018-01-23 14:20:55,628 INFO L525 BasicCegarLoop]: 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-01-23 14:20:55,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-23 14:20:55,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 41. [2018-01-23 14:20:55,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-23 14:20:55,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-01-23 14:20:55,629 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 23 [2018-01-23 14:20:55,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:20:55,630 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-01-23 14:20:55,630 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-23 14:20:55,630 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-01-23 14:20:55,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-23 14:20:55,630 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:20:55,630 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:20:55,630 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-23 14:20:55,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1392374533, now seen corresponding path program 1 times [2018-01-23 14:20:55,631 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:20:55,631 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:20:55,632 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:20:55,632 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:20:55,632 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:20:55,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:20:55,637 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:20:55,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:20:55,689 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:20:55,689 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-23 14:20:55,690 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-23 14:20:55,690 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-23 14:20:55,690 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-23 14:20:55,690 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 4 states. [2018-01-23 14:20:55,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:20:55,712 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2018-01-23 14:20:55,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-23 14:20:55,712 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-01-23 14:20:55,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:20:55,713 INFO L225 Difference]: With dead ends: 71 [2018-01-23 14:20:55,713 INFO L226 Difference]: Without dead ends: 50 [2018-01-23 14:20:55,713 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-23 14:20:55,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-23 14:20:55,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2018-01-23 14:20:55,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-23 14:20:55,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-01-23 14:20:55,716 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 23 [2018-01-23 14:20:55,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:20:55,716 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-01-23 14:20:55,716 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-23 14:20:55,716 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-01-23 14:20:55,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-23 14:20:55,717 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:20:55,717 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:20:55,717 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-23 14:20:55,717 INFO L82 PathProgramCache]: Analyzing trace with hash -634636265, now seen corresponding path program 1 times [2018-01-23 14:20:55,717 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:20:55,718 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:20:55,718 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:20:55,718 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:20:55,719 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:20:55,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:20:55,726 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:20:55,778 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-23 14:20:55,778 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:20:55,778 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-23 14:20:55,779 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-23 14:20:55,779 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-23 14:20:55,779 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-23 14:20:55,779 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 4 states. [2018-01-23 14:20:55,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:20:55,804 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-01-23 14:20:55,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-23 14:20:55,805 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-01-23 14:20:55,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:20:55,805 INFO L225 Difference]: With dead ends: 43 [2018-01-23 14:20:55,805 INFO L226 Difference]: Without dead ends: 0 [2018-01-23 14:20:55,806 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:20:55,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-23 14:20:55,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-23 14:20:55,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-23 14:20:55,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-23 14:20:55,807 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2018-01-23 14:20:55,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:20:55,807 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-23 14:20:55,807 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-23 14:20:55,807 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-23 14:20:55,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-23 14:20:55,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.01 02:20:55 BoogieIcfgContainer [2018-01-23 14:20:55,812 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-23 14:20:55,813 INFO L168 Benchmark]: Toolchain (without parser) took 9801.48 ms. Allocated memory was 303.0 MB in the beginning and 574.6 MB in the end (delta: 271.6 MB). Free memory was 261.0 MB in the beginning and 521.9 MB in the end (delta: -260.9 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. [2018-01-23 14:20:55,815 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 303.0 MB. Free memory is still 266.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-23 14:20:55,815 INFO L168 Benchmark]: CACSL2BoogieTranslator took 225.61 ms. Allocated memory is still 303.0 MB. Free memory was 260.0 MB in the beginning and 250.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-23 14:20:55,816 INFO L168 Benchmark]: Boogie Preprocessor took 36.30 ms. Allocated memory is still 303.0 MB. Free memory was 250.0 MB in the beginning and 248.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-23 14:20:55,816 INFO L168 Benchmark]: RCFGBuilder took 297.81 ms. Allocated memory is still 303.0 MB. Free memory was 248.0 MB in the beginning and 231.0 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. [2018-01-23 14:20:55,816 INFO L168 Benchmark]: TraceAbstraction took 9233.92 ms. Allocated memory was 303.0 MB in the beginning and 574.6 MB in the end (delta: 271.6 MB). Free memory was 231.0 MB in the beginning and 521.9 MB in the end (delta: -290.9 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-23 14:20:55,818 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 303.0 MB. Free memory is still 266.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 225.61 ms. Allocated memory is still 303.0 MB. Free memory was 260.0 MB in the beginning and 250.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 36.30 ms. Allocated memory is still 303.0 MB. Free memory was 250.0 MB in the beginning and 248.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 297.81 ms. Allocated memory is still 303.0 MB. Free memory was 248.0 MB in the beginning and 231.0 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 9233.92 ms. Allocated memory was 303.0 MB in the beginning and 574.6 MB in the end (delta: 271.6 MB). Free memory was 231.0 MB in the beginning and 521.9 MB in the end (delta: -290.9 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 3 procedures, 45 locations, 3 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred 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, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L541] int i, j, tmp; [L542] int length = __VERIFIER_nondet_int(); [L543] COND FALSE !(length < 1) VAL [length=2] [L544] COND TRUE length % 2 == 0 [L544] length++ VAL [length=3] [L545] EXPR, FCALL __builtin_alloca (length*sizeof(int)) VAL [__builtin_alloca (length*sizeof(int))={13:0}, length=3] [L545] int *arr = __builtin_alloca (length*sizeof(int)); [L546] i=0 VAL [__builtin_alloca (length*sizeof(int))={13:0}, arr={13:0}, i=0, length=3] [L546] COND TRUE i