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/count_down-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-30 00:57:01,998 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 00:57:01,999 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 00:57:02,013 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 00:57:02,013 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 00:57:02,014 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 00:57:02,015 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 00:57:02,017 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 00:57:02,019 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 00:57:02,020 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 00:57:02,020 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 00:57:02,021 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 00:57:02,022 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 00:57:02,023 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 00:57:02,024 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 00:57:02,026 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 00:57:02,028 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 00:57:02,030 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 00:57:02,032 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 00:57:02,033 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 00:57:02,035 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 00:57:02,035 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 00:57:02,036 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 00:57:02,037 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 00:57:02,037 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 00:57:02,038 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 00:57:02,039 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 00:57:02,039 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 00:57:02,040 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 00:57:02,040 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 00:57:02,040 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 00:57:02,041 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-30 00:57:02,050 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 00:57:02,051 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 00:57:02,051 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 00:57:02,052 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 00:57:02,052 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 00:57:02,052 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 00:57:02,052 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 00:57:02,053 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 00:57:02,053 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 00:57:02,053 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-30 00:57:02,053 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 00:57:02,054 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 00:57:02,054 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 00:57:02,054 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-30 00:57:02,054 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-30 00:57:02,054 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-30 00:57:02,054 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 00:57:02,055 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 00:57:02,055 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 00:57:02,055 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 00:57:02,055 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 00:57:02,055 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 00:57:02,056 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 00:57:02,056 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 00:57:02,056 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 00:57:02,056 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 00:57:02,056 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 00:57:02,057 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 00:57:02,057 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 00:57:02,057 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 00:57:02,057 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 00:57:02,057 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 00:57:02,058 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 00:57:02,058 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 00:57:02,092 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 00:57:02,105 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 00:57:02,108 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 00:57:02,110 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 00:57:02,110 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 00:57:02,110 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/count_down-alloca_true-valid-memsafety_true-termination.i [2018-01-30 00:57:02,266 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 00:57:02,270 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-01-30 00:57:02,293 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 00:57:02,293 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 00:57:02,298 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 00:57:02,299 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:57:02" (1/1) ... [2018-01-30 00:57:02,301 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67990aa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:57:02, skipping insertion in model container [2018-01-30 00:57:02,301 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:57:02" (1/1) ... [2018-01-30 00:57:02,319 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:57:02,358 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:57:02,466 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:57:02,481 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:57:02,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:57:02 WrapperNode [2018-01-30 00:57:02,489 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 00:57:02,490 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 00:57:02,490 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 00:57:02,490 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 00:57:02,508 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:57:02" (1/1) ... [2018-01-30 00:57:02,509 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:57:02" (1/1) ... [2018-01-30 00:57:02,518 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:57:02" (1/1) ... [2018-01-30 00:57:02,518 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:57:02" (1/1) ... [2018-01-30 00:57:02,522 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:57:02" (1/1) ... [2018-01-30 00:57:02,525 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:57:02" (1/1) ... [2018-01-30 00:57:02,526 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:57:02" (1/1) ... [2018-01-30 00:57:02,527 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 00:57:02,527 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 00:57:02,527 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 00:57:02,528 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 00:57:02,528 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:57:02" (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-30 00:57:02,571 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 00:57:02,572 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 00:57:02,572 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 00:57:02,572 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-30 00:57:02,572 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-30 00:57:02,572 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-30 00:57:02,572 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-30 00:57:02,572 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-30 00:57:02,572 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 00:57:02,572 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 00:57:02,573 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 00:57:02,573 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 00:57:02,768 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 00:57:02,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:57:02 BoogieIcfgContainer [2018-01-30 00:57:02,769 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 00:57:02,769 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-01-30 00:57:02,769 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-01-30 00:57:02,770 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-01-30 00:57:02,773 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:57:02" (1/1) ... [2018-01-30 00:57:02,779 INFO L103 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-01-30 00:57:02,780 INFO L104 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-01-30 00:57:02,780 INFO L150 apSepIcfgTransformer]: starting freeze-var-style preprocessing [2018-01-30 00:57:02,822 INFO L162 apSepIcfgTransformer]: finished StoreIndexFreezer, created 8 freeze vars and freeze var literals (each corresponds to one heap write) [2018-01-30 00:57:02,854 INFO L221 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-01-30 00:57:02,911 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-30 00:57:50,414 INFO L311 AbstractInterpreter]: Visited 71 different actions 569 times. Merged at 44 different actions 365 times. Widened at 4 different actions 20 times. Found 30 fixpoints after 12 different actions. Largest state had 50 variables. [2018-01-30 00:57:50,417 INFO L229 apSepIcfgTransformer]: finished equality analysis [2018-01-30 00:57:50,426 INFO L244 HeapSepPreAnalysis]: Number of read from array group [#memory_int] : 4 [2018-01-30 00:57:50,426 INFO L241 apSepIcfgTransformer]: Finished pre analysis before partitioning [2018-01-30 00:57:50,427 INFO L242 apSepIcfgTransformer]: array groups: Set: [#memory_int] [2018-01-30 00:57:50,427 INFO L244 apSepIcfgTransformer]: select infos: Set: ((select (select |v_#memory_int_6| v_main_~arr~2.base_10) (+ (* 4 v_main_~j~2_7) v_main_~arr~2.offset_8)), at (SUMMARY for call #t~mem7 := read~int(~arr~2.base, ~arr~2.offset + ~j~2 * 4, 4); srcloc: L556)) ((select |v_#memory_int_4| v_main_~arr~2.base_4), at (SUMMARY for call write~int(~val~2, ~arr~2.base, ~arr~2.offset + ~i~2 * 4, 4); srcloc: L549'')) ((select (select |v_#memory_int_5| v_main_~arr~2.base_7) (+ (* 4 v_main_~j~2_5) v_main_~arr~2.offset_6)), at (SUMMARY for call #t~mem6 := read~int(~arr~2.base, ~arr~2.offset + ~j~2 * 4, 4); srcloc: L555)) ((select |v_#memory_int_8| v_main_~arr~2.base_13), at (SUMMARY for call write~int(#t~post8 - 1, ~arr~2.base, ~arr~2.offset + ~j~2 * 4, 4); srcloc: L556'')) [2018-01-30 00:57:50,435 INFO L547 PartitionManager]: partitioning result: [2018-01-30 00:57:50,435 INFO L552 PartitionManager]: location blocks for array group [#memory_int] [2018-01-30 00:57:50,435 INFO L561 PartitionManager]: at dimension 0 [2018-01-30 00:57:50,435 INFO L562 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 2 [2018-01-30 00:57:50,435 INFO L563 PartitionManager]: # location blocks :1 [2018-01-30 00:57:50,435 INFO L561 PartitionManager]: at dimension 1 [2018-01-30 00:57:50,435 INFO L562 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 2 [2018-01-30 00:57:50,436 INFO L563 PartitionManager]: # location blocks :1 [2018-01-30 00:57:50,436 INFO L86 ransitionTransformer]: executing heap partitioning transformation [2018-01-30 00:57:50,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 12:57:50 BasicIcfg [2018-01-30 00:57:50,450 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-01-30 00:57:50,451 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 00:57:50,451 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 00:57:50,453 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 00:57:50,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 12:57:02" (1/4) ... [2018-01-30 00:57:50,454 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52c334df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:57:50, skipping insertion in model container [2018-01-30 00:57:50,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:57:02" (2/4) ... [2018-01-30 00:57:50,454 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52c334df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:57:50, skipping insertion in model container [2018-01-30 00:57:50,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:57:02" (3/4) ... [2018-01-30 00:57:50,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52c334df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 12:57:50, skipping insertion in model container [2018-01-30 00:57:50,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 12:57:50" (4/4) ... [2018-01-30 00:57:50,456 INFO L107 eAbstractionObserver]: Analyzing ICFG HeapSeparatedIcfg [2018-01-30 00:57:50,509 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 00:57:50,515 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-30 00:57:50,544 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 00:57:50,545 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 00:57:50,545 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 00:57:50,545 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 00:57:50,545 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 00:57:50,545 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 00:57:50,545 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 00:57:50,545 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 00:57:50,546 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 00:57:50,556 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-01-30 00:57:50,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-30 00:57:50,562 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:57:50,563 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:57:50,563 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-30 00:57:50,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1887340579, now seen corresponding path program 1 times [2018-01-30 00:57:50,567 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:57:50,568 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:57:50,606 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:57:50,606 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:57:50,606 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:57:50,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:57:50,648 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:57:50,722 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-30 00:57:50,724 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:57:50,725 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 00:57:50,726 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 00:57:50,733 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 00:57:50,733 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 00:57:50,735 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 4 states. [2018-01-30 00:57:50,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:57:50,806 INFO L93 Difference]: Finished difference Result 94 states and 107 transitions. [2018-01-30 00:57:50,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 00:57:50,808 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-30 00:57:50,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:57:50,819 INFO L225 Difference]: With dead ends: 94 [2018-01-30 00:57:50,819 INFO L226 Difference]: Without dead ends: 58 [2018-01-30 00:57:50,823 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-30 00:57:50,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-30 00:57:50,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-01-30 00:57:50,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-30 00:57:50,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2018-01-30 00:57:50,854 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 16 [2018-01-30 00:57:50,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:57:50,855 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2018-01-30 00:57:50,855 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 00:57:50,855 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2018-01-30 00:57:50,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-30 00:57:50,856 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:57:50,856 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:57:50,856 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-30 00:57:50,856 INFO L82 PathProgramCache]: Analyzing trace with hash -375684485, now seen corresponding path program 1 times [2018-01-30 00:57:50,857 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:57:50,857 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:57:50,857 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:57:50,858 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:57:50,858 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:57:50,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:57:50,868 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:57:50,923 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-30 00:57:50,924 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:57:50,924 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 00:57:50,925 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 00:57:50,926 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 00:57:50,926 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 00:57:50,926 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand 4 states. [2018-01-30 00:57:51,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:57:51,079 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2018-01-30 00:57:51,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 00:57:51,079 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-01-30 00:57:51,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:57:51,081 INFO L225 Difference]: With dead ends: 58 [2018-01-30 00:57:51,081 INFO L226 Difference]: Without dead ends: 54 [2018-01-30 00:57:51,082 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-30 00:57:51,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-30 00:57:51,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-30 00:57:51,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-30 00:57:51,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-01-30 00:57:51,088 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 20 [2018-01-30 00:57:51,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:57:51,088 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-01-30 00:57:51,088 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 00:57:51,088 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-01-30 00:57:51,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-30 00:57:51,089 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:57:51,089 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:57:51,089 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-30 00:57:51,090 INFO L82 PathProgramCache]: Analyzing trace with hash -375684483, now seen corresponding path program 1 times [2018-01-30 00:57:51,090 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:57:51,090 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:57:51,091 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:57:51,091 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:57:51,091 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:57:51,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:57:51,104 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:57:51,247 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-30 00:57:51,248 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:57:51,248 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:57:51,248 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:57:51,248 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:57:51,249 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:57:51,249 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 6 states. [2018-01-30 00:57:51,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:57:51,459 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2018-01-30 00:57:51,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 00:57:51,460 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-01-30 00:57:51,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:57:51,461 INFO L225 Difference]: With dead ends: 99 [2018-01-30 00:57:51,461 INFO L226 Difference]: Without dead ends: 98 [2018-01-30 00:57:51,462 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-01-30 00:57:51,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-30 00:57:51,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 62. [2018-01-30 00:57:51,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-30 00:57:51,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2018-01-30 00:57:51,471 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 20 [2018-01-30 00:57:51,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:57:51,471 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2018-01-30 00:57:51,471 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:57:51,471 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2018-01-30 00:57:51,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-30 00:57:51,472 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:57:51,472 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:57:51,473 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-30 00:57:51,473 INFO L82 PathProgramCache]: Analyzing trace with hash -438607179, now seen corresponding path program 1 times [2018-01-30 00:57:51,473 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:57:51,473 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:57:51,474 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:57:51,474 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:57:51,474 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:57:51,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:57:51,483 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:57:51,521 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-30 00:57:51,521 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:57:51,521 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 00:57:51,522 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 00:57:51,522 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 00:57:51,522 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-30 00:57:51,522 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand 4 states. [2018-01-30 00:57:51,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:57:51,553 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2018-01-30 00:57:51,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 00:57:51,553 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-01-30 00:57:51,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:57:51,554 INFO L225 Difference]: With dead ends: 88 [2018-01-30 00:57:51,555 INFO L226 Difference]: Without dead ends: 64 [2018-01-30 00:57:51,555 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-30 00:57:51,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-30 00:57:51,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2018-01-30 00:57:51,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-30 00:57:51,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2018-01-30 00:57:51,562 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 20 [2018-01-30 00:57:51,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:57:51,562 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2018-01-30 00:57:51,562 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 00:57:51,563 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-01-30 00:57:51,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-30 00:57:51,564 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:57:51,564 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:57:51,564 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-30 00:57:51,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1114233201, now seen corresponding path program 1 times [2018-01-30 00:57:51,564 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:57:51,564 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:57:51,565 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:57:51,565 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:57:51,566 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:57:51,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:57:51,578 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:57:51,897 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:57:51,897 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:57:51,897 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:57:51,912 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:57:51,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:57:51,934 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:57:51,965 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-30 00:57:51,966 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:57:51,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:57:51,978 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-30 00:57:52,125 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:57:52,160 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:57:52,160 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-01-30 00:57:52,161 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-30 00:57:52,161 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-30 00:57:52,161 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-01-30 00:57:52,161 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 12 states. [2018-01-30 00:57:52,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:57:52,529 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2018-01-30 00:57:52,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-30 00:57:52,529 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2018-01-30 00:57:52,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:57:52,530 INFO L225 Difference]: With dead ends: 65 [2018-01-30 00:57:52,530 INFO L226 Difference]: Without dead ends: 64 [2018-01-30 00:57:52,531 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2018-01-30 00:57:52,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-30 00:57:52,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2018-01-30 00:57:52,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-30 00:57:52,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2018-01-30 00:57:52,537 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 30 [2018-01-30 00:57:52,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:57:52,538 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2018-01-30 00:57:52,538 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-30 00:57:52,538 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2018-01-30 00:57:52,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-30 00:57:52,539 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:57:52,539 INFO L350 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:57:52,539 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-30 00:57:52,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1051310505, now seen corresponding path program 1 times [2018-01-30 00:57:52,540 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:57:52,540 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:57:52,541 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:57:52,541 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:57:52,541 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:57:52,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:57:52,553 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:57:52,721 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-30 00:57:52,722 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:57:52,722 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 00:57:52,722 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 00:57:52,722 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 00:57:52,723 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:57:52,723 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand 7 states. [2018-01-30 00:57:52,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:57:52,803 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2018-01-30 00:57:52,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:57:52,803 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-01-30 00:57:52,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:57:52,804 INFO L225 Difference]: With dead ends: 77 [2018-01-30 00:57:52,804 INFO L226 Difference]: Without dead ends: 69 [2018-01-30 00:57:52,805 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-01-30 00:57:52,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-30 00:57:52,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2018-01-30 00:57:52,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-30 00:57:52,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2018-01-30 00:57:52,810 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 30 [2018-01-30 00:57:52,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:57:52,810 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2018-01-30 00:57:52,810 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 00:57:52,810 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2018-01-30 00:57:52,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-30 00:57:52,811 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:57:52,811 INFO L350 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] [2018-01-30 00:57:52,811 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-30 00:57:52,811 INFO L82 PathProgramCache]: Analyzing trace with hash -485275430, now seen corresponding path program 1 times [2018-01-30 00:57:52,811 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:57:52,811 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:57:52,812 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:57:52,812 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:57:52,812 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:57:52,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:57:52,821 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:57:52,889 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:57:52,889 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:57:52,889 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:57:52,895 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:57:52,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:57:52,907 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:57:52,954 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:57:52,986 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:57:52,986 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2018-01-30 00:57:52,986 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-30 00:57:52,986 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-30 00:57:52,987 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-01-30 00:57:52,987 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand 14 states. [2018-01-30 00:57:53,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:57:53,243 INFO L93 Difference]: Finished difference Result 157 states and 171 transitions. [2018-01-30 00:57:53,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-30 00:57:53,243 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 39 [2018-01-30 00:57:53,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:57:53,245 INFO L225 Difference]: With dead ends: 157 [2018-01-30 00:57:53,245 INFO L226 Difference]: Without dead ends: 134 [2018-01-30 00:57:53,246 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=145, Invalid=557, Unknown=0, NotChecked=0, Total=702 [2018-01-30 00:57:53,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-01-30 00:57:53,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 112. [2018-01-30 00:57:53,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-30 00:57:53,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 123 transitions. [2018-01-30 00:57:53,260 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 123 transitions. Word has length 39 [2018-01-30 00:57:53,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:57:53,260 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 123 transitions. [2018-01-30 00:57:53,260 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-30 00:57:53,260 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 123 transitions. [2018-01-30 00:57:53,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-30 00:57:53,262 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:57:53,262 INFO L350 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2018-01-30 00:57:53,262 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-30 00:57:53,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1799783822, now seen corresponding path program 1 times [2018-01-30 00:57:53,262 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:57:53,263 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:57:53,263 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:57:53,263 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:57:53,264 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:57:53,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:57:53,276 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:57:53,340 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-30 00:57:53,340 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:57:53,340 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 00:57:53,341 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 00:57:53,341 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 00:57:53,341 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 00:57:53,341 INFO L87 Difference]: Start difference. First operand 112 states and 123 transitions. Second operand 4 states. [2018-01-30 00:57:53,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:57:53,372 INFO L93 Difference]: Finished difference Result 112 states and 123 transitions. [2018-01-30 00:57:53,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 00:57:53,373 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2018-01-30 00:57:53,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:57:53,374 INFO L225 Difference]: With dead ends: 112 [2018-01-30 00:57:53,374 INFO L226 Difference]: Without dead ends: 71 [2018-01-30 00:57:53,374 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-30 00:57:53,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-30 00:57:53,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-01-30 00:57:53,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-30 00:57:53,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2018-01-30 00:57:53,380 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 41 [2018-01-30 00:57:53,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:57:53,380 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2018-01-30 00:57:53,380 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 00:57:53,380 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2018-01-30 00:57:53,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-30 00:57:53,381 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:57:53,381 INFO L350 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 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] [2018-01-30 00:57:53,381 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-30 00:57:53,381 INFO L82 PathProgramCache]: Analyzing trace with hash 801736038, now seen corresponding path program 2 times [2018-01-30 00:57:53,381 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:57:53,381 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:57:53,382 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:57:53,382 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:57:53,382 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:57:53,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:57:53,392 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:57:53,693 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:57:53,693 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:57:53,693 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:57:53,705 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 00:57:53,716 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:57:53,727 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:57:53,728 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:57:53,731 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:57:53,953 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:57:53,987 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:57:53,987 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2018-01-30 00:57:53,987 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-30 00:57:53,987 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-30 00:57:53,988 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2018-01-30 00:57:53,988 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 21 states. [2018-01-30 00:57:54,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:57:54,444 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2018-01-30 00:57:54,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-30 00:57:54,445 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 49 [2018-01-30 00:57:54,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:57:54,446 INFO L225 Difference]: With dead ends: 92 [2018-01-30 00:57:54,446 INFO L226 Difference]: Without dead ends: 89 [2018-01-30 00:57:54,446 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=223, Invalid=769, Unknown=0, NotChecked=0, Total=992 [2018-01-30 00:57:54,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-01-30 00:57:54,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2018-01-30 00:57:54,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-30 00:57:54,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2018-01-30 00:57:54,456 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 49 [2018-01-30 00:57:54,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:57:54,457 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2018-01-30 00:57:54,457 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-30 00:57:54,457 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2018-01-30 00:57:54,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-30 00:57:54,458 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:57:54,459 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:57:54,459 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-30 00:57:54,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1539334589, now seen corresponding path program 3 times [2018-01-30 00:57:54,459 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:57:54,459 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:57:54,460 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:57:54,460 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:57:54,460 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:57:54,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:57:54,472 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:57:54,574 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:57:54,574 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:57:54,575 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:57:54,579 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 00:57:54,587 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:57:54,591 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:57:54,591 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:57:54,594 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:57:54,844 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-01-30 00:57:54,864 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:57:54,864 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 21 [2018-01-30 00:57:54,864 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-30 00:57:54,865 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-30 00:57:54,865 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2018-01-30 00:57:54,865 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand 21 states. [2018-01-30 00:57:55,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:57:55,863 INFO L93 Difference]: Finished difference Result 157 states and 173 transitions. [2018-01-30 00:57:55,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-01-30 00:57:55,906 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 58 [2018-01-30 00:57:55,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:57:55,906 INFO L225 Difference]: With dead ends: 157 [2018-01-30 00:57:55,906 INFO L226 Difference]: Without dead ends: 0 [2018-01-30 00:57:55,907 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=383, Invalid=2067, Unknown=0, NotChecked=0, Total=2450 [2018-01-30 00:57:55,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-30 00:57:55,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-30 00:57:55,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-30 00:57:55,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-30 00:57:55,908 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2018-01-30 00:57:55,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:57:55,908 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-30 00:57:55,908 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-30 00:57:55,908 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-30 00:57:55,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-30 00:57:55,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-30 00:57:55,970 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-30 00:57:55,983 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-30 00:57:55,991 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-30 00:57:55,997 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-30 00:57:56,032 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-30 00:57:56,043 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-30 00:57:56,049 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-30 00:57:56,059 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-30 00:57:56,479 WARN L146 SmtUtils]: Spent 386ms on a formula simplification. DAG size of input: 80 DAG size of output 58 [2018-01-30 00:57:56,712 WARN L146 SmtUtils]: Spent 228ms on a formula simplification. DAG size of input: 72 DAG size of output 55 [2018-01-30 00:57:56,940 WARN L146 SmtUtils]: Spent 227ms on a formula simplification. DAG size of input: 59 DAG size of output 46 [2018-01-30 00:57:56,943 INFO L399 ceAbstractionStarter]: For program point L1(lines 1 560) no Hoare annotation was computed. [2018-01-30 00:57:56,943 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 560) no Hoare annotation was computed. [2018-01-30 00:57:56,944 INFO L395 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 560) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-30 00:57:56,944 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 560) no Hoare annotation was computed. [2018-01-30 00:57:56,944 INFO L402 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 560) the Hoare annotation is: true [2018-01-30 00:57:56,944 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 560) no Hoare annotation was computed. [2018-01-30 00:57:56,944 INFO L402 ceAbstractionStarter]: At program point L1(lines 1 560) the Hoare annotation is: true [2018-01-30 00:57:56,944 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 560) no Hoare annotation was computed. [2018-01-30 00:57:56,944 INFO L399 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-30 00:57:56,944 INFO L399 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-01-30 00:57:56,944 INFO L399 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-01-30 00:57:56,944 INFO L399 ceAbstractionStarter]: For program point mainErr8EnsuresViolation(lines 540 560) no Hoare annotation was computed. [2018-01-30 00:57:56,944 INFO L399 ceAbstractionStarter]: For program point L546(line 546) no Hoare annotation was computed. [2018-01-30 00:57:56,944 INFO L399 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-01-30 00:57:56,945 INFO L399 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-01-30 00:57:56,945 INFO L399 ceAbstractionStarter]: For program point L543(line 543) no Hoare annotation was computed. [2018-01-30 00:57:56,945 INFO L399 ceAbstractionStarter]: For program point L549(lines 549 551) no Hoare annotation was computed. [2018-01-30 00:57:56,945 INFO L399 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-30 00:57:56,945 INFO L399 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-01-30 00:57:56,945 INFO L399 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-01-30 00:57:56,945 INFO L395 ceAbstractionStarter]: At program point L554'''''(lines 554 558) the Hoare annotation is: (let ((.cse13 (* 4 main_~length~2))) (let ((.cse0 (not (= 0 main_~arr~2.base))) (.cse1 (= |old(#valid)| (store |#valid| |main_#t~malloc1.base| 0))) (.cse2 (exists ((v_prenex_1 Int)) (and (<= (+ main_~arr~2.offset (* 4 v_prenex_1) 4) (select |#length| main_~arr~2.base)) (<= main_~length~2 (+ v_prenex_1 1))))) (.cse3 (<= |main_#t~malloc1.offset| 0)) (.cse4 (= .cse13 (select |#length| main_~arr~2.base))) (.cse5 (not (= 0 |main_#t~malloc1.base|))) (.cse6 (= 1 (select |#valid| |main_#t~malloc1.base|))) (.cse7 (<= 0 |main_#t~malloc1.offset|)) (.cse8 (= 1 (select |#valid| main_~arr~2.base))) (.cse9 (<= 0 main_~arr~2.offset)) (.cse10 (<= 1 main_~i~2)) (.cse11 (exists ((v_prenex_1 Int)) (and (<= (+ main_~arr~2.offset (* 4 v_prenex_1) 4) (select |#length| main_~arr~2.base)) (<= main_~i~2 (+ v_prenex_1 1))))) (.cse12 (= .cse13 (select |#length| |main_#t~malloc1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 (= main_~j~2 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (exists ((v_prenex_2 Int)) (and (<= (+ v_prenex_2 1) main_~j~2) (<= 0 (+ (* 4 v_prenex_2) main_~arr~2.offset)))) .cse8 .cse9 .cse10 .cse11 .cse12)))) [2018-01-30 00:57:56,945 INFO L399 ceAbstractionStarter]: For program point mainErr2RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-30 00:57:56,945 INFO L399 ceAbstractionStarter]: For program point L546'(line 546) no Hoare annotation was computed. [2018-01-30 00:57:56,945 INFO L399 ceAbstractionStarter]: For program point L554''(lines 554 558) no Hoare annotation was computed. [2018-01-30 00:57:56,945 INFO L399 ceAbstractionStarter]: For program point L556''(line 556) no Hoare annotation was computed. [2018-01-30 00:57:56,945 INFO L399 ceAbstractionStarter]: For program point mainFINAL(lines 540 560) no Hoare annotation was computed. [2018-01-30 00:57:56,945 INFO L399 ceAbstractionStarter]: For program point mainErr4RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-30 00:57:56,946 INFO L399 ceAbstractionStarter]: For program point mainEXIT(lines 540 560) no Hoare annotation was computed. [2018-01-30 00:57:56,946 INFO L395 ceAbstractionStarter]: At program point mainENTRY(lines 540 560) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-30 00:57:56,946 INFO L399 ceAbstractionStarter]: For program point mainErr7RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-30 00:57:56,946 INFO L399 ceAbstractionStarter]: For program point L554'''(line 554) no Hoare annotation was computed. [2018-01-30 00:57:56,946 INFO L399 ceAbstractionStarter]: For program point L547''''(line 547) no Hoare annotation was computed. [2018-01-30 00:57:56,946 INFO L399 ceAbstractionStarter]: For program point L543'(line 543) no Hoare annotation was computed. [2018-01-30 00:57:56,946 INFO L399 ceAbstractionStarter]: For program point L545''(line 545) no Hoare annotation was computed. [2018-01-30 00:57:56,946 INFO L399 ceAbstractionStarter]: For program point L555'(line 555) no Hoare annotation was computed. [2018-01-30 00:57:56,946 INFO L399 ceAbstractionStarter]: For program point L543''(line 543) no Hoare annotation was computed. [2018-01-30 00:57:56,946 INFO L399 ceAbstractionStarter]: For program point L547'(lines 547 553) no Hoare annotation was computed. [2018-01-30 00:57:56,946 INFO L399 ceAbstractionStarter]: For program point L547''''''(lines 547 553) no Hoare annotation was computed. [2018-01-30 00:57:56,946 INFO L399 ceAbstractionStarter]: For program point L549''(lines 549 551) no Hoare annotation was computed. [2018-01-30 00:57:56,946 INFO L399 ceAbstractionStarter]: For program point L544'''(line 544) no Hoare annotation was computed. [2018-01-30 00:57:56,947 INFO L399 ceAbstractionStarter]: For program point mainErr6RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-30 00:57:56,947 INFO L399 ceAbstractionStarter]: For program point L545''''(line 545) no Hoare annotation was computed. [2018-01-30 00:57:56,947 INFO L399 ceAbstractionStarter]: For program point mainErr5RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-30 00:57:56,947 INFO L399 ceAbstractionStarter]: For program point L544'(line 544) no Hoare annotation was computed. [2018-01-30 00:57:56,947 INFO L399 ceAbstractionStarter]: For program point L556'(line 556) no Hoare annotation was computed. [2018-01-30 00:57:56,947 INFO L399 ceAbstractionStarter]: For program point L547'''(line 547) no Hoare annotation was computed. [2018-01-30 00:57:56,947 INFO L399 ceAbstractionStarter]: For program point L548'(line 548) no Hoare annotation was computed. [2018-01-30 00:57:56,947 INFO L399 ceAbstractionStarter]: For program point L555''(line 555) no Hoare annotation was computed. [2018-01-30 00:57:56,947 INFO L399 ceAbstractionStarter]: For program point L545'''(line 545) no Hoare annotation was computed. [2018-01-30 00:57:56,947 INFO L399 ceAbstractionStarter]: For program point mainErr3RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-30 00:57:56,947 INFO L399 ceAbstractionStarter]: For program point L552(line 552) no Hoare annotation was computed. [2018-01-30 00:57:56,947 INFO L399 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-01-30 00:57:56,947 INFO L399 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-01-30 00:57:56,947 INFO L399 ceAbstractionStarter]: For program point L555(lines 555 557) no Hoare annotation was computed. [2018-01-30 00:57:56,947 INFO L399 ceAbstractionStarter]: For program point L554(lines 554 558) no Hoare annotation was computed. [2018-01-30 00:57:56,948 INFO L399 ceAbstractionStarter]: For program point L554''''(line 554) no Hoare annotation was computed. [2018-01-30 00:57:56,948 INFO L399 ceAbstractionStarter]: For program point L556'''(line 556) no Hoare annotation was computed. [2018-01-30 00:57:56,948 INFO L399 ceAbstractionStarter]: For program point L556''''(line 556) no Hoare annotation was computed. [2018-01-30 00:57:56,948 INFO L399 ceAbstractionStarter]: For program point L554''''''(lines 554 558) no Hoare annotation was computed. [2018-01-30 00:57:56,948 INFO L399 ceAbstractionStarter]: For program point L555''''(line 555) no Hoare annotation was computed. [2018-01-30 00:57:56,948 INFO L399 ceAbstractionStarter]: For program point L545'(line 545) no Hoare annotation was computed. [2018-01-30 00:57:56,948 INFO L395 ceAbstractionStarter]: At program point L555'''''(lines 555 557) the Hoare annotation is: (let ((.cse13 (* 4 main_~length~2))) (let ((.cse0 (not (= 0 main_~arr~2.base))) (.cse1 (= |old(#valid)| (store |#valid| |main_#t~malloc1.base| 0))) (.cse2 (exists ((v_prenex_1 Int)) (and (<= (+ main_~arr~2.offset (* 4 v_prenex_1) 4) (select |#length| main_~arr~2.base)) (<= main_~length~2 (+ v_prenex_1 1))))) (.cse3 (<= |main_#t~malloc1.offset| 0)) (.cse4 (= .cse13 (select |#length| main_~arr~2.base))) (.cse5 (not (= 0 |main_#t~malloc1.base|))) (.cse6 (= 1 (select |#valid| |main_#t~malloc1.base|))) (.cse7 (<= 0 |main_#t~malloc1.offset|)) (.cse8 (= 1 (select |#valid| main_~arr~2.base))) (.cse9 (<= 0 main_~arr~2.offset)) (.cse10 (<= 1 main_~i~2)) (.cse11 (exists ((v_prenex_1 Int)) (and (<= (+ main_~arr~2.offset (* 4 v_prenex_1) 4) (select |#length| main_~arr~2.base)) (<= main_~i~2 (+ v_prenex_1 1))))) (.cse12 (= .cse13 (select |#length| |main_#t~malloc1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 (= main_~j~2 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (exists ((v_prenex_2 Int)) (and (<= (+ v_prenex_2 1) main_~j~2) (<= 0 (+ (* 4 v_prenex_2) main_~arr~2.offset)))) .cse8 .cse9 .cse10 (exists ((v_prenex_1 Int)) (and (<= (+ main_~arr~2.offset (* 4 v_prenex_1) 4) (select |#length| main_~arr~2.base)) (<= main_~j~2 v_prenex_1))) .cse11 .cse12)))) [2018-01-30 00:57:56,948 INFO L395 ceAbstractionStarter]: At program point L547'''''(lines 547 553) the Hoare annotation is: (let ((.cse11 (* 4 main_~length~2))) (let ((.cse0 (<= main_~arr~2.offset 0)) (.cse1 (not (= 0 main_~arr~2.base))) (.cse2 (= |old(#valid)| (store |#valid| |main_#t~malloc1.base| 0))) (.cse3 (<= |main_#t~malloc1.offset| 0)) (.cse4 (= .cse11 (select |#length| main_~arr~2.base))) (.cse5 (not (= 0 |main_#t~malloc1.base|))) (.cse6 (= 1 (select |#valid| |main_#t~malloc1.base|))) (.cse7 (<= 0 |main_#t~malloc1.offset|)) (.cse8 (= 1 (select |#valid| main_~arr~2.base))) (.cse9 (<= 0 main_~arr~2.offset)) (.cse10 (= .cse11 (select |#length| |main_#t~malloc1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= 1 main_~i~2) (exists ((v_prenex_1 Int)) (and (<= (+ main_~arr~2.offset (* 4 v_prenex_1) 4) (select |#length| main_~arr~2.base)) (<= main_~i~2 (+ v_prenex_1 1)))) .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= (+ |main_#t~malloc1.offset| 4) .cse11) .cse9 .cse10 (= main_~i~2 0))))) [2018-01-30 00:57:56,948 INFO L399 ceAbstractionStarter]: For program point L548''(line 548) no Hoare annotation was computed. [2018-01-30 00:57:56,954 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:56,955 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:56,955 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:56,956 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:56,956 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:56,956 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:56,957 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-01-30 00:57:56,957 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-01-30 00:57:56,957 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:56,958 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:56,958 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:56,958 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:56,960 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:56,961 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:56,961 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:56,961 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:56,961 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:56,962 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:56,962 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:56,962 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:56,962 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:56,968 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:56,968 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:56,969 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:56,969 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:56,969 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:56,970 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:56,970 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-01-30 00:57:56,970 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-01-30 00:57:56,970 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:56,970 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:56,971 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:56,971 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:56,971 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:56,971 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:56,971 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:56,971 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:56,972 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:56,972 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:56,972 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:56,972 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:56,972 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:56,974 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:56,975 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:56,975 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:56,975 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:56,976 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:56,976 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:56,976 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-01-30 00:57:56,977 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-01-30 00:57:56,977 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:56,977 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:56,977 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:56,978 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:56,978 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:56,978 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:56,978 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:56,979 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:56,979 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:56,979 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:56,980 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:56,980 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:56,981 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:56,981 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:56,981 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:56,981 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:56,981 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-01-30 00:57:56,981 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-01-30 00:57:56,982 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:56,982 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:56,982 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:56,982 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:56,983 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:56,983 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:56,983 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:56,983 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:56,984 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:56,984 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:56,986 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:56,986 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:56,987 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:56,987 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:56,987 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:56,987 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:56,988 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:56,989 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:56,990 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:56,990 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:56,991 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:56,991 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:56,991 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:56,991 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:56,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 12:57:56 BasicIcfg [2018-01-30 00:57:56,993 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 00:57:56,994 INFO L168 Benchmark]: Toolchain (without parser) took 54728.12 ms. Allocated memory was 304.1 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 264.1 MB in the beginning and 918.6 MB in the end (delta: -654.4 MB). Peak memory consumption was 1.3 GB. Max. memory is 5.3 GB. [2018-01-30 00:57:56,995 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 304.1 MB. Free memory is still 270.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 00:57:56,995 INFO L168 Benchmark]: CACSL2BoogieTranslator took 196.42 ms. Allocated memory is still 304.1 MB. Free memory was 263.1 MB in the beginning and 253.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-30 00:57:56,996 INFO L168 Benchmark]: Boogie Preprocessor took 37.15 ms. Allocated memory is still 304.1 MB. Free memory was 253.2 MB in the beginning and 251.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-30 00:57:56,996 INFO L168 Benchmark]: RCFGBuilder took 241.75 ms. Allocated memory is still 304.1 MB. Free memory was 251.2 MB in the beginning and 233.5 MB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 5.3 GB. [2018-01-30 00:57:56,996 INFO L168 Benchmark]: IcfgTransformer took 47680.61 ms. Allocated memory was 304.1 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 233.5 MB in the beginning and 1.1 GB in the end (delta: -892.7 MB). Peak memory consumption was 952.3 MB. Max. memory is 5.3 GB. [2018-01-30 00:57:56,997 INFO L168 Benchmark]: TraceAbstraction took 6543.01 ms. Allocated memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: 93.3 MB). Free memory was 1.1 GB in the beginning and 918.6 MB in the end (delta: 207.6 MB). Peak memory consumption was 300.9 MB. Max. memory is 5.3 GB. [2018-01-30 00:57:56,999 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.11 ms. Allocated memory is still 304.1 MB. Free memory is still 270.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 196.42 ms. Allocated memory is still 304.1 MB. Free memory was 263.1 MB in the beginning and 253.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 37.15 ms. Allocated memory is still 304.1 MB. Free memory was 253.2 MB in the beginning and 251.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 241.75 ms. Allocated memory is still 304.1 MB. Free memory was 251.2 MB in the beginning and 233.5 MB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 5.3 GB. * IcfgTransformer took 47680.61 ms. Allocated memory was 304.1 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 233.5 MB in the beginning and 1.1 GB in the end (delta: -892.7 MB). Peak memory consumption was 952.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 6543.01 ms. Allocated memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: 93.3 MB). Free memory was 1.1 GB in the beginning and 918.6 MB in the end (delta: 207.6 MB). Peak memory consumption was 300.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 55 LocStat_MAX_WEQGRAPH_SIZE : 3 LocStat_MAX_SIZEOF_WEQEDGELABEL : 3 LocStat_NO_SUPPORTING_EQUALITIES : 1131 LocStat_NO_SUPPORTING_DISEQUALITIES : 819 LocStat_NO_DISJUNCTIONS : -110 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 77 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 116 TransStat_NO_SUPPORTING_DISEQUALITIES : 9 TransStat_NO_DISJUNCTIONS : 79 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.299712 RENAME_VARIABLES(MILLISECONDS) : 0.009202 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.019976 PROJECTAWAY(MILLISECONDS) : 0.034200 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.054709 DISJOIN(MILLISECONDS) : 0.557922 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.018419 ADD_EQUALITY(MILLISECONDS) : 0.014838 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.064264 #CONJOIN_DISJUNCTIVE : 961 #RENAME_VARIABLES : 1979 #UNFREEZE : 0 #CONJOIN : 1144 #PROJECTAWAY : 999 #ADD_WEAK_EQUALITY : 8 #DISJOIN : 234 #RENAME_VARIABLES_DISJUNCTIVE : 1952 #ADD_EQUALITY : 118 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 8 * Results from de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: - StatisticsResult: HeapSeparatorStatistics #COUNT_NEW_ARRAY_VARS_[#memory_int] : 1 COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_0 : 2 COUNT_BLOCKS_for_[#memory_int]_at_dim_0 : 1 COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_1 : 2 COUNT_BLOCKS_for_[#memory_int]_at_dim_1 : 1 COUNT_ARRAY_READS for [#memory_int] : 4 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,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 - 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: 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 - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - InvariantResult [Line: 555]: Loop Invariant [2018-01-30 00:57:57,007 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:57,008 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:57,008 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:57,008 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:57,008 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:57,009 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:57,009 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-01-30 00:57:57,009 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-01-30 00:57:57,009 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:57,010 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:57,010 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:57,010 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:57,010 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:57,010 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:57,011 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:57,011 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:57,011 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:57,011 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:57,012 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:57,012 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:57,012 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:57,014 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:57,014 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:57,014 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:57,015 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:57,015 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:57,015 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:57,015 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-01-30 00:57:57,015 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-01-30 00:57:57,016 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:57,016 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:57,016 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:57,016 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:57,016 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:57,017 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:57,017 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:57,017 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:57,017 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:57,018 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:57,018 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:57,018 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:57,018 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((((((!(0 == arr) && \old(\valid) == \valid[__builtin_alloca (length*sizeof(int)) := 0]) && (\exists v_prenex_1 : int :: arr + 4 * v_prenex_1 + 4 <= unknown-#length-unknown[arr] && length <= v_prenex_1 + 1)) && __builtin_alloca (length*sizeof(int)) <= 0) && j == 0) && 4 * length == unknown-#length-unknown[arr]) && !(0 == __builtin_alloca (length*sizeof(int)))) && 1 == \valid[__builtin_alloca (length*sizeof(int))]) && 0 <= __builtin_alloca (length*sizeof(int))) && 1 == \valid[arr]) && 0 <= arr) && 1 <= i) && (\exists v_prenex_1 : int :: arr + 4 * v_prenex_1 + 4 <= unknown-#length-unknown[arr] && i <= v_prenex_1 + 1)) && 4 * length == unknown-#length-unknown[__builtin_alloca (length*sizeof(int))]) || ((((((((((((((!(0 == arr) && \old(\valid) == \valid[__builtin_alloca (length*sizeof(int)) := 0]) && (\exists v_prenex_1 : int :: arr + 4 * v_prenex_1 + 4 <= unknown-#length-unknown[arr] && length <= v_prenex_1 + 1)) && __builtin_alloca (length*sizeof(int)) <= 0) && 4 * length == unknown-#length-unknown[arr]) && !(0 == __builtin_alloca (length*sizeof(int)))) && 1 == \valid[__builtin_alloca (length*sizeof(int))]) && 0 <= __builtin_alloca (length*sizeof(int))) && (\exists v_prenex_2 : int :: v_prenex_2 + 1 <= j && 0 <= 4 * v_prenex_2 + arr)) && 1 == \valid[arr]) && 0 <= arr) && 1 <= i) && (\exists v_prenex_1 : int :: arr + 4 * v_prenex_1 + 4 <= unknown-#length-unknown[arr] && j <= v_prenex_1)) && (\exists v_prenex_1 : int :: arr + 4 * v_prenex_1 + 4 <= unknown-#length-unknown[arr] && i <= v_prenex_1 + 1)) && 4 * length == unknown-#length-unknown[__builtin_alloca (length*sizeof(int))]) - InvariantResult [Line: 554]: Loop Invariant [2018-01-30 00:57:57,020 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:57,020 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:57,020 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:57,020 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:57,021 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:57,021 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:57,021 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-01-30 00:57:57,021 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-01-30 00:57:57,022 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:57,022 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:57,022 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:57,022 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:57,022 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:57,023 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:57,023 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:57,023 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:57,023 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:57,023 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:57,025 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:57,025 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:57,025 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:57,026 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:57,026 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:57,026 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:57,026 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-01-30 00:57:57,027 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-01-30 00:57:57,027 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:57,027 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:57,027 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:57,027 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:57,028 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:57,028 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:57,028 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:57,028 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:57,028 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:57,029 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((((((!(0 == arr) && \old(\valid) == \valid[__builtin_alloca (length*sizeof(int)) := 0]) && (\exists v_prenex_1 : int :: arr + 4 * v_prenex_1 + 4 <= unknown-#length-unknown[arr] && length <= v_prenex_1 + 1)) && __builtin_alloca (length*sizeof(int)) <= 0) && j == 0) && 4 * length == unknown-#length-unknown[arr]) && !(0 == __builtin_alloca (length*sizeof(int)))) && 1 == \valid[__builtin_alloca (length*sizeof(int))]) && 0 <= __builtin_alloca (length*sizeof(int))) && 1 == \valid[arr]) && 0 <= arr) && 1 <= i) && (\exists v_prenex_1 : int :: arr + 4 * v_prenex_1 + 4 <= unknown-#length-unknown[arr] && i <= v_prenex_1 + 1)) && 4 * length == unknown-#length-unknown[__builtin_alloca (length*sizeof(int))]) || (((((((((((((!(0 == arr) && \old(\valid) == \valid[__builtin_alloca (length*sizeof(int)) := 0]) && (\exists v_prenex_1 : int :: arr + 4 * v_prenex_1 + 4 <= unknown-#length-unknown[arr] && length <= v_prenex_1 + 1)) && __builtin_alloca (length*sizeof(int)) <= 0) && 4 * length == unknown-#length-unknown[arr]) && !(0 == __builtin_alloca (length*sizeof(int)))) && 1 == \valid[__builtin_alloca (length*sizeof(int))]) && 0 <= __builtin_alloca (length*sizeof(int))) && (\exists v_prenex_2 : int :: v_prenex_2 + 1 <= j && 0 <= 4 * v_prenex_2 + arr)) && 1 == \valid[arr]) && 0 <= arr) && 1 <= i) && (\exists v_prenex_1 : int :: arr + 4 * v_prenex_1 + 4 <= unknown-#length-unknown[arr] && i <= v_prenex_1 + 1)) && 4 * length == unknown-#length-unknown[__builtin_alloca (length*sizeof(int))]) - InvariantResult [Line: 547]: Loop Invariant [2018-01-30 00:57:57,030 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:57,030 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:57,031 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:57,031 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:57,031 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:57,031 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:57,032 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:57,033 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:57,033 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:57:57,033 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:57,034 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:57,034 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:57,034 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 00:57:57,034 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((((arr <= 0 && !(0 == arr)) && \old(\valid) == \valid[__builtin_alloca (length*sizeof(int)) := 0]) && __builtin_alloca (length*sizeof(int)) <= 0) && 4 * length == unknown-#length-unknown[arr]) && !(0 == __builtin_alloca (length*sizeof(int)))) && 1 == \valid[__builtin_alloca (length*sizeof(int))]) && 0 <= __builtin_alloca (length*sizeof(int))) && 1 == \valid[arr]) && 0 <= arr) && 1 <= i) && (\exists v_prenex_1 : int :: arr + 4 * v_prenex_1 + 4 <= unknown-#length-unknown[arr] && i <= v_prenex_1 + 1)) && 4 * length == unknown-#length-unknown[__builtin_alloca (length*sizeof(int))]) || ((((((((((((arr <= 0 && !(0 == arr)) && \old(\valid) == \valid[__builtin_alloca (length*sizeof(int)) := 0]) && __builtin_alloca (length*sizeof(int)) <= 0) && 4 * length == unknown-#length-unknown[arr]) && !(0 == __builtin_alloca (length*sizeof(int)))) && 1 == \valid[__builtin_alloca (length*sizeof(int))]) && 0 <= __builtin_alloca (length*sizeof(int))) && 1 == \valid[arr]) && __builtin_alloca (length*sizeof(int)) + 4 <= 4 * length) && 0 <= arr) && 4 * length == unknown-#length-unknown[__builtin_alloca (length*sizeof(int))]) && i == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 64 locations, 9 error locations. SAFE Result, 6.4s OverallTime, 10 OverallIterations, 3 TraceHistogramMax, 2.7s AutomataDifference, 0.0s DeadEndRemovalTime, 1.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 508 SDtfs, 1474 SDslu, 2172 SDs, 0 SdLazy, 1161 SolverSat, 77 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 310 GetRequests, 161 SyntacticMatches, 2 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 887 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=7, 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, 10 MinimizatonAttempts, 75 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 28 NumberOfFragments, 532 HoareAnnotationTreeSize, 7 FomulaSimplifications, 3426 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 752 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 499 NumberOfCodeBlocks, 480 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 485 ConstructedInterpolants, 51 QuantifiedInterpolants, 160894 SizeOfPredicates, 24 NumberOfNonLiveVariables, 307 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 14 InterpolantComputations, 6 PerfectInterpolantSequences, 55/130 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/count_down-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-Benchmark-0-2018-01-30_00-57-57-040.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/count_down-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-VPDomainBenchmark-0-2018-01-30_00-57-57-040.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/count_down-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-BenchmarkWithCounters-0-2018-01-30_00-57-57-040.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/count_down-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-HeapSeparatorBenchmark-0-2018-01-30_00-57-57-040.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/count_down-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-30_00-57-57-040.csv Received shutdown request...