java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/array-memsafety/strreplace-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-30 01:20:44,359 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 01:20:44,388 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 01:20:44,400 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 01:20:44,401 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 01:20:44,401 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 01:20:44,403 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 01:20:44,404 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 01:20:44,406 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 01:20:44,407 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 01:20:44,408 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 01:20:44,408 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 01:20:44,409 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 01:20:44,410 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 01:20:44,411 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 01:20:44,413 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 01:20:44,416 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 01:20:44,418 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 01:20:44,419 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 01:20:44,420 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 01:20:44,422 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 01:20:44,423 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 01:20:44,423 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 01:20:44,424 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 01:20:44,425 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 01:20:44,426 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 01:20:44,426 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 01:20:44,427 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 01:20:44,427 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 01:20:44,427 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 01:20:44,428 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 01:20:44,428 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-30 01:20:44,438 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 01:20:44,438 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 01:20:44,439 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 01:20:44,439 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 01:20:44,439 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 01:20:44,440 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 01:20:44,440 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 01:20:44,440 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 01:20:44,441 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 01:20:44,441 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-30 01:20:44,441 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 01:20:44,441 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 01:20:44,441 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 01:20:44,442 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-30 01:20:44,442 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-30 01:20:44,442 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-30 01:20:44,442 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 01:20:44,442 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 01:20:44,443 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 01:20:44,443 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 01:20:44,443 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 01:20:44,443 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 01:20:44,443 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 01:20:44,444 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 01:20:44,444 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 01:20:44,444 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 01:20:44,444 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 01:20:44,445 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 01:20:44,445 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 01:20:44,445 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 01:20:44,445 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 01:20:44,445 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 01:20:44,446 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 01:20:44,446 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 01:20:44,482 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 01:20:44,494 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 01:20:44,498 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 01:20:44,500 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 01:20:44,500 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 01:20:44,501 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/strreplace-alloca_true-valid-memsafety_true-termination.i [2018-01-30 01:20:44,685 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 01:20:44,690 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-01-30 01:20:44,691 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 01:20:44,691 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 01:20:44,696 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 01:20:44,696 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 01:20:44" (1/1) ... [2018-01-30 01:20:44,699 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c6f32fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:20:44, skipping insertion in model container [2018-01-30 01:20:44,699 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 01:20:44" (1/1) ... [2018-01-30 01:20:44,716 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 01:20:44,757 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 01:20:44,867 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 01:20:44,882 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 01:20:44,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:20:44 WrapperNode [2018-01-30 01:20:44,889 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 01:20:44,889 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 01:20:44,890 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 01:20:44,890 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 01:20:44,905 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:20:44" (1/1) ... [2018-01-30 01:20:44,906 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:20:44" (1/1) ... [2018-01-30 01:20:44,916 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:20:44" (1/1) ... [2018-01-30 01:20:44,917 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:20:44" (1/1) ... [2018-01-30 01:20:44,919 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:20:44" (1/1) ... [2018-01-30 01:20:44,922 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:20:44" (1/1) ... [2018-01-30 01:20:44,923 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:20:44" (1/1) ... [2018-01-30 01:20:44,924 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 01:20:44,925 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 01:20:44,925 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 01:20:44,925 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 01:20:44,925 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:20:44" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 01:20:44,976 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 01:20:44,976 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 01:20:44,976 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrreplace [2018-01-30 01:20:44,976 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 01:20:44,977 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-30 01:20:44,977 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-30 01:20:44,977 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-30 01:20:44,977 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-30 01:20:44,977 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-30 01:20:44,977 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 01:20:44,978 INFO L128 BoogieDeclarations]: Found specification of procedure cstrreplace [2018-01-30 01:20:44,978 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 01:20:44,978 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 01:20:44,978 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 01:20:45,181 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 01:20:45,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 01:20:45 BoogieIcfgContainer [2018-01-30 01:20:45,181 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 01:20:45,182 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-01-30 01:20:45,182 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-01-30 01:20:45,183 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-01-30 01:20:45,185 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 01:20:45" (1/1) ... [2018-01-30 01:20:45,192 INFO L103 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-01-30 01:20:45,194 INFO L104 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-01-30 01:20:45,194 INFO L150 apSepIcfgTransformer]: starting freeze-var-style preprocessing [2018-01-30 01:20:45,233 INFO L162 apSepIcfgTransformer]: finished StoreIndexFreezer, created 7 freeze vars and freeze var literals (each corresponds to one heap write) [2018-01-30 01:20:45,261 INFO L221 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-01-30 01:20:45,308 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-30 01:22:22,651 INFO L311 AbstractInterpreter]: Visited 67 different actions 878 times. Merged at 41 different actions 618 times. Widened at 1 different actions 18 times. Found 56 fixpoints after 4 different actions. Largest state had 48 variables. [2018-01-30 01:22:22,654 INFO L229 apSepIcfgTransformer]: finished equality analysis [2018-01-30 01:22:22,665 INFO L244 HeapSepPreAnalysis]: Number of read from array group [#memory_int] : 4 [2018-01-30 01:22:22,665 INFO L241 apSepIcfgTransformer]: Finished pre analysis before partitioning [2018-01-30 01:22:22,665 INFO L242 apSepIcfgTransformer]: array groups: Set: [#memory_int] [2018-01-30 01:22:22,666 INFO L244 apSepIcfgTransformer]: select infos: Set: ((select |v_#memory_int_10| v_main_~nondetString1~5.base_5), at (SUMMARY for call write~int(0, ~nondetString1~5.base, ~nondetString1~5.offset + (~length1~5 - 1) * 1, 1); srcloc: L559)) ((select |v_#memory_int_4| v_cstrreplace_~p~2.base_8), at (SUMMARY for call write~int(~new, ~p~2.base, ~p~2.offset, 1); srcloc: L546)) ((select (select |v_#memory_int_1| v_cstrreplace_~p~2.base_2) v_cstrreplace_~p~2.offset_2), at (SUMMARY for call #t~mem0 := read~int(~p~2.base, ~p~2.offset, 1); srcloc: L544)) ((select (select |v_#memory_int_2| v_cstrreplace_~p~2.base_5) v_cstrreplace_~p~2.offset_4), at (SUMMARY for call #t~mem1 := read~int(~p~2.base, ~p~2.offset, 1); srcloc: L545)) [2018-01-30 01:22:22,673 INFO L547 PartitionManager]: partitioning result: [2018-01-30 01:22:22,674 INFO L552 PartitionManager]: location blocks for array group [#memory_int] [2018-01-30 01:22:22,674 INFO L561 PartitionManager]: at dimension 0 [2018-01-30 01:22:22,674 INFO L562 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 3 [2018-01-30 01:22:22,674 INFO L563 PartitionManager]: # location blocks :2 [2018-01-30 01:22:22,674 INFO L561 PartitionManager]: at dimension 1 [2018-01-30 01:22:22,674 INFO L562 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 2 [2018-01-30 01:22:22,674 INFO L563 PartitionManager]: # location blocks :1 [2018-01-30 01:22:22,675 INFO L86 ransitionTransformer]: executing heap partitioning transformation [2018-01-30 01:22:22,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 01:22:22 BasicIcfg [2018-01-30 01:22:22,688 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-01-30 01:22:22,689 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 01:22:22,689 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 01:22:22,691 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 01:22:22,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 01:20:44" (1/4) ... [2018-01-30 01:22:22,693 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3083c7ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 01:22:22, skipping insertion in model container [2018-01-30 01:22:22,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:20:44" (2/4) ... [2018-01-30 01:22:22,693 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3083c7ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 01:22:22, skipping insertion in model container [2018-01-30 01:22:22,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 01:20:45" (3/4) ... [2018-01-30 01:22:22,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3083c7ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 01:22:22, skipping insertion in model container [2018-01-30 01:22:22,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 01:22:22" (4/4) ... [2018-01-30 01:22:22,695 INFO L107 eAbstractionObserver]: Analyzing ICFG HeapSeparatedIcfg [2018-01-30 01:22:22,753 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 01:22:22,759 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-30 01:22:22,789 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 01:22:22,789 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 01:22:22,789 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 01:22:22,789 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 01:22:22,789 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 01:22:22,790 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 01:22:22,790 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 01:22:22,790 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 01:22:22,790 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 01:22:22,801 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2018-01-30 01:22:22,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-01-30 01:22:22,806 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:22:22,807 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:22:22,807 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-30 01:22:22,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1586738624, now seen corresponding path program 1 times [2018-01-30 01:22:22,812 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:22:22,812 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:22:22,852 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:22:22,852 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:22:22,852 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:22:22,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:22:22,910 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:22:23,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:22:23,032 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:22:23,032 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 01:22:23,033 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 01:22:23,041 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 01:22:23,042 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 01:22:23,043 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 5 states. [2018-01-30 01:22:23,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:22:23,116 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2018-01-30 01:22:23,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 01:22:23,118 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-01-30 01:22:23,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:22:23,129 INFO L225 Difference]: With dead ends: 76 [2018-01-30 01:22:23,129 INFO L226 Difference]: Without dead ends: 57 [2018-01-30 01:22:23,132 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-30 01:22:23,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-30 01:22:23,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-01-30 01:22:23,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-30 01:22:23,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2018-01-30 01:22:23,172 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 9 [2018-01-30 01:22:23,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:22:23,172 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2018-01-30 01:22:23,172 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 01:22:23,172 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-01-30 01:22:23,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-01-30 01:22:23,173 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:22:23,173 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:22:23,173 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-30 01:22:23,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1586738622, now seen corresponding path program 1 times [2018-01-30 01:22:23,173 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:22:23,173 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:22:23,174 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:22:23,174 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:22:23,174 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:22:23,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:22:23,180 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:22:23,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:22:23,206 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:22:23,206 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:22:23,207 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 01:22:23,208 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 01:22:23,208 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 01:22:23,208 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 4 states. [2018-01-30 01:22:23,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:22:23,333 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-01-30 01:22:23,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 01:22:23,334 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-01-30 01:22:23,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:22:23,335 INFO L225 Difference]: With dead ends: 57 [2018-01-30 01:22:23,335 INFO L226 Difference]: Without dead ends: 56 [2018-01-30 01:22:23,336 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 01:22:23,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-01-30 01:22:23,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-01-30 01:22:23,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-30 01:22:23,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-01-30 01:22:23,342 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 9 [2018-01-30 01:22:23,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:22:23,343 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-01-30 01:22:23,343 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 01:22:23,343 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-01-30 01:22:23,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-30 01:22:23,343 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:22:23,343 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:22:23,344 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-30 01:22:23,344 INFO L82 PathProgramCache]: Analyzing trace with hash 830385074, now seen corresponding path program 1 times [2018-01-30 01:22:23,344 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:22:23,344 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:22:23,345 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:22:23,345 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:22:23,346 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:22:23,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:22:23,364 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:22:23,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:22:23,445 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:22:23,445 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 01:22:23,446 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 01:22:23,446 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 01:22:23,446 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 01:22:23,446 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 6 states. [2018-01-30 01:22:23,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:22:23,581 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-01-30 01:22:23,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 01:22:23,582 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-30 01:22:23,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:22:23,583 INFO L225 Difference]: With dead ends: 60 [2018-01-30 01:22:23,583 INFO L226 Difference]: Without dead ends: 57 [2018-01-30 01:22:23,584 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-30 01:22:23,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-30 01:22:23,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-01-30 01:22:23,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-30 01:22:23,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2018-01-30 01:22:23,590 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 19 [2018-01-30 01:22:23,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:22:23,590 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2018-01-30 01:22:23,591 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 01:22:23,591 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2018-01-30 01:22:23,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-30 01:22:23,592 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:22:23,592 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:22:23,592 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-30 01:22:23,592 INFO L82 PathProgramCache]: Analyzing trace with hash 830385076, now seen corresponding path program 1 times [2018-01-30 01:22:23,592 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:22:23,592 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:22:23,593 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:22:23,593 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:22:23,593 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:22:23,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:22:23,611 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:22:23,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:22:23,715 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:22:23,715 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-30 01:22:23,715 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 01:22:23,715 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 01:22:23,715 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-30 01:22:23,716 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 9 states. [2018-01-30 01:22:23,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:22:23,854 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2018-01-30 01:22:23,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 01:22:23,855 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-01-30 01:22:23,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:22:23,858 INFO L225 Difference]: With dead ends: 75 [2018-01-30 01:22:23,858 INFO L226 Difference]: Without dead ends: 72 [2018-01-30 01:22:23,859 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-01-30 01:22:23,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-01-30 01:22:23,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 62. [2018-01-30 01:22:23,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-30 01:22:23,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2018-01-30 01:22:23,867 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 19 [2018-01-30 01:22:23,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:22:23,868 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2018-01-30 01:22:23,868 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 01:22:23,868 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-01-30 01:22:23,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-30 01:22:23,869 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:22:23,869 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:22:23,869 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-30 01:22:23,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1732752207, now seen corresponding path program 1 times [2018-01-30 01:22:23,870 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:22:23,870 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:22:23,871 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:22:23,871 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:22:23,871 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:22:23,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:22:23,886 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:22:23,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:22:23,947 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:22:23,947 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:22:23,948 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 01:22:23,948 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 01:22:23,948 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 01:22:23,948 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 4 states. [2018-01-30 01:22:24,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:22:24,034 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2018-01-30 01:22:24,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 01:22:24,035 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-01-30 01:22:24,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:22:24,035 INFO L225 Difference]: With dead ends: 62 [2018-01-30 01:22:24,035 INFO L226 Difference]: Without dead ends: 49 [2018-01-30 01:22:24,036 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 01:22:24,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-30 01:22:24,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-30 01:22:24,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-30 01:22:24,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-01-30 01:22:24,040 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 20 [2018-01-30 01:22:24,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:22:24,041 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-01-30 01:22:24,041 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 01:22:24,041 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-01-30 01:22:24,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-30 01:22:24,041 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:22:24,042 INFO L350 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:22:24,042 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-30 01:22:24,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1127193870, now seen corresponding path program 1 times [2018-01-30 01:22:24,042 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:22:24,042 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:22:24,043 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:22:24,043 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:22:24,043 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:22:24,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:22:24,055 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:22:24,116 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-30 01:22:24,116 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:22:24,117 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 01:22:24,117 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 01:22:24,117 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 01:22:24,117 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-30 01:22:24,117 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 7 states. [2018-01-30 01:22:24,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:22:24,191 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-01-30 01:22:24,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 01:22:24,191 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-01-30 01:22:24,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:22:24,192 INFO L225 Difference]: With dead ends: 49 [2018-01-30 01:22:24,192 INFO L226 Difference]: Without dead ends: 48 [2018-01-30 01:22:24,193 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-01-30 01:22:24,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-30 01:22:24,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-30 01:22:24,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-30 01:22:24,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-01-30 01:22:24,198 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 29 [2018-01-30 01:22:24,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:22:24,199 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-01-30 01:22:24,199 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 01:22:24,199 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-01-30 01:22:24,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-30 01:22:24,200 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:22:24,200 INFO L350 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:22:24,200 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-30 01:22:24,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1127193868, now seen corresponding path program 1 times [2018-01-30 01:22:24,201 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:22:24,201 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:22:24,202 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:22:24,202 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:22:24,202 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:22:24,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:22:24,224 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:22:24,497 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:22:24,497 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:22:24,497 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:22:24,506 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:22:24,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:22:24,537 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:22:24,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 13 [2018-01-30 01:22:24,572 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:22:24,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-30 01:22:24,586 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 11 treesize of output 10 [2018-01-30 01:22:24,586 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 01:22:24,588 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:22:24,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 01:22:24,596 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:25, output treesize:21 [2018-01-30 01:22:24,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-01-30 01:22:24,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-01-30 01:22:24,792 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-30 01:22:24,808 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 01:22:24,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-30 01:22:24,845 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-01-30 01:22:24,952 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:22:24,973 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:22:24,973 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2018-01-30 01:22:24,973 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-30 01:22:24,974 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-30 01:22:24,974 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2018-01-30 01:22:24,974 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 20 states. [2018-01-30 01:22:25,527 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 69 DAG size of output 50 [2018-01-30 01:22:26,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:22:26,065 INFO L93 Difference]: Finished difference Result 116 states and 127 transitions. [2018-01-30 01:22:26,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-30 01:22:26,066 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 29 [2018-01-30 01:22:26,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:22:26,067 INFO L225 Difference]: With dead ends: 116 [2018-01-30 01:22:26,067 INFO L226 Difference]: Without dead ends: 113 [2018-01-30 01:22:26,068 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=204, Invalid=986, Unknown=0, NotChecked=0, Total=1190 [2018-01-30 01:22:26,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-01-30 01:22:26,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 63. [2018-01-30 01:22:26,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-01-30 01:22:26,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2018-01-30 01:22:26,077 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 29 [2018-01-30 01:22:26,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:22:26,077 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2018-01-30 01:22:26,077 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-30 01:22:26,078 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2018-01-30 01:22:26,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-30 01:22:26,079 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:22:26,079 INFO L350 BasicCegarLoop]: trace histogram [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] [2018-01-30 01:22:26,079 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-30 01:22:26,079 INFO L82 PathProgramCache]: Analyzing trace with hash -875165132, now seen corresponding path program 2 times [2018-01-30 01:22:26,079 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:22:26,080 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:22:26,080 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:22:26,081 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:22:26,081 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:22:26,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:22:26,100 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:22:26,493 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:22:26,493 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:22:26,493 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:22:26,500 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 01:22:26,511 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:22:26,517 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:22:26,519 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:22:26,521 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:22:26,526 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-30 01:22:26,527 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:22:26,531 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:22:26,532 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-30 01:22:26,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 16 treesize of output 15 [2018-01-30 01:22:26,553 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:22:26,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2018-01-30 01:22:26,559 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 13 treesize of output 12 [2018-01-30 01:22:26,560 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 01:22:26,561 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:22:26,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:22:26,565 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:20, output treesize:16 [2018-01-30 01:22:26,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-30 01:22:26,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-30 01:22:26,694 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-30 01:22:26,697 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 01:22:26,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-30 01:22:26,703 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2018-01-30 01:22:26,773 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:22:26,797 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:22:26,797 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 20 [2018-01-30 01:22:26,797 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-30 01:22:26,797 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-30 01:22:26,798 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2018-01-30 01:22:26,798 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 21 states. [2018-01-30 01:22:28,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:22:28,054 INFO L93 Difference]: Finished difference Result 134 states and 146 transitions. [2018-01-30 01:22:28,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-01-30 01:22:28,054 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 39 [2018-01-30 01:22:28,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:22:28,055 INFO L225 Difference]: With dead ends: 134 [2018-01-30 01:22:28,055 INFO L226 Difference]: Without dead ends: 98 [2018-01-30 01:22:28,057 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=368, Invalid=1794, Unknown=0, NotChecked=0, Total=2162 [2018-01-30 01:22:28,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-30 01:22:28,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 77. [2018-01-30 01:22:28,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-30 01:22:28,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2018-01-30 01:22:28,067 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 39 [2018-01-30 01:22:28,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:22:28,068 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2018-01-30 01:22:28,068 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-30 01:22:28,068 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2018-01-30 01:22:28,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-01-30 01:22:28,070 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:22:28,070 INFO L350 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:22:28,070 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-30 01:22:28,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1759664536, now seen corresponding path program 1 times [2018-01-30 01:22:28,070 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:22:28,071 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:22:28,071 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:22:28,072 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:22:28,072 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:22:28,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:22:28,095 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:22:28,467 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:22:28,467 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:22:28,468 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:22:28,473 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:22:28,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:22:28,495 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:22:28,498 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-30 01:22:28,498 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:22:28,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:22:28,504 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-30 01:22:28,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 14 [2018-01-30 01:22:28,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:22:28,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:22:28,515 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-01-30 01:22:28,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2018-01-30 01:22:28,624 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:22:28,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-01-30 01:22:28,630 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-01-30 01:22:28,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 27 [2018-01-30 01:22:28,639 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-30 01:22:28,649 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 01:22:28,657 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 01:22:28,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-30 01:22:28,667 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:27 [2018-01-30 01:22:28,844 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-01-30 01:22:28,844 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:22:28,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-30 01:22:28,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-30 01:22:28,865 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-30 01:22:28,869 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 01:22:28,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-30 01:22:28,877 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:57, output treesize:34 [2018-01-30 01:22:29,016 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:22:29,037 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:22:29,037 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 30 [2018-01-30 01:22:29,038 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-01-30 01:22:29,038 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-01-30 01:22:29,039 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2018-01-30 01:22:29,039 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 31 states. [2018-01-30 01:22:30,324 WARN L146 SmtUtils]: Spent 137ms on a formula simplification. DAG size of input: 78 DAG size of output 47 [2018-01-30 01:22:30,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:22:30,700 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2018-01-30 01:22:30,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-01-30 01:22:30,700 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 53 [2018-01-30 01:22:30,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:22:30,701 INFO L225 Difference]: With dead ends: 83 [2018-01-30 01:22:30,701 INFO L226 Difference]: Without dead ends: 0 [2018-01-30 01:22:30,702 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=488, Invalid=2482, Unknown=0, NotChecked=0, Total=2970 [2018-01-30 01:22:30,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-30 01:22:30,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-30 01:22:30,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-30 01:22:30,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-30 01:22:30,703 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 53 [2018-01-30 01:22:30,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:22:30,703 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-30 01:22:30,703 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-01-30 01:22:30,703 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-30 01:22:30,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-30 01:22:30,706 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-30 01:22:31,270 WARN L146 SmtUtils]: Spent 478ms on a formula simplification. DAG size of input: 136 DAG size of output 79 [2018-01-30 01:22:31,331 INFO L399 ceAbstractionStarter]: For program point L1(lines 1 561) no Hoare annotation was computed. [2018-01-30 01:22:31,332 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 561) no Hoare annotation was computed. [2018-01-30 01:22:31,332 INFO L395 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 561) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-30 01:22:31,332 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 561) no Hoare annotation was computed. [2018-01-30 01:22:31,332 INFO L402 ceAbstractionStarter]: At program point cstrreplaceENTRY(lines 540 552) the Hoare annotation is: true [2018-01-30 01:22:31,332 INFO L399 ceAbstractionStarter]: For program point cstrreplaceErr2RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-30 01:22:31,332 INFO L399 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-01-30 01:22:31,333 INFO L399 ceAbstractionStarter]: For program point L540(lines 540 552) no Hoare annotation was computed. [2018-01-30 01:22:31,333 INFO L399 ceAbstractionStarter]: For program point L544''''(line 544) no Hoare annotation was computed. [2018-01-30 01:22:31,333 INFO L399 ceAbstractionStarter]: For program point L546(line 546) no Hoare annotation was computed. [2018-01-30 01:22:31,333 INFO L399 ceAbstractionStarter]: For program point cstrreplaceFINAL(lines 540 552) no Hoare annotation was computed. [2018-01-30 01:22:31,333 INFO L399 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-01-30 01:22:31,333 INFO L399 ceAbstractionStarter]: For program point L544(lines 544 550) no Hoare annotation was computed. [2018-01-30 01:22:31,333 INFO L399 ceAbstractionStarter]: For program point L543(line 543) no Hoare annotation was computed. [2018-01-30 01:22:31,333 INFO L399 ceAbstractionStarter]: For program point L549(line 549) no Hoare annotation was computed. [2018-01-30 01:22:31,333 INFO L399 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-01-30 01:22:31,333 INFO L399 ceAbstractionStarter]: For program point cstrreplaceErr1RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-30 01:22:31,333 INFO L399 ceAbstractionStarter]: For program point L545''''(line 545) no Hoare annotation was computed. [2018-01-30 01:22:31,333 INFO L399 ceAbstractionStarter]: For program point L544'(line 544) no Hoare annotation was computed. [2018-01-30 01:22:31,333 INFO L399 ceAbstractionStarter]: For program point L546'(line 546) no Hoare annotation was computed. [2018-01-30 01:22:31,334 INFO L399 ceAbstractionStarter]: For program point cstrreplaceErr5RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-30 01:22:31,334 INFO L399 ceAbstractionStarter]: For program point L545'''''(lines 545 548) no Hoare annotation was computed. [2018-01-30 01:22:31,334 INFO L399 ceAbstractionStarter]: For program point cstrreplaceErr0RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-30 01:22:31,334 INFO L399 ceAbstractionStarter]: For program point L540'(lines 540 552) no Hoare annotation was computed. [2018-01-30 01:22:31,334 INFO L399 ceAbstractionStarter]: For program point cstrreplaceErr4RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-30 01:22:31,334 INFO L399 ceAbstractionStarter]: For program point L544''''''(lines 544 550) no Hoare annotation was computed. [2018-01-30 01:22:31,334 INFO L399 ceAbstractionStarter]: For program point cstrreplaceEXIT(lines 540 552) no Hoare annotation was computed. [2018-01-30 01:22:31,334 INFO L395 ceAbstractionStarter]: At program point L544'''''(lines 544 550) the Hoare annotation is: (let ((.cse3 (select |#length| cstrreplace_~p~2.base)) (.cse1 (select |#length| cstrreplace_~s.base))) (let ((.cse0 (= 1 (select |#valid| cstrreplace_~s.base))) (.cse2 (= 0 cstrreplace_~s.offset)) (.cse6 (+ .cse1 (- 1))) (.cse5 (select |#memory_int_part_locs_69_locs_71| cstrreplace_~s.base)) (.cse4 (= 1 (select |#valid| cstrreplace_~p~2.base))) (.cse8 (+ .cse3 (- 1))) (.cse7 (select |#memory_int_part_locs_69_locs_71| cstrreplace_~p~2.base))) (or (not (= 1 (select |#valid| |cstrreplace_#in~s.base|))) (not (= (store (select |#memory_int_part_locs_30_locs_71| |cstrreplace_#in~s.base|) (+ (select |#length| |cstrreplace_#in~s.base|) (- 1)) 0) (select |#memory_int_part_locs_69_locs_71| |cstrreplace_#in~s.base|))) (not (= 0 |cstrreplace_#in~s.offset|)) (not (exists ((main_~length1~5 Int) (v_main_~nondetString1~5.offset_BEFORE_CALL_4 Int)) (and (<= (+ main_~length1~5 v_main_~nondetString1~5.offset_BEFORE_CALL_4) (select |#length| |cstrreplace_#in~s.base|)) (= 0 (select (select |#memory_int_part_locs_69_locs_71| |cstrreplace_#in~s.base|) (+ main_~length1~5 v_main_~nondetString1~5.offset_BEFORE_CALL_4 (- 1)))) (<= 1 main_~length1~5) (<= |cstrreplace_#in~s.offset| v_main_~nondetString1~5.offset_BEFORE_CALL_4)))) (and (and .cse0 (<= 1 cstrreplace_~p~2.offset) (<= 1 .cse1) .cse2 (<= (+ cstrreplace_~p~2.offset 1) .cse3) .cse4) (= (select .cse5 .cse6) 0) (= 0 (select .cse7 .cse8))) (and .cse0 (exists ((main_~length1~5 Int) (v_main_~nondetString1~5.offset_BEFORE_CALL_4 Int)) (and (<= 1 main_~length1~5) (= 0 (select (select |#memory_int_part_locs_69_locs_71| cstrreplace_~p~2.base) (+ main_~length1~5 v_main_~nondetString1~5.offset_BEFORE_CALL_4 (- 1)))) (<= cstrreplace_~p~2.offset v_main_~nondetString1~5.offset_BEFORE_CALL_4) (<= (+ main_~length1~5 v_main_~nondetString1~5.offset_BEFORE_CALL_4) (select |#length| cstrreplace_~p~2.base)))) .cse2 (= (store (select |#memory_int_part_locs_30_locs_71| cstrreplace_~s.base) .cse6 0) .cse5) .cse4 (exists ((main_~length1~5 Int) (v_main_~nondetString1~5.offset_BEFORE_CALL_4 Int)) (and (<= (+ main_~length1~5 v_main_~nondetString1~5.offset_BEFORE_CALL_4) (select |#length| cstrreplace_~s.base)) (<= cstrreplace_~s.offset v_main_~nondetString1~5.offset_BEFORE_CALL_4) (<= 1 main_~length1~5) (= 0 (select (select |#memory_int_part_locs_69_locs_71| cstrreplace_~s.base) (+ main_~length1~5 v_main_~nondetString1~5.offset_BEFORE_CALL_4 (- 1)))))) (<= 0 cstrreplace_~p~2.offset) (= (store (select |#memory_int_part_locs_30_locs_71| cstrreplace_~p~2.base) .cse8 0) .cse7))))) [2018-01-30 01:22:31,334 INFO L399 ceAbstractionStarter]: For program point L545''(line 545) no Hoare annotation was computed. [2018-01-30 01:22:31,335 INFO L399 ceAbstractionStarter]: For program point L544''(line 544) no Hoare annotation was computed. [2018-01-30 01:22:31,335 INFO L399 ceAbstractionStarter]: For program point L545'(line 545) no Hoare annotation was computed. [2018-01-30 01:22:31,335 INFO L399 ceAbstractionStarter]: For program point cstrreplaceErr3RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-30 01:22:31,335 INFO L399 ceAbstractionStarter]: For program point L547'(line 547) no Hoare annotation was computed. [2018-01-30 01:22:31,335 INFO L399 ceAbstractionStarter]: For program point L549'(line 549) no Hoare annotation was computed. [2018-01-30 01:22:31,335 INFO L402 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 561) the Hoare annotation is: true [2018-01-30 01:22:31,335 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 561) no Hoare annotation was computed. [2018-01-30 01:22:31,335 INFO L402 ceAbstractionStarter]: At program point L1(lines 1 561) the Hoare annotation is: true [2018-01-30 01:22:31,335 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 561) no Hoare annotation was computed. [2018-01-30 01:22:31,335 INFO L399 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-01-30 01:22:31,335 INFO L399 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-30 01:22:31,336 INFO L395 ceAbstractionStarter]: At program point L560'(line 560) the Hoare annotation is: (let ((.cse0 (select |#length| main_~nondetString1~5.base))) (and (= 1 (select |#valid| main_~nondetString1~5.base)) (= (store (select |#memory_int_part_locs_30_locs_71| main_~nondetString1~5.base) (+ .cse0 (- 1)) 0) (select |#memory_int_part_locs_69_locs_71| main_~nondetString1~5.base)) (= 0 |main_#t~malloc6.offset|) (= main_~length1~5 .cse0) (exists ((main_~length1~5 Int)) (and (<= (+ main_~length1~5 main_~nondetString1~5.offset) (select |#length| main_~nondetString1~5.base)) (= (select (select |#memory_int_part_locs_69_locs_71| main_~nondetString1~5.base) (+ main_~length1~5 main_~nondetString1~5.offset (- 1))) 0) (<= 1 main_~length1~5))) (= main_~length1~5 (select |#length| |main_#t~malloc6.base|)) (= 0 main_~nondetString1~5.offset) (= 1 (select |#valid| |main_#t~malloc6.base|)) (= (store |#valid| |main_#t~malloc6.base| (select (store |#valid| |main_#t~malloc6.base| 0) |main_#t~malloc6.base|)) |old(#valid)|))) [2018-01-30 01:22:31,336 INFO L399 ceAbstractionStarter]: For program point L560''''(line 560) no Hoare annotation was computed. [2018-01-30 01:22:31,336 INFO L399 ceAbstractionStarter]: For program point L560'''''(line 560) no Hoare annotation was computed. [2018-01-30 01:22:31,336 INFO L399 ceAbstractionStarter]: For program point mainFINAL(lines 553 561) no Hoare annotation was computed. [2018-01-30 01:22:31,336 INFO L399 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-01-30 01:22:31,336 INFO L399 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 553 561) no Hoare annotation was computed. [2018-01-30 01:22:31,336 INFO L399 ceAbstractionStarter]: For program point L555(lines 555 557) no Hoare annotation was computed. [2018-01-30 01:22:31,336 INFO L399 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-01-30 01:22:31,336 INFO L399 ceAbstractionStarter]: For program point L560''''''(line 560) no Hoare annotation was computed. [2018-01-30 01:22:31,336 INFO L399 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-30 01:22:31,336 INFO L399 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-01-30 01:22:31,336 INFO L399 ceAbstractionStarter]: For program point L558(line 558) no Hoare annotation was computed. [2018-01-30 01:22:31,336 INFO L399 ceAbstractionStarter]: For program point mainEXIT(lines 553 561) no Hoare annotation was computed. [2018-01-30 01:22:31,336 INFO L395 ceAbstractionStarter]: At program point mainENTRY(lines 553 561) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-30 01:22:31,337 INFO L399 ceAbstractionStarter]: For program point L560''(line 560) no Hoare annotation was computed. [2018-01-30 01:22:31,337 INFO L399 ceAbstractionStarter]: For program point L554'(line 554) no Hoare annotation was computed. [2018-01-30 01:22:31,337 INFO L399 ceAbstractionStarter]: For program point L558''(line 558) no Hoare annotation was computed. [2018-01-30 01:22:31,337 INFO L399 ceAbstractionStarter]: For program point L558'(line 558) no Hoare annotation was computed. [2018-01-30 01:22:31,337 INFO L399 ceAbstractionStarter]: For program point L555''(lines 555 557) no Hoare annotation was computed. [2018-01-30 01:22:31,337 INFO L399 ceAbstractionStarter]: For program point L559'(line 559) no Hoare annotation was computed. [2018-01-30 01:22:31,337 INFO L399 ceAbstractionStarter]: For program point L560'''(line 560) no Hoare annotation was computed. [2018-01-30 01:22:31,344 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier3,QUANTIFIED] [2018-01-30 01:22:31,345 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier4,QUANTIFIED] [2018-01-30 01:22:31,345 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-30 01:22:31,345 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:22:31,345 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier6,QUANTIFIED] [2018-01-30 01:22:31,346 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-30 01:22:31,346 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:22:31,346 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-30 01:22:31,346 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:22:31,347 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier7,QUANTIFIED] [2018-01-30 01:22:31,347 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier8,QUANTIFIED] [2018-01-30 01:22:31,347 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-30 01:22:31,347 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier9,QUANTIFIED] [2018-01-30 01:22:31,347 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-30 01:22:31,347 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:22:31,348 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:22:31,348 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-30 01:22:31,348 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:22:31,348 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier10,QUANTIFIED] [2018-01-30 01:22:31,348 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier11,QUANTIFIED] [2018-01-30 01:22:31,348 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-30 01:22:31,348 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:22:31,349 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:22:31,349 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-30 01:22:31,349 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier12,QUANTIFIED] [2018-01-30 01:22:31,349 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-30 01:22:31,349 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:22:31,349 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier13,QUANTIFIED] [2018-01-30 01:22:31,349 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier14,QUANTIFIED] [2018-01-30 01:22:31,351 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:22:31,351 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:22:31,351 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:22:31,352 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:22:31,352 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:22:31,352 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:22:31,352 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:22:31,352 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:22:31,353 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:22:31,353 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:22:31,359 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier17,QUANTIFIED] [2018-01-30 01:22:31,359 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier18,QUANTIFIED] [2018-01-30 01:22:31,359 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-30 01:22:31,359 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:22:31,359 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier20,QUANTIFIED] [2018-01-30 01:22:31,359 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-30 01:22:31,360 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:22:31,360 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-30 01:22:31,360 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:22:31,360 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier21,QUANTIFIED] [2018-01-30 01:22:31,360 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier22,QUANTIFIED] [2018-01-30 01:22:31,360 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-30 01:22:31,361 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier23,QUANTIFIED] [2018-01-30 01:22:31,361 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-30 01:22:31,361 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:22:31,361 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:22:31,361 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-30 01:22:31,361 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:22:31,361 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier24,QUANTIFIED] [2018-01-30 01:22:31,362 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier25,QUANTIFIED] [2018-01-30 01:22:31,362 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-30 01:22:31,362 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:22:31,362 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:22:31,362 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-30 01:22:31,363 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier26,QUANTIFIED] [2018-01-30 01:22:31,363 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-30 01:22:31,363 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:22:31,363 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier27,QUANTIFIED] [2018-01-30 01:22:31,363 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier28,QUANTIFIED] [2018-01-30 01:22:31,364 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:22:31,364 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:22:31,364 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:22:31,364 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:22:31,365 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:22:31,365 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:22:31,365 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:22:31,365 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:22:31,366 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:22:31,366 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:22:31,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 01:22:31 BasicIcfg [2018-01-30 01:22:31,369 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 01:22:31,370 INFO L168 Benchmark]: Toolchain (without parser) took 106683.65 ms. Allocated memory was 301.5 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 261.5 MB in the beginning and 320.8 MB in the end (delta: -59.3 MB). Peak memory consumption was 1.9 GB. Max. memory is 5.3 GB. [2018-01-30 01:22:31,370 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 301.5 MB. Free memory is still 267.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 01:22:31,371 INFO L168 Benchmark]: CACSL2BoogieTranslator took 198.32 ms. Allocated memory is still 301.5 MB. Free memory was 260.5 MB in the beginning and 250.3 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. [2018-01-30 01:22:31,371 INFO L168 Benchmark]: Boogie Preprocessor took 34.78 ms. Allocated memory is still 301.5 MB. Free memory was 250.3 MB in the beginning and 249.3 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. [2018-01-30 01:22:31,371 INFO L168 Benchmark]: RCFGBuilder took 256.86 ms. Allocated memory is still 301.5 MB. Free memory was 248.3 MB in the beginning and 230.7 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 5.3 GB. [2018-01-30 01:22:31,372 INFO L168 Benchmark]: IcfgTransformer took 97506.67 ms. Allocated memory was 301.5 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 230.7 MB in the beginning and 122.6 MB in the end (delta: 108.1 MB). Peak memory consumption was 2.0 GB. Max. memory is 5.3 GB. [2018-01-30 01:22:31,372 INFO L168 Benchmark]: TraceAbstraction took 8679.92 ms. Allocated memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: 105.4 MB). Free memory was 122.6 MB in the beginning and 320.8 MB in the end (delta: -198.2 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 01:22:31,374 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.23 ms. Allocated memory is still 301.5 MB. Free memory is still 267.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 198.32 ms. Allocated memory is still 301.5 MB. Free memory was 260.5 MB in the beginning and 250.3 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.78 ms. Allocated memory is still 301.5 MB. Free memory was 250.3 MB in the beginning and 249.3 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. * RCFGBuilder took 256.86 ms. Allocated memory is still 301.5 MB. Free memory was 248.3 MB in the beginning and 230.7 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 5.3 GB. * IcfgTransformer took 97506.67 ms. Allocated memory was 301.5 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 230.7 MB in the beginning and 122.6 MB in the end (delta: 108.1 MB). Peak memory consumption was 2.0 GB. Max. memory is 5.3 GB. * TraceAbstraction took 8679.92 ms. Allocated memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: 105.4 MB). Free memory was 122.6 MB in the beginning and 320.8 MB in the end (delta: -198.2 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 56 LocStat_MAX_WEQGRAPH_SIZE : 4 LocStat_MAX_SIZEOF_WEQEDGELABEL : 3 LocStat_NO_SUPPORTING_EQUALITIES : 1120 LocStat_NO_SUPPORTING_DISEQUALITIES : 496 LocStat_NO_DISJUNCTIONS : -112 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 76 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 121 TransStat_NO_SUPPORTING_DISEQUALITIES : 9 TransStat_NO_DISJUNCTIONS : 79 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.023588 RENAME_VARIABLES(MILLISECONDS) : 1.098654 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.001150 PROJECTAWAY(MILLISECONDS) : 2.373544 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.043506 DISJOIN(MILLISECONDS) : 0.822335 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 1.122728 ADD_EQUALITY(MILLISECONDS) : 0.029326 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.015255 #CONJOIN_DISJUNCTIVE : 1413 #RENAME_VARIABLES : 3097 #UNFREEZE : 0 #CONJOIN : 1872 #PROJECTAWAY : 1716 #ADD_WEAK_EQUALITY : 8 #DISJOIN : 338 #RENAME_VARIABLES_DISJUNCTIVE : 3006 #ADD_EQUALITY : 123 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 8 * Results from de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: - StatisticsResult: HeapSeparatorStatistics #COUNT_NEW_ARRAY_VARS_[#memory_int] : 2 COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_0 : 3 COUNT_BLOCKS_for_[#memory_int]_at_dim_0 : 2 COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_1 : 2 COUNT_BLOCKS_for_[#memory_int]_at_dim_1 : 1 COUNT_ARRAY_READS for [#memory_int] : 4 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier24,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier28,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 553]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - InvariantResult [Line: 544]: Loop Invariant [2018-01-30 01:22:31,384 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier31,QUANTIFIED] [2018-01-30 01:22:31,384 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier32,QUANTIFIED] [2018-01-30 01:22:31,384 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-30 01:22:31,384 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:22:31,385 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier34,QUANTIFIED] [2018-01-30 01:22:31,385 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-30 01:22:31,385 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:22:31,385 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-30 01:22:31,386 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:22:31,386 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier35,QUANTIFIED] [2018-01-30 01:22:31,386 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier36,QUANTIFIED] [2018-01-30 01:22:31,386 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-30 01:22:31,387 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier37,QUANTIFIED] [2018-01-30 01:22:31,387 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-30 01:22:31,387 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:22:31,387 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:22:31,387 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-30 01:22:31,388 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:22:31,388 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier38,QUANTIFIED] [2018-01-30 01:22:31,388 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier39,QUANTIFIED] [2018-01-30 01:22:31,388 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-30 01:22:31,388 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:22:31,389 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:22:31,389 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-30 01:22:31,389 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier40,QUANTIFIED] [2018-01-30 01:22:31,389 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-30 01:22:31,389 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:22:31,390 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier41,QUANTIFIED] [2018-01-30 01:22:31,390 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier42,QUANTIFIED] [2018-01-30 01:22:31,390 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:22:31,390 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:22:31,390 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:22:31,391 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:22:31,391 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:22:31,391 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:22:31,391 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:22:31,391 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:22:31,392 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:22:31,392 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:22:31,394 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier45,QUANTIFIED] [2018-01-30 01:22:31,394 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier46,QUANTIFIED] [2018-01-30 01:22:31,395 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-30 01:22:31,395 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:22:31,395 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier48,QUANTIFIED] [2018-01-30 01:22:31,395 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-30 01:22:31,395 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:22:31,396 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-30 01:22:31,396 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:22:31,396 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier49,QUANTIFIED] [2018-01-30 01:22:31,396 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier50,QUANTIFIED] [2018-01-30 01:22:31,397 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-30 01:22:31,397 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier51,QUANTIFIED] [2018-01-30 01:22:31,397 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-30 01:22:31,397 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:22:31,397 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:22:31,398 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-30 01:22:31,398 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:22:31,398 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier52,QUANTIFIED] [2018-01-30 01:22:31,398 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier53,QUANTIFIED] [2018-01-30 01:22:31,398 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-30 01:22:31,399 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:22:31,399 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:22:31,399 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-30 01:22:31,399 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier54,QUANTIFIED] [2018-01-30 01:22:31,399 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-30 01:22:31,399 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:22:31,400 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier55,QUANTIFIED] [2018-01-30 01:22:31,400 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier56,QUANTIFIED] [2018-01-30 01:22:31,400 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:22:31,400 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:22:31,401 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:22:31,401 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:22:31,401 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:22:31,401 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:22:31,401 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:22:31,402 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:22:31,402 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:22:31,402 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((!(1 == \valid[s]) || !(freshIdentifier45[s][unknown-#length-unknown[s] + -1 := 0] == freshIdentifier46[s])) || !(0 == s)) || !(\exists main_~length1~5 : int, v_main_~nondetString1~5.offset_BEFORE_CALL_4 : int :: ((main_~length1~5 + v_main_~nondetString1~5.offset_BEFORE_CALL_4 <= unknown-#length-unknown[s] && 0 == freshIdentifier48[s][main_~length1~5 + v_main_~nondetString1~5.offset_BEFORE_CALL_4 + -1]) && 1 <= main_~length1~5) && s <= v_main_~nondetString1~5.offset_BEFORE_CALL_4)) || (((((((1 == \valid[s] && 1 <= p) && 1 <= unknown-#length-unknown[s]) && 0 == s) && p + 1 <= unknown-#length-unknown[p]) && 1 == \valid[p]) && freshIdentifier49[s][unknown-#length-unknown[s] + -1] == 0) && 0 == freshIdentifier50[p][unknown-#length-unknown[p] + -1])) || (((((((1 == \valid[s] && (\exists main_~length1~5 : int, v_main_~nondetString1~5.offset_BEFORE_CALL_4 : int :: ((1 <= main_~length1~5 && 0 == freshIdentifier51[p][main_~length1~5 + v_main_~nondetString1~5.offset_BEFORE_CALL_4 + -1]) && p <= v_main_~nondetString1~5.offset_BEFORE_CALL_4) && main_~length1~5 + v_main_~nondetString1~5.offset_BEFORE_CALL_4 <= unknown-#length-unknown[p])) && 0 == s) && freshIdentifier52[s][unknown-#length-unknown[s] + -1 := 0] == freshIdentifier53[s]) && 1 == \valid[p]) && (\exists main_~length1~5 : int, v_main_~nondetString1~5.offset_BEFORE_CALL_4 : int :: ((main_~length1~5 + v_main_~nondetString1~5.offset_BEFORE_CALL_4 <= unknown-#length-unknown[s] && s <= v_main_~nondetString1~5.offset_BEFORE_CALL_4) && 1 <= main_~length1~5) && 0 == freshIdentifier54[s][main_~length1~5 + v_main_~nondetString1~5.offset_BEFORE_CALL_4 + -1])) && 0 <= p) && freshIdentifier55[p][unknown-#length-unknown[p] + -1 := 0] == freshIdentifier56[p]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 61 locations, 9 error locations. SAFE Result, 8.5s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 4.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 434 SDtfs, 1252 SDslu, 2273 SDs, 0 SdLazy, 1274 SolverSat, 133 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 269 GetRequests, 98 SyntacticMatches, 6 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1029 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 82 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 12 NumberOfFragments, 282 HoareAnnotationTreeSize, 7 FomulaSimplifications, 665 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 1049 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 347 NumberOfCodeBlocks, 347 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 335 ConstructedInterpolants, 10 QuantifiedInterpolants, 164147 SizeOfPredicates, 52 NumberOfNonLiveVariables, 353 ConjunctsInSsa, 104 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 8/102 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/strreplace-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-Benchmark-0-2018-01-30_01-22-31-408.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/strreplace-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-VPDomainBenchmark-0-2018-01-30_01-22-31-408.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/strreplace-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-BenchmarkWithCounters-0-2018-01-30_01-22-31-408.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/strreplace-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-HeapSeparatorBenchmark-0-2018-01-30_01-22-31-408.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/strreplace-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-30_01-22-31-408.csv Received shutdown request...