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/ldv-memsafety/ArraysOfVariableLength_true-valid-memsafety.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-acfac67 [2018-01-29 00:51:34,026 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-29 00:51:34,027 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-29 00:51:34,043 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-29 00:51:34,044 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-29 00:51:34,045 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-29 00:51:34,046 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-29 00:51:34,047 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-29 00:51:34,049 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-29 00:51:34,050 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-29 00:51:34,051 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-29 00:51:34,051 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-29 00:51:34,052 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-29 00:51:34,054 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-29 00:51:34,055 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-29 00:51:34,057 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-29 00:51:34,059 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-29 00:51:34,062 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-29 00:51:34,063 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-29 00:51:34,064 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-29 00:51:34,067 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-29 00:51:34,067 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-29 00:51:34,067 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-29 00:51:34,068 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-29 00:51:34,069 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-29 00:51:34,071 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-29 00:51:34,071 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-29 00:51:34,071 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-29 00:51:34,072 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-29 00:51:34,072 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-29 00:51:34,073 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-29 00:51:34,073 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-29 00:51:34,081 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-29 00:51:34,081 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-29 00:51:34,082 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-29 00:51:34,082 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-29 00:51:34,082 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-29 00:51:34,082 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-29 00:51:34,082 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-29 00:51:34,083 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-29 00:51:34,083 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-29 00:51:34,083 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-29 00:51:34,083 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-29 00:51:34,084 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-29 00:51:34,084 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-29 00:51:34,084 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-29 00:51:34,084 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-29 00:51:34,084 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-29 00:51:34,084 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-29 00:51:34,084 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-29 00:51:34,084 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-29 00:51:34,085 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-29 00:51:34,085 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-29 00:51:34,085 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-29 00:51:34,085 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-29 00:51:34,085 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-29 00:51:34,085 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-29 00:51:34,086 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-29 00:51:34,086 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-29 00:51:34,086 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-29 00:51:34,086 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-29 00:51:34,086 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-29 00:51:34,086 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-29 00:51:34,086 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-29 00:51:34,087 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-29 00:51:34,087 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-29 00:51:34,121 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-29 00:51:34,133 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-29 00:51:34,137 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-29 00:51:34,138 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-29 00:51:34,139 INFO L276 PluginConnector]: CDTParser initialized [2018-01-29 00:51:34,140 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength_true-valid-memsafety.c [2018-01-29 00:51:34,256 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-29 00:51:34,263 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-01-29 00:51:34,264 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-29 00:51:34,265 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-29 00:51:34,272 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-29 00:51:34,273 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 12:51:34" (1/1) ... [2018-01-29 00:51:34,277 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70501c9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 12:51:34, skipping insertion in model container [2018-01-29 00:51:34,277 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 12:51:34" (1/1) ... [2018-01-29 00:51:34,290 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 00:51:34,304 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 00:51:34,426 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 00:51:34,443 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 00:51:34,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 12:51:34 WrapperNode [2018-01-29 00:51:34,450 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-29 00:51:34,451 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-29 00:51:34,451 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-29 00:51:34,451 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-29 00:51:34,463 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 12:51:34" (1/1) ... [2018-01-29 00:51:34,463 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 12:51:34" (1/1) ... [2018-01-29 00:51:34,471 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 12:51:34" (1/1) ... [2018-01-29 00:51:34,471 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 12:51:34" (1/1) ... [2018-01-29 00:51:34,473 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 12:51:34" (1/1) ... [2018-01-29 00:51:34,477 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 12:51:34" (1/1) ... [2018-01-29 00:51:34,478 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 12:51:34" (1/1) ... [2018-01-29 00:51:34,481 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-29 00:51:34,482 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-29 00:51:34,482 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-29 00:51:34,482 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-29 00:51:34,483 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 12:51:34" (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-29 00:51:34,525 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-29 00:51:34,525 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-29 00:51:34,526 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-29 00:51:34,526 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-29 00:51:34,526 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-29 00:51:34,526 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-29 00:51:34,526 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-29 00:51:34,526 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-29 00:51:34,526 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-29 00:51:34,527 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-29 00:51:34,527 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-29 00:51:34,527 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-29 00:51:34,527 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-29 00:51:34,718 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-29 00:51:34,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 12:51:34 BoogieIcfgContainer [2018-01-29 00:51:34,719 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-29 00:51:34,719 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-01-29 00:51:34,719 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-01-29 00:51:34,720 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-01-29 00:51:34,723 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 12:51:34" (1/1) ... [2018-01-29 00:51:34,730 INFO L103 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-01-29 00:51:34,730 INFO L104 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-01-29 00:51:34,730 INFO L150 apSepIcfgTransformer]: starting freeze-var-style preprocessing [2018-01-29 00:51:34,786 INFO L218 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-01-29 00:51:34,841 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-29 00:51:41,905 INFO L311 AbstractInterpreter]: Visited 73 different actions 387 times. Merged at 47 different actions 210 times. Widened at 1 different actions 1 times. Found 19 fixpoints after 8 different actions. Largest state had 35 variables. [2018-01-29 00:51:41,908 INFO L226 apSepIcfgTransformer]: finished equality analysis [2018-01-29 00:51:41,919 INFO L244 HeapSepPreAnalysis]: Number of read from array group [#memory_int] : 3 [2018-01-29 00:51:41,920 INFO L238 apSepIcfgTransformer]: Finished pre analysis before partitioning [2018-01-29 00:51:41,920 INFO L239 apSepIcfgTransformer]: array groups: Set: [#memory_int] [2018-01-29 00:51:41,920 INFO L241 apSepIcfgTransformer]: select infos: Set: ((select (select |v_#memory_int_1| v_foo_~b.base_2) (+ (* 4 v_foo_~i~1_7) v_foo_~b.offset_2)), at (SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~1 * 4, 4); srcloc: L15')) ((select (select |v_#memory_int_4| |v_main_~#b~3.base_1|) (+ (* 4 v_main_~i~3_3) |v_main_~#b~3.offset_1|)), at (SUMMARY for call #t~mem6 := read~int(~#b~3.base, ~#b~3.offset + ~i~3 * 4, 4); srcloc: L26)) ((select |v_#memory_int_6| |v_main_~#b~3.base_10|), at (SUMMARY for call write~int(#t~ret3, ~#b~3.base, ~#b~3.offset + ~i~3 * 4, 4); srcloc: L23'')) [2018-01-29 00:51:41,924 INFO L544 PartitionManager]: partitioning result: [2018-01-29 00:51:41,924 INFO L549 PartitionManager]: location blocks for array group [#memory_int] [2018-01-29 00:51:41,925 INFO L558 PartitionManager]: at dimension 0 [2018-01-29 00:51:41,925 INFO L559 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-01-29 00:51:41,925 INFO L560 PartitionManager]: # location blocks :1 [2018-01-29 00:51:41,925 INFO L558 PartitionManager]: at dimension 1 [2018-01-29 00:51:41,925 INFO L559 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-01-29 00:51:41,925 INFO L560 PartitionManager]: # location blocks :1 [2018-01-29 00:51:41,926 INFO L86 ransitionTransformer]: executing heap partitioning transformation [2018-01-29 00:51:41,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 29.01 12:51:41 BasicIcfg [2018-01-29 00:51:41,943 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-01-29 00:51:41,944 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-29 00:51:41,945 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-29 00:51:41,948 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-29 00:51:41,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 12:51:34" (1/4) ... [2018-01-29 00:51:41,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d1b0fb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 12:51:41, skipping insertion in model container [2018-01-29 00:51:41,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 12:51:34" (2/4) ... [2018-01-29 00:51:41,950 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d1b0fb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 12:51:41, skipping insertion in model container [2018-01-29 00:51:41,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 12:51:34" (3/4) ... [2018-01-29 00:51:41,950 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d1b0fb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 12:51:41, skipping insertion in model container [2018-01-29 00:51:41,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 29.01 12:51:41" (4/4) ... [2018-01-29 00:51:41,952 INFO L107 eAbstractionObserver]: Analyzing ICFG HeapSeparatedIcfg [2018-01-29 00:51:41,959 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-29 00:51:41,965 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2018-01-29 00:51:42,064 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-29 00:51:42,064 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-29 00:51:42,064 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-29 00:51:42,064 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-29 00:51:42,064 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-29 00:51:42,064 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-29 00:51:42,064 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-29 00:51:42,065 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-29 00:51:42,065 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-29 00:51:42,075 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-01-29 00:51:42,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-29 00:51:42,080 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:51:42,081 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:51:42,081 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 00:51:42,084 INFO L82 PathProgramCache]: Analyzing trace with hash 504851325, now seen corresponding path program 1 times [2018-01-29 00:51:42,086 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:51:42,086 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:51:42,126 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:51:42,126 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 00:51:42,126 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:51:42,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:51:42,166 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:51:42,224 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-29 00:51:42,226 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 00:51:42,226 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-29 00:51:42,228 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-29 00:51:42,235 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-29 00:51:42,236 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 00:51:42,238 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 3 states. [2018-01-29 00:51:42,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:51:42,306 INFO L93 Difference]: Finished difference Result 117 states and 136 transitions. [2018-01-29 00:51:42,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-29 00:51:42,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-01-29 00:51:42,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:51:42,316 INFO L225 Difference]: With dead ends: 117 [2018-01-29 00:51:42,316 INFO L226 Difference]: Without dead ends: 59 [2018-01-29 00:51:42,320 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 00:51:42,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-29 00:51:42,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-01-29 00:51:42,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-29 00:51:42,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2018-01-29 00:51:42,354 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 10 [2018-01-29 00:51:42,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:51:42,354 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2018-01-29 00:51:42,354 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-29 00:51:42,354 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2018-01-29 00:51:42,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-29 00:51:42,355 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:51:42,355 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:51:42,356 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 00:51:42,356 INFO L82 PathProgramCache]: Analyzing trace with hash 504851327, now seen corresponding path program 1 times [2018-01-29 00:51:42,356 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:51:42,356 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:51:42,357 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:51:42,358 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 00:51:42,358 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:51:42,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:51:42,372 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:51:42,522 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-29 00:51:42,522 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 00:51:42,522 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 00:51:42,524 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 00:51:42,525 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 00:51:42,525 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-29 00:51:42,526 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand 4 states. [2018-01-29 00:51:42,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:51:42,622 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2018-01-29 00:51:42,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-29 00:51:42,623 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-01-29 00:51:42,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:51:42,626 INFO L225 Difference]: With dead ends: 98 [2018-01-29 00:51:42,627 INFO L226 Difference]: Without dead ends: 78 [2018-01-29 00:51:42,628 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-29 00:51:42,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-29 00:51:42,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 67. [2018-01-29 00:51:42,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-29 00:51:42,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2018-01-29 00:51:42,639 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 10 [2018-01-29 00:51:42,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:51:42,640 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2018-01-29 00:51:42,640 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 00:51:42,640 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2018-01-29 00:51:42,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-29 00:51:42,641 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:51:42,641 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:51:42,641 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 00:51:42,641 INFO L82 PathProgramCache]: Analyzing trace with hash -655754498, now seen corresponding path program 1 times [2018-01-29 00:51:42,641 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:51:42,642 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:51:42,643 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:51:42,643 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 00:51:42,643 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:51:42,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:51:42,653 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:51:42,697 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-29 00:51:42,697 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 00:51:42,697 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-29 00:51:42,698 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 00:51:42,698 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 00:51:42,698 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-29 00:51:42,698 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand 6 states. [2018-01-29 00:51:42,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:51:42,793 INFO L93 Difference]: Finished difference Result 146 states and 158 transitions. [2018-01-29 00:51:42,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 00:51:42,794 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-01-29 00:51:42,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:51:42,795 INFO L225 Difference]: With dead ends: 146 [2018-01-29 00:51:42,795 INFO L226 Difference]: Without dead ends: 91 [2018-01-29 00:51:42,796 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-01-29 00:51:42,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-29 00:51:42,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 78. [2018-01-29 00:51:42,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-29 00:51:42,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2018-01-29 00:51:42,805 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 17 [2018-01-29 00:51:42,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:51:42,805 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2018-01-29 00:51:42,805 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 00:51:42,805 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2018-01-29 00:51:42,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-29 00:51:42,806 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:51:42,806 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:51:42,806 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 00:51:42,807 INFO L82 PathProgramCache]: Analyzing trace with hash -381369184, now seen corresponding path program 1 times [2018-01-29 00:51:42,807 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:51:42,807 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:51:42,808 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:51:42,808 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 00:51:42,808 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:51:42,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:51:42,819 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:51:43,021 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 00:51:43,021 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:51:43,021 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-29 00:51:43,041 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 00:51:43,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:51:43,065 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:51:43,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 00:51:43,102 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 00:51:43,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 00:51:43,111 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 00:51:43,129 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 00:51:43,166 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 00:51:43,166 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-01-29 00:51:43,166 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 00:51:43,166 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 00:51:43,167 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-01-29 00:51:43,167 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand 6 states. [2018-01-29 00:51:43,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:51:43,337 INFO L93 Difference]: Finished difference Result 121 states and 132 transitions. [2018-01-29 00:51:43,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-29 00:51:43,338 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-29 00:51:43,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:51:43,339 INFO L225 Difference]: With dead ends: 121 [2018-01-29 00:51:43,339 INFO L226 Difference]: Without dead ends: 98 [2018-01-29 00:51:43,339 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-29 00:51:43,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-29 00:51:43,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 87. [2018-01-29 00:51:43,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-29 00:51:43,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2018-01-29 00:51:43,349 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 19 [2018-01-29 00:51:43,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:51:43,349 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2018-01-29 00:51:43,349 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 00:51:43,350 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2018-01-29 00:51:43,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-29 00:51:43,350 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:51:43,350 INFO L330 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] [2018-01-29 00:51:43,350 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 00:51:43,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1035815613, now seen corresponding path program 1 times [2018-01-29 00:51:43,351 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:51:43,351 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:51:43,351 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:51:43,352 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 00:51:43,352 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:51:43,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:51:43,362 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:51:43,405 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-29 00:51:43,406 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 00:51:43,406 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-29 00:51:43,406 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-29 00:51:43,407 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-29 00:51:43,407 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-29 00:51:43,407 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand 7 states. [2018-01-29 00:51:43,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:51:43,476 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2018-01-29 00:51:43,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-29 00:51:43,476 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-01-29 00:51:43,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:51:43,480 INFO L225 Difference]: With dead ends: 101 [2018-01-29 00:51:43,480 INFO L226 Difference]: Without dead ends: 100 [2018-01-29 00:51:43,480 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-01-29 00:51:43,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-01-29 00:51:43,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 90. [2018-01-29 00:51:43,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-01-29 00:51:43,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2018-01-29 00:51:43,491 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 26 [2018-01-29 00:51:43,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:51:43,492 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2018-01-29 00:51:43,492 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-29 00:51:43,492 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2018-01-29 00:51:43,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-29 00:51:43,493 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:51:43,493 INFO L330 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] [2018-01-29 00:51:43,494 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 00:51:43,494 INFO L82 PathProgramCache]: Analyzing trace with hash 2045513412, now seen corresponding path program 1 times [2018-01-29 00:51:43,494 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:51:43,494 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:51:43,495 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:51:43,495 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 00:51:43,496 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:51:43,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:51:43,505 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:51:43,555 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 00:51:43,555 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 00:51:43,556 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-29 00:51:43,556 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 00:51:43,556 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 00:51:43,556 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-29 00:51:43,556 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand 5 states. [2018-01-29 00:51:43,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:51:43,638 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2018-01-29 00:51:43,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-29 00:51:43,639 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-01-29 00:51:43,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:51:43,640 INFO L225 Difference]: With dead ends: 90 [2018-01-29 00:51:43,640 INFO L226 Difference]: Without dead ends: 89 [2018-01-29 00:51:43,640 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-29 00:51:43,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-01-29 00:51:43,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-01-29 00:51:43,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-29 00:51:43,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2018-01-29 00:51:43,650 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 27 [2018-01-29 00:51:43,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:51:43,651 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2018-01-29 00:51:43,651 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 00:51:43,651 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2018-01-29 00:51:43,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-29 00:51:43,652 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:51:43,652 INFO L330 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] [2018-01-29 00:51:43,652 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 00:51:43,653 INFO L82 PathProgramCache]: Analyzing trace with hash 2045513414, now seen corresponding path program 1 times [2018-01-29 00:51:43,653 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:51:43,653 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:51:43,654 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:51:43,654 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 00:51:43,654 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:51:43,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:51:43,665 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:51:43,748 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-29 00:51:43,748 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 00:51:43,748 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 00:51:43,749 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 00:51:43,749 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 00:51:43,749 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-29 00:51:43,749 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand 6 states. [2018-01-29 00:51:43,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:51:43,815 INFO L93 Difference]: Finished difference Result 98 states and 108 transitions. [2018-01-29 00:51:43,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 00:51:43,815 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-01-29 00:51:43,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:51:43,816 INFO L225 Difference]: With dead ends: 98 [2018-01-29 00:51:43,816 INFO L226 Difference]: Without dead ends: 97 [2018-01-29 00:51:43,816 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-01-29 00:51:43,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-01-29 00:51:43,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 90. [2018-01-29 00:51:43,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-01-29 00:51:43,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2018-01-29 00:51:43,823 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 27 [2018-01-29 00:51:43,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:51:43,823 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2018-01-29 00:51:43,823 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 00:51:43,823 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2018-01-29 00:51:43,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-29 00:51:43,824 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:51:43,824 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-01-29 00:51:43,824 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 00:51:43,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1719869599, now seen corresponding path program 2 times [2018-01-29 00:51:43,824 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:51:43,824 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:51:43,825 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:51:43,825 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 00:51:43,825 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:51:43,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:51:43,833 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:51:44,062 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 00:51:44,063 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:51:44,063 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-29 00:51:44,072 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 00:51:44,079 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:51:44,083 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:51:44,084 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 00:51:44,087 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:51:44,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 00:51:44,091 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 00:51:44,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 00:51:44,098 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 00:51:44,214 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 00:51:44,236 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-29 00:51:44,246 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 13 [2018-01-29 00:51:44,247 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-29 00:51:44,247 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-29 00:51:44,247 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-01-29 00:51:44,247 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand 14 states. [2018-01-29 00:51:44,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:51:44,506 INFO L93 Difference]: Finished difference Result 132 states and 147 transitions. [2018-01-29 00:51:44,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-29 00:51:44,507 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 28 [2018-01-29 00:51:44,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:51:44,508 INFO L225 Difference]: With dead ends: 132 [2018-01-29 00:51:44,508 INFO L226 Difference]: Without dead ends: 109 [2018-01-29 00:51:44,509 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2018-01-29 00:51:44,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-01-29 00:51:44,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 95. [2018-01-29 00:51:44,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-01-29 00:51:44,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2018-01-29 00:51:44,517 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 28 [2018-01-29 00:51:44,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:51:44,518 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2018-01-29 00:51:44,518 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-29 00:51:44,518 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2018-01-29 00:51:44,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-29 00:51:44,519 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:51:44,520 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:51:44,520 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 00:51:44,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1345344936, now seen corresponding path program 1 times [2018-01-29 00:51:44,520 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:51:44,520 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:51:44,521 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:51:44,521 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 00:51:44,521 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:51:44,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:51:44,531 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:51:44,595 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 00:51:44,595 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:51:44,595 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-29 00:51:44,619 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 00:51:44,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:51:44,634 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:51:44,701 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 00:51:44,721 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 00:51:44,721 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2018-01-29 00:51:44,722 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-29 00:51:44,722 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-29 00:51:44,722 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-01-29 00:51:44,722 INFO L87 Difference]: Start difference. First operand 95 states and 104 transitions. Second operand 15 states. [2018-01-29 00:51:44,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:51:44,895 INFO L93 Difference]: Finished difference Result 191 states and 207 transitions. [2018-01-29 00:51:44,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-29 00:51:44,896 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 35 [2018-01-29 00:51:44,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:51:44,897 INFO L225 Difference]: With dead ends: 191 [2018-01-29 00:51:44,897 INFO L226 Difference]: Without dead ends: 128 [2018-01-29 00:51:44,898 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2018-01-29 00:51:44,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-01-29 00:51:44,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 115. [2018-01-29 00:51:44,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-01-29 00:51:44,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2018-01-29 00:51:44,905 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 35 [2018-01-29 00:51:44,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:51:44,905 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2018-01-29 00:51:44,905 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-29 00:51:44,905 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2018-01-29 00:51:44,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-29 00:51:44,907 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:51:44,907 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-01-29 00:51:44,907 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 00:51:44,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1284297639, now seen corresponding path program 2 times [2018-01-29 00:51:44,908 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:51:44,908 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:51:44,909 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:51:44,909 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 00:51:44,909 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:51:44,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:51:44,920 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:51:45,030 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 00:51:45,030 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:51:45,030 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-29 00:51:45,035 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 00:51:45,043 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:51:45,047 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:51:45,048 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 00:51:45,050 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:51:45,161 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-29 00:51:45,181 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 00:51:45,182 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2018-01-29 00:51:45,182 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-29 00:51:45,182 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-29 00:51:45,182 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-01-29 00:51:45,183 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand 18 states. [2018-01-29 00:51:45,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:51:45,656 INFO L93 Difference]: Finished difference Result 143 states and 152 transitions. [2018-01-29 00:51:45,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-29 00:51:45,657 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 44 [2018-01-29 00:51:45,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:51:45,657 INFO L225 Difference]: With dead ends: 143 [2018-01-29 00:51:45,658 INFO L226 Difference]: Without dead ends: 142 [2018-01-29 00:51:45,658 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=269, Invalid=1137, Unknown=0, NotChecked=0, Total=1406 [2018-01-29 00:51:45,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-01-29 00:51:45,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 114. [2018-01-29 00:51:45,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-29 00:51:45,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2018-01-29 00:51:45,667 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 44 [2018-01-29 00:51:45,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:51:45,667 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2018-01-29 00:51:45,667 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-29 00:51:45,667 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2018-01-29 00:51:45,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-29 00:51:45,669 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:51:45,669 INFO L330 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:51:45,669 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 00:51:45,669 INFO L82 PathProgramCache]: Analyzing trace with hash -590319489, now seen corresponding path program 1 times [2018-01-29 00:51:45,669 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:51:45,669 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:51:45,670 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:51:45,670 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 00:51:45,670 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:51:45,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:51:45,679 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:51:45,728 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 00:51:45,728 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:51:45,728 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 00:51:45,745 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 00:51:45,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:51:45,758 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:51:45,774 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 00:51:45,794 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 00:51:45,794 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-01-29 00:51:45,794 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-29 00:51:45,795 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-29 00:51:45,795 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-01-29 00:51:45,795 INFO L87 Difference]: Start difference. First operand 114 states and 123 transitions. Second operand 11 states. [2018-01-29 00:51:45,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:51:45,906 INFO L93 Difference]: Finished difference Result 161 states and 176 transitions. [2018-01-29 00:51:45,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-29 00:51:45,906 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2018-01-29 00:51:45,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:51:45,907 INFO L225 Difference]: With dead ends: 161 [2018-01-29 00:51:45,908 INFO L226 Difference]: Without dead ends: 139 [2018-01-29 00:51:45,908 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2018-01-29 00:51:45,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-01-29 00:51:45,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 123. [2018-01-29 00:51:45,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-01-29 00:51:45,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 134 transitions. [2018-01-29 00:51:45,916 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 134 transitions. Word has length 44 [2018-01-29 00:51:45,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:51:45,917 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 134 transitions. [2018-01-29 00:51:45,917 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-29 00:51:45,917 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 134 transitions. [2018-01-29 00:51:45,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-29 00:51:45,918 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:51:45,919 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-01-29 00:51:45,919 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 00:51:45,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1158521628, now seen corresponding path program 1 times [2018-01-29 00:51:45,919 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:51:45,919 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:51:45,920 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:51:45,920 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 00:51:45,920 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:51:45,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:51:45,928 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:51:46,141 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-29 00:51:46,142 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:51:46,142 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 00:51:46,151 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 00:51:46,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:51:46,179 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:51:46,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 00:51:46,182 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 00:51:46,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 00:51:46,187 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 00:51:46,220 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-29 00:51:46,253 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 00:51:46,253 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-01-29 00:51:46,253 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-29 00:51:46,254 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-29 00:51:46,254 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-29 00:51:46,254 INFO L87 Difference]: Start difference. First operand 123 states and 134 transitions. Second operand 8 states. [2018-01-29 00:51:46,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:51:46,438 INFO L93 Difference]: Finished difference Result 146 states and 160 transitions. [2018-01-29 00:51:46,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-29 00:51:46,438 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2018-01-29 00:51:46,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:51:46,439 INFO L225 Difference]: With dead ends: 146 [2018-01-29 00:51:46,439 INFO L226 Difference]: Without dead ends: 145 [2018-01-29 00:51:46,439 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-01-29 00:51:46,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-01-29 00:51:46,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 132. [2018-01-29 00:51:46,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-01-29 00:51:46,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 144 transitions. [2018-01-29 00:51:46,446 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 144 transitions. Word has length 45 [2018-01-29 00:51:46,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:51:46,446 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 144 transitions. [2018-01-29 00:51:46,446 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-29 00:51:46,446 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 144 transitions. [2018-01-29 00:51:46,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-01-29 00:51:46,447 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:51:46,447 INFO L330 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:51:46,447 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 00:51:46,447 INFO L82 PathProgramCache]: Analyzing trace with hash 962085216, now seen corresponding path program 2 times [2018-01-29 00:51:46,447 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:51:46,447 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:51:46,448 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:51:46,448 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 00:51:46,448 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:51:46,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:51:46,454 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:51:46,538 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 00:51:46,539 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:51:46,539 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 00:51:46,545 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 00:51:46,551 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:51:46,552 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 00:51:46,554 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:51:46,596 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-01-29 00:51:46,629 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-29 00:51:46,629 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [11] total 14 [2018-01-29 00:51:46,630 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-29 00:51:46,630 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-29 00:51:46,630 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=139, Unknown=1, NotChecked=0, Total=182 [2018-01-29 00:51:46,630 INFO L87 Difference]: Start difference. First operand 132 states and 144 transitions. Second operand 14 states. [2018-01-29 00:51:46,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:51:46,978 INFO L93 Difference]: Finished difference Result 177 states and 197 transitions. [2018-01-29 00:51:46,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-29 00:51:46,979 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 53 [2018-01-29 00:51:46,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:51:46,980 INFO L225 Difference]: With dead ends: 177 [2018-01-29 00:51:46,980 INFO L226 Difference]: Without dead ends: 142 [2018-01-29 00:51:46,980 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=211, Invalid=544, Unknown=1, NotChecked=0, Total=756 [2018-01-29 00:51:46,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-01-29 00:51:46,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 132. [2018-01-29 00:51:46,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-01-29 00:51:46,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 145 transitions. [2018-01-29 00:51:46,989 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 145 transitions. Word has length 53 [2018-01-29 00:51:46,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:51:46,989 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 145 transitions. [2018-01-29 00:51:46,989 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-29 00:51:46,989 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 145 transitions. [2018-01-29 00:51:46,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-29 00:51:46,990 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:51:46,990 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2018-01-29 00:51:46,990 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 00:51:46,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1709919653, now seen corresponding path program 2 times [2018-01-29 00:51:46,990 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:51:46,990 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:51:46,991 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:51:46,991 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 00:51:46,991 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:51:46,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:51:47,000 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:51:47,154 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 00:51:47,154 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:51:47,154 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 00:51:47,160 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 00:51:47,167 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:51:47,173 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:51:47,174 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 00:51:47,177 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:51:47,278 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 17 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 00:51:47,311 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 00:51:47,312 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 21 [2018-01-29 00:51:47,312 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-29 00:51:47,312 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-29 00:51:47,312 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2018-01-29 00:51:47,312 INFO L87 Difference]: Start difference. First operand 132 states and 145 transitions. Second operand 21 states. [2018-01-29 00:51:47,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:51:47,700 INFO L93 Difference]: Finished difference Result 245 states and 268 transitions. [2018-01-29 00:51:47,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-29 00:51:47,700 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 54 [2018-01-29 00:51:47,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:51:47,701 INFO L225 Difference]: With dead ends: 245 [2018-01-29 00:51:47,701 INFO L226 Difference]: Without dead ends: 174 [2018-01-29 00:51:47,702 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=198, Invalid=992, Unknown=0, NotChecked=0, Total=1190 [2018-01-29 00:51:47,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-01-29 00:51:47,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 161. [2018-01-29 00:51:47,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-01-29 00:51:47,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 175 transitions. [2018-01-29 00:51:47,713 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 175 transitions. Word has length 54 [2018-01-29 00:51:47,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:51:47,713 INFO L432 AbstractCegarLoop]: Abstraction has 161 states and 175 transitions. [2018-01-29 00:51:47,713 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-29 00:51:47,713 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 175 transitions. [2018-01-29 00:51:47,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-01-29 00:51:47,714 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:51:47,714 INFO L330 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:51:47,714 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 00:51:47,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1276102330, now seen corresponding path program 3 times [2018-01-29 00:51:47,714 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:51:47,714 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:51:47,715 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:51:47,715 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 00:51:47,715 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:51:47,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:51:47,724 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:51:47,985 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-01-29 00:51:47,985 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:51:47,985 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 00:51:47,995 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 00:51:48,003 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 00:51:48,006 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 00:51:48,007 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 00:51:48,010 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:51:48,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 00:51:48,014 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 00:51:48,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 00:51:48,018 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 00:51:48,243 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-01-29 00:51:48,265 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 00:51:48,265 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 21 [2018-01-29 00:51:48,265 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-29 00:51:48,265 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-29 00:51:48,266 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2018-01-29 00:51:48,266 INFO L87 Difference]: Start difference. First operand 161 states and 175 transitions. Second operand 22 states. [2018-01-29 00:51:48,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:51:48,683 INFO L93 Difference]: Finished difference Result 180 states and 196 transitions. [2018-01-29 00:51:48,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-29 00:51:48,683 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 63 [2018-01-29 00:51:48,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:51:48,685 INFO L225 Difference]: With dead ends: 180 [2018-01-29 00:51:48,685 INFO L226 Difference]: Without dead ends: 179 [2018-01-29 00:51:48,686 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=234, Invalid=822, Unknown=0, NotChecked=0, Total=1056 [2018-01-29 00:51:48,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-01-29 00:51:48,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 147. [2018-01-29 00:51:48,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-01-29 00:51:48,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 159 transitions. [2018-01-29 00:51:48,700 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 159 transitions. Word has length 63 [2018-01-29 00:51:48,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:51:48,700 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 159 transitions. [2018-01-29 00:51:48,700 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-29 00:51:48,701 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 159 transitions. [2018-01-29 00:51:48,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-01-29 00:51:48,702 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:51:48,702 INFO L330 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:51:48,702 INFO L371 AbstractCegarLoop]: === Iteration 16 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 00:51:48,702 INFO L82 PathProgramCache]: Analyzing trace with hash -201655845, now seen corresponding path program 1 times [2018-01-29 00:51:48,702 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:51:48,703 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:51:48,703 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:51:48,703 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 00:51:48,704 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:51:48,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:51:48,712 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:51:48,821 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-29 00:51:48,821 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:51:48,821 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 00:51:48,826 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 00:51:48,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:51:48,841 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:51:48,864 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-29 00:51:48,884 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 00:51:48,884 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2018-01-29 00:51:48,884 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-29 00:51:48,885 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-29 00:51:48,885 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-01-29 00:51:48,885 INFO L87 Difference]: Start difference. First operand 147 states and 159 transitions. Second operand 15 states. [2018-01-29 00:51:49,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:51:49,089 INFO L93 Difference]: Finished difference Result 179 states and 196 transitions. [2018-01-29 00:51:49,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-29 00:51:49,092 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 64 [2018-01-29 00:51:49,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:51:49,093 INFO L225 Difference]: With dead ends: 179 [2018-01-29 00:51:49,093 INFO L226 Difference]: Without dead ends: 166 [2018-01-29 00:51:49,094 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=196, Invalid=404, Unknown=0, NotChecked=0, Total=600 [2018-01-29 00:51:49,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-01-29 00:51:49,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 156. [2018-01-29 00:51:49,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-01-29 00:51:49,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 170 transitions. [2018-01-29 00:51:49,111 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 170 transitions. Word has length 64 [2018-01-29 00:51:49,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:51:49,112 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 170 transitions. [2018-01-29 00:51:49,112 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-29 00:51:49,112 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 170 transitions. [2018-01-29 00:51:49,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-01-29 00:51:49,113 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:51:49,113 INFO L330 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:51:49,114 INFO L371 AbstractCegarLoop]: === Iteration 17 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 00:51:49,114 INFO L82 PathProgramCache]: Analyzing trace with hash 552243260, now seen corresponding path program 2 times [2018-01-29 00:51:49,114 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:51:49,114 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:51:49,115 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:51:49,115 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 00:51:49,115 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:51:49,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:51:49,125 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:51:49,269 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-29 00:51:49,270 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:51:49,280 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 00:51:49,285 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 00:51:49,292 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:51:49,299 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:51:49,301 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 00:51:49,303 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:51:49,324 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-29 00:51:49,345 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 00:51:49,345 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2018-01-29 00:51:49,346 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-29 00:51:49,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-29 00:51:49,346 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-01-29 00:51:49,346 INFO L87 Difference]: Start difference. First operand 156 states and 170 transitions. Second operand 17 states. [2018-01-29 00:51:49,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:51:49,540 INFO L93 Difference]: Finished difference Result 188 states and 207 transitions. [2018-01-29 00:51:49,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-29 00:51:49,541 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 73 [2018-01-29 00:51:49,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:51:49,542 INFO L225 Difference]: With dead ends: 188 [2018-01-29 00:51:49,542 INFO L226 Difference]: Without dead ends: 175 [2018-01-29 00:51:49,543 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=263, Invalid=549, Unknown=0, NotChecked=0, Total=812 [2018-01-29 00:51:49,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-01-29 00:51:49,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 165. [2018-01-29 00:51:49,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-01-29 00:51:49,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 181 transitions. [2018-01-29 00:51:49,553 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 181 transitions. Word has length 73 [2018-01-29 00:51:49,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:51:49,553 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 181 transitions. [2018-01-29 00:51:49,553 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-29 00:51:49,553 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 181 transitions. [2018-01-29 00:51:49,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-01-29 00:51:49,554 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:51:49,554 INFO L330 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 7, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:51:49,554 INFO L371 AbstractCegarLoop]: === Iteration 18 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 00:51:49,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1460168965, now seen corresponding path program 3 times [2018-01-29 00:51:49,555 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:51:49,555 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:51:49,555 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:51:49,555 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 00:51:49,555 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:51:49,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:51:49,564 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:51:49,774 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 203 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-29 00:51:49,774 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:51:49,775 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 00:51:49,782 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 00:51:49,789 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 00:51:49,792 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 00:51:49,793 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 00:51:49,795 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:51:49,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 00:51:49,805 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 00:51:49,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 00:51:49,808 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 00:51:49,897 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-01-29 00:51:49,931 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-29 00:51:49,932 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [17] total 22 [2018-01-29 00:51:49,932 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-29 00:51:49,932 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-29 00:51:49,932 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2018-01-29 00:51:49,932 INFO L87 Difference]: Start difference. First operand 165 states and 181 transitions. Second operand 22 states. [2018-01-29 00:51:50,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:51:50,553 INFO L93 Difference]: Finished difference Result 196 states and 218 transitions. [2018-01-29 00:51:50,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-01-29 00:51:50,553 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 82 [2018-01-29 00:51:50,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:51:50,554 INFO L225 Difference]: With dead ends: 196 [2018-01-29 00:51:50,554 INFO L226 Difference]: Without dead ends: 0 [2018-01-29 00:51:50,555 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 659 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=668, Invalid=2088, Unknown=0, NotChecked=0, Total=2756 [2018-01-29 00:51:50,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-29 00:51:50,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-29 00:51:50,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-29 00:51:50,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-29 00:51:50,555 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 82 [2018-01-29 00:51:50,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:51:50,555 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-29 00:51:50,555 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-29 00:51:50,555 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-29 00:51:50,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-29 00:51:50,559 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-29 00:51:51,105 WARN L146 SmtUtils]: Spent 342ms on a formula simplification. DAG size of input: 64 DAG size of output 23 [2018-01-29 00:51:52,020 WARN L146 SmtUtils]: Spent 845ms on a formula simplification. DAG size of input: 78 DAG size of output 62 [2018-01-29 00:51:52,150 INFO L399 ceAbstractionStarter]: For program point L1(lines 1 31) no Hoare annotation was computed. [2018-01-29 00:51:52,150 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 31) no Hoare annotation was computed. [2018-01-29 00:51:52,150 INFO L395 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 31) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-29 00:51:52,150 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 31) no Hoare annotation was computed. [2018-01-29 00:51:52,151 INFO L399 ceAbstractionStarter]: For program point fooFINAL(lines 12 18) no Hoare annotation was computed. [2018-01-29 00:51:52,151 INFO L399 ceAbstractionStarter]: For program point L14'''''''(lines 14 16) no Hoare annotation was computed. [2018-01-29 00:51:52,151 INFO L399 ceAbstractionStarter]: For program point L14'''(lines 14 16) no Hoare annotation was computed. [2018-01-29 00:51:52,151 INFO L399 ceAbstractionStarter]: For program point fooEXIT(lines 12 18) no Hoare annotation was computed. [2018-01-29 00:51:52,151 INFO L399 ceAbstractionStarter]: For program point L14'''''(line 14) no Hoare annotation was computed. [2018-01-29 00:51:52,151 INFO L399 ceAbstractionStarter]: For program point L14''''(line 14) no Hoare annotation was computed. [2018-01-29 00:51:52,151 INFO L402 ceAbstractionStarter]: At program point fooENTRY(lines 12 18) the Hoare annotation is: true [2018-01-29 00:51:52,151 INFO L399 ceAbstractionStarter]: For program point L12(lines 12 18) no Hoare annotation was computed. [2018-01-29 00:51:52,151 INFO L399 ceAbstractionStarter]: For program point fooErr2RequiresViolation(lines 1 31) no Hoare annotation was computed. [2018-01-29 00:51:52,151 INFO L399 ceAbstractionStarter]: For program point L15'''(line 15) no Hoare annotation was computed. [2018-01-29 00:51:52,151 INFO L399 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2018-01-29 00:51:52,151 INFO L399 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2018-01-29 00:51:52,151 INFO L399 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2018-01-29 00:51:52,151 INFO L399 ceAbstractionStarter]: For program point fooErr1RequiresViolation(lines 1 31) no Hoare annotation was computed. [2018-01-29 00:51:52,151 INFO L399 ceAbstractionStarter]: For program point L15'(line 15) no Hoare annotation was computed. [2018-01-29 00:51:52,152 INFO L399 ceAbstractionStarter]: For program point L15''(line 15) no Hoare annotation was computed. [2018-01-29 00:51:52,152 INFO L399 ceAbstractionStarter]: For program point L12'(lines 12 18) no Hoare annotation was computed. [2018-01-29 00:51:52,152 INFO L399 ceAbstractionStarter]: For program point L13'(line 13) no Hoare annotation was computed. [2018-01-29 00:51:52,152 INFO L399 ceAbstractionStarter]: For program point L14'(lines 14 16) no Hoare annotation was computed. [2018-01-29 00:51:52,152 INFO L399 ceAbstractionStarter]: For program point fooErr0AssertViolation(line 15) no Hoare annotation was computed. [2018-01-29 00:51:52,152 INFO L395 ceAbstractionStarter]: At program point L14''''''(lines 14 16) the Hoare annotation is: (let ((.cse0 (not (= 0 |foo_#in~b.offset|))) (.cse4 (= foo_~i~1 0)) (.cse1 (not (= (select |#valid| |foo_#in~b.base|) 1))) (.cse2 (not (= 400 (select |#length| |foo_#in~b.base|)))) (.cse3 (< |foo_#in~n| |foo_#in~size|))) (and (or .cse0 (and (<= foo_~size 1) (<= foo_~i~1 1)) .cse1 .cse2 (< 1 |foo_#in~size|) .cse3) (or .cse0 .cse1 (not (= 0 |foo_#in~size|)) (and (= foo_~size 0) .cse4) .cse2 .cse3) (or .cse0 (< |foo_#in~n| 2) .cse1 (and (<= 2 foo_~n) (<= foo_~size 2)) .cse2 (< 2 |foo_#in~size|)) (let ((.cse5 (<= foo_~size 99)) (.cse8 (<= |foo_#in~size| foo_~n)) (.cse6 (= 1 (select |#valid| foo_~b.base))) (.cse7 (= (select |#length| foo_~b.base) 400)) (.cse9 (= foo_~b.offset 0)) (.cse10 (<= foo_~size foo_~n))) (or .cse0 (< 99 |foo_#in~size|) (and .cse5 (and .cse6 .cse7 .cse8 .cse9 (<= 1 foo_~i~1) .cse10)) (and .cse5 .cse8 .cse6 .cse7 .cse9 .cse10 .cse4) .cse1 .cse2 .cse3)))) [2018-01-29 00:51:52,152 INFO L402 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 31) the Hoare annotation is: true [2018-01-29 00:51:52,152 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 31) no Hoare annotation was computed. [2018-01-29 00:51:52,152 INFO L402 ceAbstractionStarter]: At program point L1(lines 1 31) the Hoare annotation is: true [2018-01-29 00:51:52,152 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 31) no Hoare annotation was computed. [2018-01-29 00:51:52,152 INFO L395 ceAbstractionStarter]: At program point L22'''''(lines 22 24) the Hoare annotation is: (let ((.cse0 (= |#valid| (store |old(#valid)| |main_~#b~3.base| 1))) (.cse1 (= 0 |main_~#b~3.offset|)) (.cse2 (= (select |#length| |main_~#b~3.base|) 400)) (.cse3 (= 0 (select |old(#valid)| |main_~#b~3.base|)))) (or (and .cse0 .cse1 .cse2 (= main_~i~3 0) .cse3) (and (<= 1 main_~i~3) .cse0 .cse1 .cse2 .cse3))) [2018-01-29 00:51:52,153 INFO L395 ceAbstractionStarter]: At program point L25'''''(lines 25 29) the Hoare annotation is: (let ((.cse0 (= |#valid| (store |old(#valid)| |main_~#b~3.base| 1))) (.cse1 (= 0 |main_~#b~3.offset|)) (.cse2 (= (select |#length| |main_~#b~3.base|) 400)) (.cse3 (= 0 (select |old(#valid)| |main_~#b~3.base|)))) (or (and (<= 1 main_~i~3) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (= main_~i~3 0) .cse3))) [2018-01-29 00:51:52,153 INFO L399 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 31) no Hoare annotation was computed. [2018-01-29 00:51:52,153 INFO L399 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2018-01-29 00:51:52,153 INFO L395 ceAbstractionStarter]: At program point L23(line 23) the Hoare annotation is: (let ((.cse0 (= |#valid| (store |old(#valid)| |main_~#b~3.base| 1))) (.cse1 (= 0 |main_~#b~3.offset|)) (.cse2 (= (select |#length| |main_~#b~3.base|) 400)) (.cse3 (= 0 (select |old(#valid)| |main_~#b~3.base|)))) (or (and .cse0 .cse1 .cse2 (= main_~i~3 0) .cse3) (and (<= 1 main_~i~3) .cse0 .cse1 .cse2 .cse3 (<= main_~i~3 99)))) [2018-01-29 00:51:52,153 INFO L399 ceAbstractionStarter]: For program point L22(lines 22 24) no Hoare annotation was computed. [2018-01-29 00:51:52,153 INFO L399 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 31) no Hoare annotation was computed. [2018-01-29 00:51:52,153 INFO L399 ceAbstractionStarter]: For program point L25(lines 25 29) no Hoare annotation was computed. [2018-01-29 00:51:52,153 INFO L399 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-01-29 00:51:52,153 INFO L399 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2018-01-29 00:51:52,153 INFO L399 ceAbstractionStarter]: For program point L25'''(line 25) no Hoare annotation was computed. [2018-01-29 00:51:52,153 INFO L399 ceAbstractionStarter]: For program point L23'''(line 23) no Hoare annotation was computed. [2018-01-29 00:51:52,153 INFO L399 ceAbstractionStarter]: For program point mainErr2RequiresViolation(lines 1 31) no Hoare annotation was computed. [2018-01-29 00:51:52,153 INFO L399 ceAbstractionStarter]: For program point L25''''''(lines 25 29) no Hoare annotation was computed. [2018-01-29 00:51:52,153 INFO L399 ceAbstractionStarter]: For program point L23'(line 23) no Hoare annotation was computed. [2018-01-29 00:51:52,154 INFO L399 ceAbstractionStarter]: For program point L21'''''(line 21) no Hoare annotation was computed. [2018-01-29 00:51:52,154 INFO L399 ceAbstractionStarter]: For program point L21'''(line 21) no Hoare annotation was computed. [2018-01-29 00:51:52,154 INFO L399 ceAbstractionStarter]: For program point L21'(line 21) no Hoare annotation was computed. [2018-01-29 00:51:52,154 INFO L399 ceAbstractionStarter]: For program point L22''''''(lines 22 24) no Hoare annotation was computed. [2018-01-29 00:51:52,154 INFO L399 ceAbstractionStarter]: For program point mainErr3RequiresViolation(lines 1 31) no Hoare annotation was computed. [2018-01-29 00:51:52,154 INFO L399 ceAbstractionStarter]: For program point L25''''(line 25) no Hoare annotation was computed. [2018-01-29 00:51:52,154 INFO L399 ceAbstractionStarter]: For program point mainFINAL(lines 20 31) no Hoare annotation was computed. [2018-01-29 00:51:52,154 INFO L399 ceAbstractionStarter]: For program point L25''(lines 25 29) no Hoare annotation was computed. [2018-01-29 00:51:52,154 INFO L399 ceAbstractionStarter]: For program point L22''(lines 22 24) no Hoare annotation was computed. [2018-01-29 00:51:52,154 INFO L399 ceAbstractionStarter]: For program point L23''(line 23) no Hoare annotation was computed. [2018-01-29 00:51:52,154 INFO L399 ceAbstractionStarter]: For program point mainErr4EnsuresViolation(lines 20 31) no Hoare annotation was computed. [2018-01-29 00:51:52,154 INFO L399 ceAbstractionStarter]: For program point L21''(line 21) no Hoare annotation was computed. [2018-01-29 00:51:52,154 INFO L399 ceAbstractionStarter]: For program point mainEXIT(lines 20 31) no Hoare annotation was computed. [2018-01-29 00:51:52,155 INFO L395 ceAbstractionStarter]: At program point mainENTRY(lines 20 31) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-29 00:51:52,155 INFO L399 ceAbstractionStarter]: For program point L22''''(line 22) no Hoare annotation was computed. [2018-01-29 00:51:52,155 INFO L399 ceAbstractionStarter]: For program point L22'''(line 22) no Hoare annotation was computed. [2018-01-29 00:51:52,155 INFO L399 ceAbstractionStarter]: For program point L26'(line 26) no Hoare annotation was computed. [2018-01-29 00:51:52,155 INFO L399 ceAbstractionStarter]: For program point L26''(line 26) no Hoare annotation was computed. [2018-01-29 00:51:52,155 INFO L399 ceAbstractionStarter]: For program point L21''''(line 21) no Hoare annotation was computed. [2018-01-29 00:51:52,155 INFO L399 ceAbstractionStarter]: For program point L26'''(line 26) no Hoare annotation was computed. [2018-01-29 00:51:52,161 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 00:51:52,162 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 00:51:52,165 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 00:51:52,165 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 00:51:52,170 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 00:51:52,170 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 00:51:52,170 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 00:51:52,170 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 00:51:52,171 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 00:51:52,171 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 00:51:52,174 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 00:51:52,175 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 00:51:52,175 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 00:51:52,175 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 00:51:52,175 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 00:51:52,175 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 00:51:52,176 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 00:51:52,177 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 00:51:52,178 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 00:51:52,178 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 00:51:52,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 12:51:52 BasicIcfg [2018-01-29 00:51:52,180 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-29 00:51:52,181 INFO L168 Benchmark]: Toolchain (without parser) took 17924.63 ms. Allocated memory was 305.1 MB in the beginning and 1.2 GB in the end (delta: 846.2 MB). Free memory was 266.0 MB in the beginning and 582.7 MB in the end (delta: -316.7 MB). Peak memory consumption was 529.5 MB. Max. memory is 5.3 GB. [2018-01-29 00:51:52,182 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 305.1 MB. Free memory is still 271.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-29 00:51:52,183 INFO L168 Benchmark]: CACSL2BoogieTranslator took 186.11 ms. Allocated memory is still 305.1 MB. Free memory was 265.0 MB in the beginning and 257.0 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. [2018-01-29 00:51:52,183 INFO L168 Benchmark]: Boogie Preprocessor took 30.31 ms. Allocated memory is still 305.1 MB. Free memory was 257.0 MB in the beginning and 256.0 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. [2018-01-29 00:51:52,183 INFO L168 Benchmark]: RCFGBuilder took 237.18 ms. Allocated memory is still 305.1 MB. Free memory was 255.0 MB in the beginning and 236.9 MB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 5.3 GB. [2018-01-29 00:51:52,184 INFO L168 Benchmark]: IcfgTransformer took 7224.42 ms. Allocated memory was 305.1 MB in the beginning and 907.0 MB in the end (delta: 601.9 MB). Free memory was 236.9 MB in the beginning and 467.8 MB in the end (delta: -230.8 MB). Peak memory consumption was 371.1 MB. Max. memory is 5.3 GB. [2018-01-29 00:51:52,184 INFO L168 Benchmark]: TraceAbstraction took 10235.95 ms. Allocated memory was 907.0 MB in the beginning and 1.2 GB in the end (delta: 244.3 MB). Free memory was 467.8 MB in the beginning and 582.7 MB in the end (delta: -115.0 MB). Peak memory consumption was 129.4 MB. Max. memory is 5.3 GB. [2018-01-29 00:51:52,186 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.13 ms. Allocated memory is still 305.1 MB. Free memory is still 271.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 186.11 ms. Allocated memory is still 305.1 MB. Free memory was 265.0 MB in the beginning and 257.0 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 30.31 ms. Allocated memory is still 305.1 MB. Free memory was 257.0 MB in the beginning and 256.0 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. * RCFGBuilder took 237.18 ms. Allocated memory is still 305.1 MB. Free memory was 255.0 MB in the beginning and 236.9 MB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 5.3 GB. * IcfgTransformer took 7224.42 ms. Allocated memory was 305.1 MB in the beginning and 907.0 MB in the end (delta: 601.9 MB). Free memory was 236.9 MB in the beginning and 467.8 MB in the end (delta: -230.8 MB). Peak memory consumption was 371.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 10235.95 ms. Allocated memory was 907.0 MB in the beginning and 1.2 GB in the end (delta: 244.3 MB). Free memory was 467.8 MB in the beginning and 582.7 MB in the end (delta: -115.0 MB). Peak memory consumption was 129.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 60 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 666 LocStat_NO_SUPPORTING_DISEQUALITIES : 343 LocStat_NO_DISJUNCTIONS : -120 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 82 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 96 TransStat_NO_SUPPORTING_DISEQUALITIES : 9 TransStat_NO_DISJUNCTIONS : 83 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.733206 RENAME_VARIABLES(MILLISECONDS) : 0.177512 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.700048 PROJECTAWAY(MILLISECONDS) : 0.306036 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.107104 DISJOIN(MILLISECONDS) : 0.198786 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.198989 ADD_EQUALITY(MILLISECONDS) : 0.037497 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.050351 #CONJOIN_DISJUNCTIVE : 592 #RENAME_VARIABLES : 1314 #UNFREEZE : 0 #CONJOIN : 842 #PROJECTAWAY : 780 #ADD_WEAK_EQUALITY : 8 #DISJOIN : 156 #RENAME_VARIABLES_DISJUNCTIVE : 1298 #ADD_EQUALITY : 97 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 6 * Results from de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: - StatisticsResult: HeapSeparatorStatistics COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_0 : 1 COUNT_BLOCKS_for_[#memory_int]_at_dim_0 : 1 COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_1 : 1 COUNT_BLOCKS_for_[#memory_int]_at_dim_1 : 1 COUNT_ARRAY_READS for [#memory_int] : 3 * Results from de.uni_freiburg.informatik.ultimate.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 * 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: 15]: array index is always in bounds For all program executions holds that array index is always in bounds 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: 20]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant [2018-01-29 00:51:52,192 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 00:51:52,192 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 00:51:52,193 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 00:51:52,194 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((1 <= i && \valid == \old(\valid)[b := 1]) && 0 == b) && unknown-#length-unknown[b] == 400) && 0 == \old(\valid)[b]) || ((((\valid == \old(\valid)[b := 1] && 0 == b) && unknown-#length-unknown[b] == 400) && i == 0) && 0 == \old(\valid)[b]) - InvariantResult [Line: 14]: Loop Invariant [2018-01-29 00:51:52,196 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 00:51:52,196 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 00:51:52,196 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 00:51:52,197 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 00:51:52,197 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 00:51:52,197 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 00:51:52,200 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 00:51:52,200 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 00:51:52,200 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 00:51:52,200 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 00:51:52,200 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 00:51:52,201 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((!(0 == b) || (size <= 1 && i <= 1)) || !(\valid[b] == 1)) || !(400 == unknown-#length-unknown[b])) || 1 < \old(size)) || \old(n) < \old(size)) && (((((!(0 == b) || !(\valid[b] == 1)) || !(0 == \old(size))) || (size == 0 && i == 0)) || !(400 == unknown-#length-unknown[b])) || \old(n) < \old(size))) && (((((!(0 == b) || \old(n) < 2) || !(\valid[b] == 1)) || (2 <= n && size <= 2)) || !(400 == unknown-#length-unknown[b])) || 2 < \old(size))) && ((((((!(0 == b) || 99 < \old(size)) || (size <= 99 && ((((1 == \valid[b] && unknown-#length-unknown[b] == 400) && \old(size) <= n) && b == 0) && 1 <= i) && size <= n)) || ((((((size <= 99 && \old(size) <= n) && 1 == \valid[b]) && unknown-#length-unknown[b] == 400) && b == 0) && size <= n) && i == 0)) || !(\valid[b] == 1)) || !(400 == unknown-#length-unknown[b])) || \old(n) < \old(size)) - InvariantResult [Line: 22]: Loop Invariant [2018-01-29 00:51:52,202 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 00:51:52,202 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 00:51:52,203 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 00:51:52,203 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((\valid == \old(\valid)[b := 1] && 0 == b) && unknown-#length-unknown[b] == 400) && i == 0) && 0 == \old(\valid)[b]) || ((((1 <= i && \valid == \old(\valid)[b := 1]) && 0 == b) && unknown-#length-unknown[b] == 400) && 0 == \old(\valid)[b]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 64 locations, 8 error locations. SAFE Result, 10.1s OverallTime, 18 OverallIterations, 8 TraceHistogramMax, 4.0s AutomataDifference, 0.0s DeadEndRemovalTime, 1.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 944 SDtfs, 1594 SDslu, 4608 SDs, 0 SdLazy, 2852 SolverSat, 234 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 899 GetRequests, 562 SyntacticMatches, 10 SemanticMatches, 327 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1857 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=165occurred in iteration=17, 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.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 211 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 35 PreInvPairs, 61 NumberOfFragments, 328 HoareAnnotationTreeSize, 35 FomulaSimplifications, 1278 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 9 FomulaSimplificationsInter, 5280 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 1325 NumberOfCodeBlocks, 1208 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 1295 ConstructedInterpolants, 8 QuantifiedInterpolants, 374676 SizeOfPredicates, 73 NumberOfNonLiveVariables, 1009 ConjunctsInSsa, 133 ConjunctsInUnsatCore, 30 InterpolantComputations, 9 PerfectInterpolantSequences, 478/1421 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/ArraysOfVariableLength_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-Benchmark-0-2018-01-29_00-51-52-209.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-VPDomainBenchmark-0-2018-01-29_00-51-52-209.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-BenchmarkWithCounters-0-2018-01-29_00-51-52-209.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-HeapSeparatorBenchmark-0-2018-01-29_00-51-52-209.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-29_00-51-52-209.csv Received shutdown request...