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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/array-memsafety/mult_array-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-acfac67 [2018-01-28 23:26:51,545 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-28 23:26:51,547 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-28 23:26:51,562 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-28 23:26:51,563 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-28 23:26:51,564 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-28 23:26:51,565 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-28 23:26:51,566 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-28 23:26:51,567 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-28 23:26:51,568 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-28 23:26:51,568 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-28 23:26:51,569 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-28 23:26:51,569 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-28 23:26:51,571 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-28 23:26:51,572 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-28 23:26:51,574 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-28 23:26:51,576 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-28 23:26:51,578 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-28 23:26:51,580 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-28 23:26:51,581 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-28 23:26:51,584 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-28 23:26:51,584 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-28 23:26:51,584 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-28 23:26:51,585 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-28 23:26:51,586 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-28 23:26:51,587 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-28 23:26:51,588 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-28 23:26:51,588 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-28 23:26:51,589 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-28 23:26:51,589 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-28 23:26:51,589 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-28 23:26:51,590 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-28 23:26:51,600 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-28 23:26:51,600 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-28 23:26:51,601 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-28 23:26:51,601 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-28 23:26:51,601 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-28 23:26:51,602 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-28 23:26:51,602 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-28 23:26:51,602 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-28 23:26:51,603 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-28 23:26:51,603 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-28 23:26:51,603 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-28 23:26:51,603 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-28 23:26:51,603 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-28 23:26:51,604 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-28 23:26:51,604 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-28 23:26:51,604 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-28 23:26:51,604 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-28 23:26:51,604 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-28 23:26:51,605 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-28 23:26:51,605 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-28 23:26:51,605 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-28 23:26:51,605 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-28 23:26:51,605 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-28 23:26:51,606 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-28 23:26:51,606 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-28 23:26:51,606 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-28 23:26:51,606 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-28 23:26:51,607 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-28 23:26:51,607 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-28 23:26:51,607 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-28 23:26:51,607 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-28 23:26:51,607 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-28 23:26:51,608 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-28 23:26:51,608 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-28 23:26:51,645 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-28 23:26:51,657 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-28 23:26:51,661 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-28 23:26:51,663 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-28 23:26:51,663 INFO L276 PluginConnector]: CDTParser initialized [2018-01-28 23:26:51,664 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/mult_array-alloca_true-valid-memsafety_true-termination.i [2018-01-28 23:26:51,820 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-28 23:26:51,826 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-01-28 23:26:51,827 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-28 23:26:51,827 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-28 23:26:51,832 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-28 23:26:51,833 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 11:26:51" (1/1) ... [2018-01-28 23:26:51,835 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67a116ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:26:51, skipping insertion in model container [2018-01-28 23:26:51,836 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 11:26:51" (1/1) ... [2018-01-28 23:26:51,849 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 23:26:51,888 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 23:26:52,004 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 23:26:52,022 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 23:26:52,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:26:52 WrapperNode [2018-01-28 23:26:52,030 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-28 23:26:52,031 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-28 23:26:52,031 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-28 23:26:52,031 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-28 23:26:52,048 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:26:52" (1/1) ... [2018-01-28 23:26:52,048 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:26:52" (1/1) ... [2018-01-28 23:26:52,057 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:26:52" (1/1) ... [2018-01-28 23:26:52,057 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:26:52" (1/1) ... [2018-01-28 23:26:52,061 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:26:52" (1/1) ... [2018-01-28 23:26:52,064 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:26:52" (1/1) ... [2018-01-28 23:26:52,066 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:26:52" (1/1) ... [2018-01-28 23:26:52,068 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-28 23:26:52,068 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-28 23:26:52,069 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-28 23:26:52,069 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-28 23:26:52,070 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:26:52" (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-28 23:26:52,121 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-28 23:26:52,121 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-28 23:26:52,121 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-28 23:26:52,122 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-28 23:26:52,122 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-28 23:26:52,122 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-28 23:26:52,122 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-28 23:26:52,122 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-28 23:26:52,122 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-28 23:26:52,122 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-28 23:26:52,122 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-28 23:26:52,122 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-28 23:26:52,358 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-28 23:26:52,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 11:26:52 BoogieIcfgContainer [2018-01-28 23:26:52,359 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-28 23:26:52,360 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-01-28 23:26:52,360 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-01-28 23:26:52,361 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-01-28 23:26:52,363 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 11:26:52" (1/1) ... [2018-01-28 23:26:52,370 INFO L103 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-01-28 23:26:52,370 INFO L104 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-01-28 23:26:52,371 INFO L150 apSepIcfgTransformer]: starting freeze-var-style preprocessing [2018-01-28 23:26:52,430 INFO L218 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-01-28 23:26:52,485 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-28 23:27:56,570 INFO L311 AbstractInterpreter]: Visited 65 different actions 430 times. Merged at 41 different actions 275 times. Widened at 3 different actions 7 times. Found 18 fixpoints after 9 different actions. Largest state had 44 variables. [2018-01-28 23:27:56,572 INFO L226 apSepIcfgTransformer]: finished equality analysis [2018-01-28 23:27:56,581 INFO L244 HeapSepPreAnalysis]: Number of read from array group [#memory_int] : 3 [2018-01-28 23:27:56,582 INFO L238 apSepIcfgTransformer]: Finished pre analysis before partitioning [2018-01-28 23:27:56,582 INFO L239 apSepIcfgTransformer]: array groups: Set: [#memory_int] [2018-01-28 23:27:56,582 INFO L241 apSepIcfgTransformer]: select infos: Set: ((select |v_#memory_int_7| v_main_~arr2~2.base_4), at (SUMMARY for call write~int(#t~mem9, ~arr2~2.base, ~arr2~2.offset + ~j~2 * 4, 4); srcloc: L553')) ((select (select |v_#memory_int_5| v_main_~arr~2.base_7) (+ v_main_~arr~2.offset_6 (* 4 (let ((.cse0 (mod v_main_~i~2_9 v_main_~length~2_13))) (ite (and (< v_main_~i~2_9 0) (not (= 0 .cse0))) (ite (< v_main_~length~2_13 0) (+ .cse0 v_main_~length~2_13) (+ .cse0 (* (- 1) v_main_~length~2_13))) .cse0))))), at (SUMMARY for call #t~mem9 := read~int(~arr~2.base, ~arr~2.offset + (if ~i~2 < 0 && ~i~2 % ~length~2 != 0 then (if ~length~2 < 0 then ~i~2 % ~length~2 + ~length~2 else ~i~2 % ~length~2 - ~length~2) else ~i~2 % ~length~2) * 4, 4); srcloc: L553)) ((select |v_#memory_int_4| v_main_~arr~2.base_4), at (SUMMARY for call write~int(#t~nondet5, ~arr~2.base, ~arr~2.offset + ~i~2 * 4, 4); srcloc: L550')) [2018-01-28 23:27:56,603 INFO L544 PartitionManager]: partitioning result: [2018-01-28 23:27:56,604 INFO L549 PartitionManager]: location blocks for array group [#memory_int] [2018-01-28 23:27:56,604 INFO L558 PartitionManager]: at dimension 0 [2018-01-28 23:27:56,604 INFO L559 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-01-28 23:27:56,604 INFO L560 PartitionManager]: # location blocks :1 [2018-01-28 23:27:56,604 INFO L558 PartitionManager]: at dimension 1 [2018-01-28 23:27:56,604 INFO L559 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-01-28 23:27:56,604 INFO L560 PartitionManager]: # location blocks :1 [2018-01-28 23:27:56,605 INFO L86 ransitionTransformer]: executing heap partitioning transformation [2018-01-28 23:27:56,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 28.01 11:27:56 BasicIcfg [2018-01-28 23:27:56,702 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-01-28 23:27:56,703 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-28 23:27:56,703 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-28 23:27:56,706 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-28 23:27:56,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 11:26:51" (1/4) ... [2018-01-28 23:27:56,708 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44a5e6ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 11:27:56, skipping insertion in model container [2018-01-28 23:27:56,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:26:52" (2/4) ... [2018-01-28 23:27:56,708 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44a5e6ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 11:27:56, skipping insertion in model container [2018-01-28 23:27:56,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 11:26:52" (3/4) ... [2018-01-28 23:27:56,709 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44a5e6ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 11:27:56, skipping insertion in model container [2018-01-28 23:27:56,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 28.01 11:27:56" (4/4) ... [2018-01-28 23:27:56,710 INFO L107 eAbstractionObserver]: Analyzing ICFG HeapSeparatedIcfg [2018-01-28 23:27:56,719 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-28 23:27:56,725 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-01-28 23:27:56,755 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-28 23:27:56,755 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-28 23:27:56,755 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-28 23:27:56,755 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-28 23:27:56,755 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-28 23:27:56,755 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-28 23:27:56,756 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-28 23:27:56,756 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-28 23:27:56,756 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-28 23:27:56,766 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-28 23:27:56,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-28 23:27:56,771 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:27:56,772 INFO L330 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] [2018-01-28 23:27:56,772 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr6EnsuresViolation, mainErr4RequiresViolation, mainErr0RequiresViolation]=== [2018-01-28 23:27:56,775 INFO L82 PathProgramCache]: Analyzing trace with hash 761109587, now seen corresponding path program 1 times [2018-01-28 23:27:56,776 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:27:56,777 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:27:56,814 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:27:56,814 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:27:56,814 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:27:56,848 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-28 23:27:56,848 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-28 23:27:56,848 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-28 23:27:56,858 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:27:56,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:27:56,894 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 23:27:56,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-28 23:27:56,968 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 23:27:56,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-28 23:27:56,992 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 23:27:57,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 23:27:57,014 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-01-28 23:27:57,071 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 23:27:57,075 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-01-28 23:27:57,076 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 23:27:57,116 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 23:27:57,118 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 23:27:57,118 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 11 treesize of output 4 [2018-01-28 23:27:57,119 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 23:27:57,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-28 23:27:57,139 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:34, output treesize:27 [2018-01-28 23:27:57,239 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-28 23:27:57,279 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:27:57,279 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 23:27:57,281 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 23:27:57,292 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 23:27:57,292 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-01-28 23:27:57,295 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 7 states. [2018-01-28 23:27:57,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:27:57,676 INFO L93 Difference]: Finished difference Result 92 states and 105 transitions. [2018-01-28 23:27:57,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 23:27:57,678 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-01-28 23:27:57,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:27:57,690 INFO L225 Difference]: With dead ends: 92 [2018-01-28 23:27:57,690 INFO L226 Difference]: Without dead ends: 64 [2018-01-28 23:27:57,694 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-01-28 23:27:57,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-28 23:27:57,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2018-01-28 23:27:57,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-28 23:27:57,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2018-01-28 23:27:57,739 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 22 [2018-01-28 23:27:57,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:27:57,740 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2018-01-28 23:27:57,740 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-28 23:27:57,740 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2018-01-28 23:27:57,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-28 23:27:57,741 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:27:57,741 INFO L330 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-28 23:27:57,741 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr6EnsuresViolation, mainErr4RequiresViolation, mainErr0RequiresViolation]=== [2018-01-28 23:27:57,742 INFO L82 PathProgramCache]: Analyzing trace with hash 285327118, now seen corresponding path program 1 times [2018-01-28 23:27:57,742 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:27:57,742 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:27:57,743 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:27:57,743 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:27:57,743 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:27:57,749 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-28 23:27:57,750 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-28 23:27:57,750 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-28 23:27:57,762 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:27:57,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:27:57,784 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 23:27:57,840 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-28 23:27:57,874 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:27:57,874 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 23:27:57,876 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 23:27:57,877 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 23:27:57,877 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-28 23:27:57,877 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand 6 states. [2018-01-28 23:27:57,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:27:57,999 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2018-01-28 23:27:57,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 23:27:58,000 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-01-28 23:27:58,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:27:58,001 INFO L225 Difference]: With dead ends: 63 [2018-01-28 23:27:58,001 INFO L226 Difference]: Without dead ends: 56 [2018-01-28 23:27:58,003 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-01-28 23:27:58,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-01-28 23:27:58,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-01-28 23:27:58,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-28 23:27:58,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-01-28 23:27:58,011 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 23 [2018-01-28 23:27:58,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:27:58,011 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-01-28 23:27:58,011 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 23:27:58,011 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-01-28 23:27:58,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-28 23:27:58,012 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:27:58,012 INFO L330 BasicCegarLoop]: trace histogram [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] [2018-01-28 23:27:58,013 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr6EnsuresViolation, mainErr4RequiresViolation, mainErr0RequiresViolation]=== [2018-01-28 23:27:58,013 INFO L82 PathProgramCache]: Analyzing trace with hash 506729011, now seen corresponding path program 1 times [2018-01-28 23:27:58,013 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:27:58,013 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:27:58,014 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:27:58,014 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:27:58,014 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:27:58,020 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-28 23:27:58,020 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-28 23:27:58,021 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-28 23:27:58,035 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:27:58,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:27:58,054 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 23:27:58,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-28 23:27:58,068 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 23:27:58,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-28 23:27:58,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 23:27:58,087 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 23:27:58,087 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:16 [2018-01-28 23:27:58,118 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 23:27:58,119 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 23:27:58,120 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 11 treesize of output 4 [2018-01-28 23:27:58,120 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 23:27:58,138 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-01-28 23:27:58,139 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 23:27:58,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-28 23:27:58,151 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:24 [2018-01-28 23:27:58,334 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 23:27:58,369 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-01-28 23:27:58,370 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-01-28 23:27:58,370 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 23:27:58,370 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 23:27:58,370 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-28 23:27:58,371 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 9 states. [2018-01-28 23:27:58,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:27:58,885 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-01-28 23:27:58,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-28 23:27:58,885 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-01-28 23:27:58,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:27:58,887 INFO L225 Difference]: With dead ends: 59 [2018-01-28 23:27:58,887 INFO L226 Difference]: Without dead ends: 58 [2018-01-28 23:27:58,887 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2018-01-28 23:27:58,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-28 23:27:58,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 53. [2018-01-28 23:27:58,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-28 23:27:58,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2018-01-28 23:27:58,895 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 30 [2018-01-28 23:27:58,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:27:58,895 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2018-01-28 23:27:58,895 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 23:27:58,895 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2018-01-28 23:27:58,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-28 23:27:58,896 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:27:58,896 INFO L330 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-28 23:27:58,897 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr6EnsuresViolation, mainErr4RequiresViolation, mainErr0RequiresViolation]=== [2018-01-28 23:27:58,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1633311257, now seen corresponding path program 1 times [2018-01-28 23:27:58,897 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:27:58,897 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:27:58,898 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:27:58,898 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:27:58,898 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:27:58,904 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-28 23:27:58,905 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-28 23:27:58,905 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-28 23:27:58,922 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:27:58,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:27:58,938 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 23:27:59,057 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-28 23:27:59,082 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-01-28 23:27:59,082 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-01-28 23:27:59,082 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-28 23:27:59,082 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-28 23:27:59,082 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-01-28 23:27:59,082 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 10 states. [2018-01-28 23:27:59,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:27:59,342 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2018-01-28 23:27:59,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-28 23:27:59,342 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-01-28 23:27:59,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:27:59,344 INFO L225 Difference]: With dead ends: 85 [2018-01-28 23:27:59,344 INFO L226 Difference]: Without dead ends: 84 [2018-01-28 23:27:59,344 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2018-01-28 23:27:59,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-28 23:27:59,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 70. [2018-01-28 23:27:59,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-28 23:27:59,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2018-01-28 23:27:59,356 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 32 [2018-01-28 23:27:59,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:27:59,356 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2018-01-28 23:27:59,356 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-28 23:27:59,356 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2018-01-28 23:27:59,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-28 23:27:59,357 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:27:59,358 INFO L330 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] [2018-01-28 23:27:59,358 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr6EnsuresViolation, mainErr4RequiresViolation, mainErr0RequiresViolation]=== [2018-01-28 23:27:59,358 INFO L82 PathProgramCache]: Analyzing trace with hash -906958314, now seen corresponding path program 1 times [2018-01-28 23:27:59,358 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:27:59,358 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:27:59,359 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:27:59,359 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:27:59,359 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:27:59,364 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-28 23:27:59,365 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-28 23:27:59,365 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-28 23:27:59,375 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:27:59,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:27:59,392 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 23:27:59,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-28 23:27:59,397 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 23:27:59,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 23:27:59,399 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-28 23:27:59,408 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-28 23:27:59,435 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:27:59,435 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 23:27:59,435 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 23:27:59,435 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 23:27:59,435 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 23:27:59,435 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand 4 states. [2018-01-28 23:27:59,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:27:59,465 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2018-01-28 23:27:59,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 23:27:59,465 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-01-28 23:27:59,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:27:59,466 INFO L225 Difference]: With dead ends: 70 [2018-01-28 23:27:59,466 INFO L226 Difference]: Without dead ends: 69 [2018-01-28 23:27:59,466 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 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-28 23:27:59,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-28 23:27:59,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-01-28 23:27:59,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-01-28 23:27:59,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2018-01-28 23:27:59,472 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 33 [2018-01-28 23:27:59,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:27:59,473 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2018-01-28 23:27:59,473 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 23:27:59,473 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2018-01-28 23:27:59,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-28 23:27:59,474 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:27:59,474 INFO L330 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] [2018-01-28 23:27:59,474 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr6EnsuresViolation, mainErr4RequiresViolation, mainErr0RequiresViolation]=== [2018-01-28 23:27:59,474 INFO L82 PathProgramCache]: Analyzing trace with hash -906958312, now seen corresponding path program 1 times [2018-01-28 23:27:59,474 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:27:59,474 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:27:59,475 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:27:59,475 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:27:59,475 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:27:59,478 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-28 23:27:59,479 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-28 23:27:59,479 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-28 23:27:59,485 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:27:59,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:27:59,498 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 23:27:59,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-28 23:27:59,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 23:27:59,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 23:27:59,513 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:13 [2018-01-28 23:27:59,550 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-28 23:27:59,572 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:27:59,572 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 23:27:59,573 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 23:27:59,573 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 23:27:59,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-28 23:27:59,573 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand 6 states. [2018-01-28 23:27:59,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:27:59,709 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2018-01-28 23:27:59,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 23:27:59,709 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-01-28 23:27:59,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:27:59,710 INFO L225 Difference]: With dead ends: 86 [2018-01-28 23:27:59,710 INFO L226 Difference]: Without dead ends: 85 [2018-01-28 23:27:59,711 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-01-28 23:27:59,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-28 23:27:59,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 77. [2018-01-28 23:27:59,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-28 23:27:59,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2018-01-28 23:27:59,720 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 33 [2018-01-28 23:27:59,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:27:59,720 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2018-01-28 23:27:59,721 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 23:27:59,721 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2018-01-28 23:27:59,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-28 23:27:59,722 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:27:59,722 INFO L330 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, 1, 1, 1] [2018-01-28 23:27:59,722 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr6EnsuresViolation, mainErr4RequiresViolation, mainErr0RequiresViolation]=== [2018-01-28 23:27:59,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1114265028, now seen corresponding path program 1 times [2018-01-28 23:27:59,723 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:27:59,723 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:27:59,724 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:27:59,724 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:27:59,724 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:27:59,729 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-28 23:27:59,729 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-28 23:27:59,729 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-28 23:27:59,735 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:27:59,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:27:59,749 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 23:27:59,798 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-28 23:27:59,823 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:27:59,823 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 23:27:59,823 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 23:27:59,823 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 23:27:59,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=27, Unknown=3, NotChecked=0, Total=42 [2018-01-28 23:27:59,823 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand 7 states. [2018-01-28 23:27:59,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:27:59,942 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2018-01-28 23:27:59,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 23:27:59,942 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2018-01-28 23:27:59,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:27:59,943 INFO L225 Difference]: With dead ends: 77 [2018-01-28 23:27:59,943 INFO L226 Difference]: Without dead ends: 70 [2018-01-28 23:27:59,944 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=27, Unknown=3, NotChecked=0, Total=42 [2018-01-28 23:27:59,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-28 23:27:59,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-01-28 23:27:59,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-28 23:27:59,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2018-01-28 23:27:59,958 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 37 [2018-01-28 23:27:59,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:27:59,958 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2018-01-28 23:27:59,958 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-28 23:27:59,958 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2018-01-28 23:27:59,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-28 23:27:59,959 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:27:59,960 INFO L330 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 23:27:59,960 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr6EnsuresViolation, mainErr4RequiresViolation, mainErr0RequiresViolation]=== [2018-01-28 23:27:59,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1937836039, now seen corresponding path program 2 times [2018-01-28 23:27:59,960 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:27:59,960 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:27:59,961 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:27:59,961 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:27:59,961 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:27:59,966 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-28 23:27:59,966 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-28 23:27:59,966 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-28 23:27:59,976 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 23:27:59,987 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 23:27:59,990 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 23:27:59,993 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 23:28:00,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-28 23:28:00,011 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 23:28:00,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-28 23:28:00,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 23:28:00,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 23:28:00,029 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-01-28 23:28:00,061 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 23:28:00,064 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-01-28 23:28:00,064 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 23:28:00,079 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 23:28:00,079 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 23:28:00,080 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 11 treesize of output 4 [2018-01-28 23:28:00,080 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 23:28:00,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-28 23:28:00,088 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:27 [2018-01-28 23:28:00,158 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-28 23:28:00,179 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:28:00,179 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 23:28:00,180 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 23:28:00,180 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 23:28:00,180 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-01-28 23:28:00,180 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand 7 states. [2018-01-28 23:28:00,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:28:00,398 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2018-01-28 23:28:00,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 23:28:00,399 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2018-01-28 23:28:00,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:28:00,399 INFO L225 Difference]: With dead ends: 70 [2018-01-28 23:28:00,399 INFO L226 Difference]: Without dead ends: 69 [2018-01-28 23:28:00,400 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2018-01-28 23:28:00,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-28 23:28:00,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 48. [2018-01-28 23:28:00,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-28 23:28:00,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-01-28 23:28:00,406 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 40 [2018-01-28 23:28:00,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:28:00,406 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-01-28 23:28:00,406 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-28 23:28:00,406 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-01-28 23:28:00,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-28 23:28:00,406 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:28:00,407 INFO L330 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 23:28:00,407 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr6EnsuresViolation, mainErr4RequiresViolation, mainErr0RequiresViolation]=== [2018-01-28 23:28:00,407 INFO L82 PathProgramCache]: Analyzing trace with hash -531607560, now seen corresponding path program 1 times [2018-01-28 23:28:00,407 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:28:00,407 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:28:00,407 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:28:00,408 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 23:28:00,408 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:28:00,412 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-28 23:28:00,412 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-28 23:28:00,412 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-28 23:28:00,418 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:28:00,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:28:00,434 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 23:28:00,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-28 23:28:00,438 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 23:28:00,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 23:28:00,441 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:13 [2018-01-28 23:28:00,517 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-28 23:28:00,537 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-01-28 23:28:00,537 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-01-28 23:28:00,537 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-28 23:28:00,537 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-28 23:28:00,537 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-28 23:28:00,538 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 8 states. [2018-01-28 23:28:00,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:28:00,731 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-01-28 23:28:00,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 23:28:00,732 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2018-01-28 23:28:00,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:28:00,732 INFO L225 Difference]: With dead ends: 51 [2018-01-28 23:28:00,732 INFO L226 Difference]: Without dead ends: 0 [2018-01-28 23:28:00,733 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2018-01-28 23:28:00,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-28 23:28:00,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-28 23:28:00,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-28 23:28:00,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-28 23:28:00,734 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2018-01-28 23:28:00,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:28:00,734 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-28 23:28:00,734 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-28 23:28:00,734 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-28 23:28:00,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-28 23:28:00,738 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-28 23:28:03,152 WARN L146 SmtUtils]: Spent 2283ms on a formula simplification. DAG size of input: 72 DAG size of output 60 [2018-01-28 23:28:03,570 WARN L146 SmtUtils]: Spent 415ms on a formula simplification. DAG size of input: 70 DAG size of output 61 [2018-01-28 23:28:03,572 INFO L399 ceAbstractionStarter]: For program point L1(lines 1 556) no Hoare annotation was computed. [2018-01-28 23:28:03,572 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 556) no Hoare annotation was computed. [2018-01-28 23:28:03,572 INFO L395 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 556) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-28 23:28:03,572 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 556) no Hoare annotation was computed. [2018-01-28 23:28:03,573 INFO L402 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 556) the Hoare annotation is: true [2018-01-28 23:28:03,573 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 556) no Hoare annotation was computed. [2018-01-28 23:28:03,573 INFO L402 ceAbstractionStarter]: At program point L1(lines 1 556) the Hoare annotation is: true [2018-01-28 23:28:03,573 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 556) no Hoare annotation was computed. [2018-01-28 23:28:03,573 INFO L399 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 556) no Hoare annotation was computed. [2018-01-28 23:28:03,573 INFO L399 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-01-28 23:28:03,573 INFO L399 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-01-28 23:28:03,573 INFO L399 ceAbstractionStarter]: For program point L553'(line 553) no Hoare annotation was computed. [2018-01-28 23:28:03,573 INFO L399 ceAbstractionStarter]: For program point L546(line 546) no Hoare annotation was computed. [2018-01-28 23:28:03,573 INFO L399 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-01-28 23:28:03,573 INFO L399 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-01-28 23:28:03,573 INFO L399 ceAbstractionStarter]: For program point L543(line 543) no Hoare annotation was computed. [2018-01-28 23:28:03,573 INFO L399 ceAbstractionStarter]: For program point L549(line 549) no Hoare annotation was computed. [2018-01-28 23:28:03,573 INFO L399 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 556) no Hoare annotation was computed. [2018-01-28 23:28:03,574 INFO L399 ceAbstractionStarter]: For program point L552'''(line 552) no Hoare annotation was computed. [2018-01-28 23:28:03,574 INFO L399 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-01-28 23:28:03,574 INFO L399 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-01-28 23:28:03,574 INFO L399 ceAbstractionStarter]: For program point L552''(lines 552 554) no Hoare annotation was computed. [2018-01-28 23:28:03,574 INFO L399 ceAbstractionStarter]: For program point mainErr2RequiresViolation(lines 1 556) no Hoare annotation was computed. [2018-01-28 23:28:03,574 INFO L399 ceAbstractionStarter]: For program point L550''(line 550) no Hoare annotation was computed. [2018-01-28 23:28:03,574 INFO L399 ceAbstractionStarter]: For program point L549'''(lines 549 551) no Hoare annotation was computed. [2018-01-28 23:28:03,574 INFO L399 ceAbstractionStarter]: For program point L546'(line 546) no Hoare annotation was computed. [2018-01-28 23:28:03,574 INFO L399 ceAbstractionStarter]: For program point L549''''(line 549) no Hoare annotation was computed. [2018-01-28 23:28:03,574 INFO L399 ceAbstractionStarter]: For program point L543'''(line 543) no Hoare annotation was computed. [2018-01-28 23:28:03,574 INFO L399 ceAbstractionStarter]: For program point L546''''(line 546) no Hoare annotation was computed. [2018-01-28 23:28:03,574 INFO L399 ceAbstractionStarter]: For program point L550'(line 550) no Hoare annotation was computed. [2018-01-28 23:28:03,574 INFO L399 ceAbstractionStarter]: For program point L542'(line 542) no Hoare annotation was computed. [2018-01-28 23:28:03,575 INFO L399 ceAbstractionStarter]: For program point mainFINAL(lines 540 556) no Hoare annotation was computed. [2018-01-28 23:28:03,575 INFO L399 ceAbstractionStarter]: For program point mainErr4RequiresViolation(lines 1 556) no Hoare annotation was computed. [2018-01-28 23:28:03,575 INFO L399 ceAbstractionStarter]: For program point mainEXIT(lines 540 556) no Hoare annotation was computed. [2018-01-28 23:28:03,575 INFO L395 ceAbstractionStarter]: At program point mainENTRY(lines 540 556) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-28 23:28:03,575 INFO L399 ceAbstractionStarter]: For program point L547''''(line 547) no Hoare annotation was computed. [2018-01-28 23:28:03,575 INFO L399 ceAbstractionStarter]: For program point L552''''''(lines 552 554) no Hoare annotation was computed. [2018-01-28 23:28:03,575 INFO L399 ceAbstractionStarter]: For program point L543'(line 543) no Hoare annotation was computed. [2018-01-28 23:28:03,575 INFO L399 ceAbstractionStarter]: For program point L547'(line 547) no Hoare annotation was computed. [2018-01-28 23:28:03,575 INFO L399 ceAbstractionStarter]: For program point L547''(line 547) no Hoare annotation was computed. [2018-01-28 23:28:03,576 INFO L399 ceAbstractionStarter]: For program point L552''''(line 552) no Hoare annotation was computed. [2018-01-28 23:28:03,576 INFO L395 ceAbstractionStarter]: At program point L552'''''(lines 552 554) the Hoare annotation is: (let ((.cse0 (store |old(#valid)| |main_#t~malloc2.base| 1)) (.cse1 (* (* main_~length~2 main_~fac~2) 4)) (.cse2 (* 4 main_~length~2))) (and (= (select |#valid| main_~arr~2.base) 1) (<= main_~length~2 main_~i~2) (= main_~arr2~2.offset 0) (= |#valid| (store .cse0 |main_#t~malloc3.base| 1)) (not (= |main_#t~malloc2.base| 0)) (= 0 main_~arr~2.offset) (not (= main_~arr~2.base 0)) (= 0 |main_#t~malloc2.offset|) (= |main_#t~malloc3.offset| 0) (= (select |#length| main_~arr2~2.base) .cse1) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= (select .cse0 |main_#t~malloc3.base|) 0) (= 1 (select |#valid| main_~arr2~2.base)) (= (select |#length| main_~arr~2.base) .cse2) (= (select |#length| |main_#t~malloc3.base|) .cse1) (<= 0 main_~j~2) (exists ((|main_#t~malloc3.base| Int) (main_~length~2 Int) (main_~fac~2 Int)) (and (not (= main_~arr~2.base |main_#t~malloc3.base|)) (= (select |#length| main_~arr~2.base) (* 4 main_~length~2)) (= (select |#length| |main_#t~malloc3.base|) (* (* main_~length~2 main_~fac~2) 4)) (<= 1 main_~length~2))) (not (= |main_#t~malloc3.base| 0)) (= (select |#length| |main_#t~malloc2.base|) .cse2) (not (= main_~arr2~2.base 0)))) [2018-01-28 23:28:03,576 INFO L399 ceAbstractionStarter]: For program point L553''(line 553) no Hoare annotation was computed. [2018-01-28 23:28:03,576 INFO L399 ceAbstractionStarter]: For program point mainErr5RequiresViolation(lines 1 556) no Hoare annotation was computed. [2018-01-28 23:28:03,576 INFO L399 ceAbstractionStarter]: For program point L549'''''(line 549) no Hoare annotation was computed. [2018-01-28 23:28:03,576 INFO L399 ceAbstractionStarter]: For program point L544'(line 544) no Hoare annotation was computed. [2018-01-28 23:28:03,576 INFO L399 ceAbstractionStarter]: For program point L547'''(line 547) no Hoare annotation was computed. [2018-01-28 23:28:03,577 INFO L399 ceAbstractionStarter]: For program point mainErr6EnsuresViolation(lines 540 556) no Hoare annotation was computed. [2018-01-28 23:28:03,577 INFO L399 ceAbstractionStarter]: For program point L548'(line 548) no Hoare annotation was computed. [2018-01-28 23:28:03,577 INFO L399 ceAbstractionStarter]: For program point L545'''(line 545) no Hoare annotation was computed. [2018-01-28 23:28:03,577 INFO L399 ceAbstractionStarter]: For program point L549'''''''(lines 549 551) no Hoare annotation was computed. [2018-01-28 23:28:03,577 INFO L399 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-01-28 23:28:03,577 INFO L399 ceAbstractionStarter]: For program point mainErr3RequiresViolation(lines 1 556) no Hoare annotation was computed. [2018-01-28 23:28:03,577 INFO L399 ceAbstractionStarter]: For program point L552(lines 552 554) no Hoare annotation was computed. [2018-01-28 23:28:03,577 INFO L399 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-01-28 23:28:03,578 INFO L395 ceAbstractionStarter]: At program point L549''''''(lines 549 551) the Hoare annotation is: (let ((.cse18 (* 4 main_~length~2)) (.cse19 (* (* main_~length~2 main_~fac~2) 4)) (.cse20 (store |old(#valid)| |main_#t~malloc2.base| 1))) (let ((.cse0 (= (select |#valid| main_~arr~2.base) 1)) (.cse1 (= main_~arr2~2.offset 0)) (.cse2 (= |#valid| (store .cse20 |main_#t~malloc3.base| 1))) (.cse3 (= 0 |main_#t~malloc2.offset|)) (.cse4 (= |main_#t~malloc3.offset| 0)) (.cse5 (= (select |#length| main_~arr2~2.base) .cse19)) (.cse6 (not (= |main_#t~malloc3.base| 0))) (.cse7 (not (= |main_#t~malloc2.base| 0))) (.cse8 (= 0 main_~arr~2.offset)) (.cse9 (not (= main_~arr~2.base 0))) (.cse10 (= (select |old(#valid)| |main_#t~malloc2.base|) 0)) (.cse11 (= (select .cse20 |main_#t~malloc3.base|) 0)) (.cse12 (= 1 (select |#valid| main_~arr2~2.base))) (.cse13 (= (select |#length| main_~arr~2.base) .cse18)) (.cse14 (= (select |#length| |main_#t~malloc3.base|) .cse19)) (.cse15 (exists ((|main_#t~malloc3.base| Int) (main_~length~2 Int) (main_~fac~2 Int)) (and (not (= main_~arr~2.base |main_#t~malloc3.base|)) (= (select |#length| main_~arr~2.base) (* 4 main_~length~2)) (= (select |#length| |main_#t~malloc3.base|) (* (* main_~length~2 main_~fac~2) 4)) (<= 1 main_~length~2)))) (.cse16 (= (select |#length| |main_#t~malloc2.base|) .cse18)) (.cse17 (not (= main_~arr2~2.base 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 1 main_~i~2) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= main_~i~2 0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17)))) [2018-01-28 23:28:03,578 INFO L399 ceAbstractionStarter]: For program point L542''(line 542) no Hoare annotation was computed. [2018-01-28 23:28:03,578 INFO L399 ceAbstractionStarter]: For program point L546''(line 546) no Hoare annotation was computed. [2018-01-28 23:28:03,578 INFO L399 ceAbstractionStarter]: For program point L545'(line 545) no Hoare annotation was computed. [2018-01-28 23:28:03,578 INFO L399 ceAbstractionStarter]: For program point L546'''(line 546) no Hoare annotation was computed. [2018-01-28 23:28:03,578 INFO L399 ceAbstractionStarter]: For program point L549'(lines 549 551) no Hoare annotation was computed. [2018-01-28 23:28:03,578 INFO L399 ceAbstractionStarter]: For program point L547'''''(line 547) no Hoare annotation was computed. [2018-01-28 23:28:03,584 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] [2018-01-28 23:28:03,585 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-28 23:28:03,585 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] [2018-01-28 23:28:03,585 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-28 23:28:03,585 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~fac~2,QUANTIFIED] [2018-01-28 23:28:03,586 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-28 23:28:03,587 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,587 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,588 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,588 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,588 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,588 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,593 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] [2018-01-28 23:28:03,593 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-28 23:28:03,593 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] [2018-01-28 23:28:03,593 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-28 23:28:03,594 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~fac~2,QUANTIFIED] [2018-01-28 23:28:03,594 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-28 23:28:03,594 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,595 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,595 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,595 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,595 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,595 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,598 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] [2018-01-28 23:28:03,598 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-28 23:28:03,598 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] [2018-01-28 23:28:03,598 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-28 23:28:03,598 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~fac~2,QUANTIFIED] [2018-01-28 23:28:03,598 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-28 23:28:03,599 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] [2018-01-28 23:28:03,599 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-28 23:28:03,599 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] [2018-01-28 23:28:03,599 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-28 23:28:03,600 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~fac~2,QUANTIFIED] [2018-01-28 23:28:03,600 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-28 23:28:03,600 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,600 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,600 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,600 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,600 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,601 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,601 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,601 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,601 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,601 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,601 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,602 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,604 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] [2018-01-28 23:28:03,604 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-28 23:28:03,604 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] [2018-01-28 23:28:03,605 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-28 23:28:03,605 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~fac~2,QUANTIFIED] [2018-01-28 23:28:03,605 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-28 23:28:03,606 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] [2018-01-28 23:28:03,606 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-28 23:28:03,606 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] [2018-01-28 23:28:03,606 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-28 23:28:03,607 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~fac~2,QUANTIFIED] [2018-01-28 23:28:03,607 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-28 23:28:03,607 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,607 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,607 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,608 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,608 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,608 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,608 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,608 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,608 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,609 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,609 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,609 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 11:28:03 BasicIcfg [2018-01-28 23:28:03,611 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-28 23:28:03,612 INFO L168 Benchmark]: Toolchain (without parser) took 71790.84 ms. Allocated memory was 300.9 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 260.8 MB in the beginning and 937.8 MB in the end (delta: -677.0 MB). Peak memory consumption was 1.3 GB. Max. memory is 5.3 GB. [2018-01-28 23:28:03,613 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 300.9 MB. Free memory is still 266.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-28 23:28:03,613 INFO L168 Benchmark]: CACSL2BoogieTranslator took 203.80 ms. Allocated memory is still 300.9 MB. Free memory was 259.8 MB in the beginning and 249.6 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. [2018-01-28 23:28:03,613 INFO L168 Benchmark]: Boogie Preprocessor took 37.14 ms. Allocated memory is still 300.9 MB. Free memory was 249.6 MB in the beginning and 247.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-28 23:28:03,613 INFO L168 Benchmark]: RCFGBuilder took 290.85 ms. Allocated memory is still 300.9 MB. Free memory was 247.6 MB in the beginning and 229.6 MB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 5.3 GB. [2018-01-28 23:28:03,614 INFO L168 Benchmark]: IcfgTransformer took 64342.63 ms. Allocated memory was 300.9 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 229.6 MB in the beginning and 2.2 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.7 GB. Max. memory is 5.3 GB. [2018-01-28 23:28:03,614 INFO L168 Benchmark]: TraceAbstraction took 6907.80 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 937.8 MB in the end (delta: 1.3 GB). Peak memory consumption was 1.3 GB. Max. memory is 5.3 GB. [2018-01-28 23:28:03,616 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.26 ms. Allocated memory is still 300.9 MB. Free memory is still 266.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 203.80 ms. Allocated memory is still 300.9 MB. Free memory was 259.8 MB in the beginning and 249.6 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 37.14 ms. Allocated memory is still 300.9 MB. Free memory was 249.6 MB in the beginning and 247.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 290.85 ms. Allocated memory is still 300.9 MB. Free memory was 247.6 MB in the beginning and 229.6 MB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 5.3 GB. * IcfgTransformer took 64342.63 ms. Allocated memory was 300.9 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 229.6 MB in the beginning and 2.2 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.7 GB. Max. memory is 5.3 GB. * TraceAbstraction took 6907.80 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 937.8 MB in the end (delta: 1.3 GB). Peak memory consumption was 1.3 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 52 LocStat_MAX_WEQGRAPH_SIZE : 3 LocStat_MAX_SIZEOF_WEQEDGELABEL : 8 LocStat_NO_SUPPORTING_EQUALITIES : 1027 LocStat_NO_SUPPORTING_DISEQUALITIES : 431 LocStat_NO_DISJUNCTIONS : -104 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 71 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 98 TransStat_NO_SUPPORTING_DISEQUALITIES : 16 TransStat_NO_DISJUNCTIONS : 76 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 33.245850 RENAME_VARIABLES(MILLISECONDS) : 0.009409 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 33.029763 PROJECTAWAY(MILLISECONDS) : 0.044183 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.088143 DISJOIN(MILLISECONDS) : 8.455648 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.019070 ADD_EQUALITY(MILLISECONDS) : 0.018414 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.010474 #CONJOIN_DISJUNCTIVE : 739 #RENAME_VARIABLES : 1531 #UNFREEZE : 0 #CONJOIN : 907 #PROJECTAWAY : 783 #ADD_WEAK_EQUALITY : 11 #DISJOIN : 162 #RENAME_VARIABLES_DISJUNCTIVE : 1484 #ADD_EQUALITY : 100 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 10 * Results from de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: - StatisticsResult: HeapSeparatorStatistics COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_0 : 1 COUNT_BLOCKS_for_[#memory_int]_at_dim_0 : 1 COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_1 : 1 COUNT_BLOCKS_for_[#memory_int]_at_dim_1 : 1 COUNT_ARRAY_READS for [#memory_int] : 3 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~fac~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~fac~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~fac~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~fac~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~fac~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~fac~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 540]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 7 specifications checked. All of them hold - InvariantResult [Line: 552]: Loop Invariant [2018-01-28 23:28:03,624 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] [2018-01-28 23:28:03,624 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-28 23:28:03,625 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] [2018-01-28 23:28:03,625 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-28 23:28:03,625 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~fac~2,QUANTIFIED] [2018-01-28 23:28:03,625 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-28 23:28:03,625 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,626 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,626 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,626 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,626 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,626 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,628 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] [2018-01-28 23:28:03,628 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-28 23:28:03,629 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] [2018-01-28 23:28:03,629 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-28 23:28:03,629 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~fac~2,QUANTIFIED] [2018-01-28 23:28:03,629 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-28 23:28:03,629 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,630 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,630 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,630 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,630 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,630 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((((((((((\valid[arr] == 1 && length <= i) && arr2 == 0) && \valid == \old(\valid)[__builtin_alloca (length*sizeof(int)) := 1][__builtin_alloca (fac*length*sizeof(int)) := 1]) && !(__builtin_alloca (length*sizeof(int)) == 0)) && 0 == arr) && !(arr == 0)) && 0 == __builtin_alloca (length*sizeof(int))) && __builtin_alloca (fac*length*sizeof(int)) == 0) && unknown-#length-unknown[arr2] == length * fac * 4) && \old(\valid)[__builtin_alloca (length*sizeof(int))] == 0) && \old(\valid)[__builtin_alloca (length*sizeof(int)) := 1][__builtin_alloca (fac*length*sizeof(int))] == 0) && 1 == \valid[arr2]) && unknown-#length-unknown[arr] == 4 * length) && unknown-#length-unknown[__builtin_alloca (fac*length*sizeof(int))] == length * fac * 4) && 0 <= j) && (\exists main_#t~malloc3.base : int, main_~length~2 : int, main_~fac~2 : int :: ((!(arr == main_#t~malloc3.base) && unknown-#length-unknown[arr] == 4 * main_~length~2) && unknown-#length-unknown[main_#t~malloc3.base] == main_~length~2 * main_~fac~2 * 4) && 1 <= main_~length~2)) && !(__builtin_alloca (fac*length*sizeof(int)) == 0)) && unknown-#length-unknown[__builtin_alloca (length*sizeof(int))] == 4 * length) && !(arr2 == 0) - InvariantResult [Line: 549]: Loop Invariant [2018-01-28 23:28:03,633 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] [2018-01-28 23:28:03,633 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-28 23:28:03,633 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] [2018-01-28 23:28:03,634 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-28 23:28:03,634 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~fac~2,QUANTIFIED] [2018-01-28 23:28:03,634 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-28 23:28:03,635 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] [2018-01-28 23:28:03,635 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-28 23:28:03,635 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] [2018-01-28 23:28:03,635 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-28 23:28:03,635 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~fac~2,QUANTIFIED] [2018-01-28 23:28:03,635 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-28 23:28:03,636 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,636 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,636 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,637 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,637 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,637 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,637 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,637 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,638 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,638 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,638 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,638 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,641 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] [2018-01-28 23:28:03,641 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-28 23:28:03,641 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] [2018-01-28 23:28:03,641 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-28 23:28:03,642 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~fac~2,QUANTIFIED] [2018-01-28 23:28:03,642 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-28 23:28:03,642 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] [2018-01-28 23:28:03,643 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-28 23:28:03,643 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_#t~malloc3.base,QUANTIFIED] [2018-01-28 23:28:03,643 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-28 23:28:03,643 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~fac~2,QUANTIFIED] [2018-01-28 23:28:03,643 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~2,QUANTIFIED] [2018-01-28 23:28:03,644 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,644 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,644 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,644 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,644 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,645 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,645 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,645 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,645 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,645 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,646 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 23:28:03,646 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((((((((((\valid[arr] == 1 && arr2 == 0) && \valid == \old(\valid)[__builtin_alloca (length*sizeof(int)) := 1][__builtin_alloca (fac*length*sizeof(int)) := 1]) && 0 == __builtin_alloca (length*sizeof(int))) && __builtin_alloca (fac*length*sizeof(int)) == 0) && unknown-#length-unknown[arr2] == length * fac * 4) && 1 <= i) && !(__builtin_alloca (fac*length*sizeof(int)) == 0)) && !(__builtin_alloca (length*sizeof(int)) == 0)) && 0 == arr) && !(arr == 0)) && \old(\valid)[__builtin_alloca (length*sizeof(int))] == 0) && \old(\valid)[__builtin_alloca (length*sizeof(int)) := 1][__builtin_alloca (fac*length*sizeof(int))] == 0) && 1 == \valid[arr2]) && unknown-#length-unknown[arr] == 4 * length) && unknown-#length-unknown[__builtin_alloca (fac*length*sizeof(int))] == length * fac * 4) && (\exists main_#t~malloc3.base : int, main_~length~2 : int, main_~fac~2 : int :: ((!(arr == main_#t~malloc3.base) && unknown-#length-unknown[arr] == 4 * main_~length~2) && unknown-#length-unknown[main_#t~malloc3.base] == main_~length~2 * main_~fac~2 * 4) && 1 <= main_~length~2)) && unknown-#length-unknown[__builtin_alloca (length*sizeof(int))] == 4 * length) && !(arr2 == 0)) || ((((((((((((((((((\valid[arr] == 1 && arr2 == 0) && \valid == \old(\valid)[__builtin_alloca (length*sizeof(int)) := 1][__builtin_alloca (fac*length*sizeof(int)) := 1]) && 0 == __builtin_alloca (length*sizeof(int))) && __builtin_alloca (fac*length*sizeof(int)) == 0) && unknown-#length-unknown[arr2] == length * fac * 4) && !(__builtin_alloca (fac*length*sizeof(int)) == 0)) && i == 0) && !(__builtin_alloca (length*sizeof(int)) == 0)) && 0 == arr) && !(arr == 0)) && \old(\valid)[__builtin_alloca (length*sizeof(int))] == 0) && \old(\valid)[__builtin_alloca (length*sizeof(int)) := 1][__builtin_alloca (fac*length*sizeof(int))] == 0) && 1 == \valid[arr2]) && unknown-#length-unknown[arr] == 4 * length) && unknown-#length-unknown[__builtin_alloca (fac*length*sizeof(int))] == length * fac * 4) && (\exists main_#t~malloc3.base : int, main_~length~2 : int, main_~fac~2 : int :: ((!(arr == main_#t~malloc3.base) && unknown-#length-unknown[arr] == 4 * main_~length~2) && unknown-#length-unknown[main_#t~malloc3.base] == main_~length~2 * main_~fac~2 * 4) && 1 <= main_~length~2)) && unknown-#length-unknown[__builtin_alloca (length*sizeof(int))] == 4 * length) && !(arr2 == 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 62 locations, 7 error locations. SAFE Result, 6.8s OverallTime, 9 OverallIterations, 3 TraceHistogramMax, 2.0s AutomataDifference, 0.0s DeadEndRemovalTime, 2.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 372 SDtfs, 841 SDslu, 771 SDs, 0 SdLazy, 592 SolverSat, 37 SolverUnsat, 57 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 319 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 51 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 9 NumberOfFragments, 375 HoareAnnotationTreeSize, 6 FomulaSimplifications, 583 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 6 FomulaSimplificationsInter, 270 FormulaSimplificationTreeSizeReductionInter, 2.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 291 NumberOfCodeBlocks, 275 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 282 ConstructedInterpolants, 55 QuantifiedInterpolants, 109737 SizeOfPredicates, 39 NumberOfNonLiveVariables, 657 ConjunctsInSsa, 100 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 24/30 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/mult_array-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-Benchmark-0-2018-01-28_23-28-03-652.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/mult_array-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-VPDomainBenchmark-0-2018-01-28_23-28-03-652.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/mult_array-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-BenchmarkWithCounters-0-2018-01-28_23-28-03-652.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/mult_array-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-HeapSeparatorBenchmark-0-2018-01-28_23-28-03-652.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/mult_array-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-28_23-28-03-652.csv Received shutdown request...