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/openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e [2018-01-31 09:32:49,315 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 09:32:49,317 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 09:32:49,340 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 09:32:49,340 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 09:32:49,341 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 09:32:49,342 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 09:32:49,346 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 09:32:49,348 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 09:32:49,349 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 09:32:49,351 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 09:32:49,351 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 09:32:49,352 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 09:32:49,354 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 09:32:49,365 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 09:32:49,367 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 09:32:49,368 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 09:32:49,370 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 09:32:49,371 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 09:32:49,377 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 09:32:49,380 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 09:32:49,380 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 09:32:49,380 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 09:32:49,381 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 09:32:49,382 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 09:32:49,388 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 09:32:49,388 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 09:32:49,389 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 09:32:49,389 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 09:32:49,389 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 09:32:49,390 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 09:32:49,390 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-31 09:32:49,409 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 09:32:49,410 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 09:32:49,410 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 09:32:49,411 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 09:32:49,411 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 09:32:49,411 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 09:32:49,411 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 09:32:49,412 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 09:32:49,413 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 09:32:49,413 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 09:32:49,413 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 09:32:49,414 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 09:32:49,414 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 09:32:49,414 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 09:32:49,414 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 09:32:49,414 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 09:32:49,414 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 09:32:49,415 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 09:32:49,415 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 09:32:49,415 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 09:32:49,415 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 09:32:49,415 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 09:32:49,415 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 09:32:49,416 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 09:32:49,417 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 09:32:49,417 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 09:32:49,417 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 09:32:49,418 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 09:32:49,418 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 09:32:49,418 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 09:32:49,418 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 09:32:49,418 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 09:32:49,419 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 09:32:49,419 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 09:32:49,464 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 09:32:49,475 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 09:32:49,477 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 09:32:49,478 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 09:32:49,479 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 09:32:49,479 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-01-31 09:32:49,669 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 09:32:49,678 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-01-31 09:32:49,680 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 09:32:49,680 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 09:32:49,687 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 09:32:49,688 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:32:49" (1/1) ... [2018-01-31 09:32:49,692 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3de28e04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:32:49, skipping insertion in model container [2018-01-31 09:32:49,692 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:32:49" (1/1) ... [2018-01-31 09:32:49,710 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 09:32:49,770 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 09:32:49,948 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 09:32:49,984 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 09:32:49,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:32:49 WrapperNode [2018-01-31 09:32:49,997 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 09:32:49,998 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 09:32:49,998 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 09:32:49,999 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 09:32:50,019 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:32:49" (1/1) ... [2018-01-31 09:32:50,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:32:49" (1/1) ... [2018-01-31 09:32:50,031 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:32:49" (1/1) ... [2018-01-31 09:32:50,032 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:32:49" (1/1) ... [2018-01-31 09:32:50,043 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:32:49" (1/1) ... [2018-01-31 09:32:50,054 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:32:49" (1/1) ... [2018-01-31 09:32:50,055 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:32:49" (1/1) ... [2018-01-31 09:32:50,057 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 09:32:50,057 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 09:32:50,057 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 09:32:50,058 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 09:32:50,058 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:32:49" (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-31 09:32:50,127 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 09:32:50,127 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 09:32:50,127 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrspn [2018-01-31 09:32:50,127 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 09:32:50,127 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-31 09:32:50,128 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-31 09:32:50,128 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 09:32:50,128 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 09:32:50,130 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 09:32:50,130 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-31 09:32:50,131 INFO L128 BoogieDeclarations]: Found specification of procedure cstrspn [2018-01-31 09:32:50,131 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 09:32:50,131 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 09:32:50,131 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 09:32:50,669 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 09:32:50,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:32:50 BoogieIcfgContainer [2018-01-31 09:32:50,681 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 09:32:50,681 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-01-31 09:32:50,681 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-01-31 09:32:50,682 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-01-31 09:32:50,686 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:32:50" (1/1) ... [2018-01-31 09:32:50,698 INFO L103 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-01-31 09:32:50,698 INFO L104 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-01-31 09:32:50,699 INFO L150 apSepIcfgTransformer]: starting freeze-var-style preprocessing [2018-01-31 09:32:50,744 INFO L162 apSepIcfgTransformer]: finished StoreIndexFreezer, created 9 freeze vars and freeze var literals (each corresponds to one heap write) [2018-01-31 09:32:50,778 INFO L221 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-01-31 09:32:50,849 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-31 09:33:33,286 INFO L314 AbstractInterpreter]: Visited 76 different actions 439 times. Merged at 46 different actions 238 times. Never widened. Found 30 fixpoints after 7 different actions. Largest state had 58 variables. [2018-01-31 09:33:33,288 INFO L229 apSepIcfgTransformer]: finished equality analysis [2018-01-31 09:33:33,299 INFO L244 HeapSepPreAnalysis]: Number of read from array group [#memory_int] : 4 [2018-01-31 09:33:33,300 INFO L241 apSepIcfgTransformer]: Finished pre analysis before partitioning [2018-01-31 09:33:33,300 INFO L242 apSepIcfgTransformer]: array groups: Set: [#memory_int] [2018-01-31 09:33:33,300 INFO L244 apSepIcfgTransformer]: select infos: Set: ((select (select |v_#memory_int_8| |v_cstrspn_#t~post0.base_3|) |v_cstrspn_#t~post0.offset_3|), at (SUMMARY for call #t~mem1 := read~int(#t~post0.base, #t~post0.offset, 1); srcloc: L546')) ((select (select |v_#memory_int_7| |v_cstrspn_#t~post2.base_3|) |v_cstrspn_#t~post2.offset_3|), at (SUMMARY for call #t~mem3 := read~int(#t~post2.base, #t~post2.offset, 1); srcloc: L547''')) ((select |v_#memory_int_6| v_main_~nondetString2~4.base_2), at (SUMMARY for call write~int(0, ~nondetString2~4.base, ~nondetString2~4.offset + (~length2~4 - 1) * 1, 1); srcloc: L563')) ((select |v_#memory_int_4| v_main_~nondetString1~4.base_2), at (SUMMARY for call write~int(0, ~nondetString1~4.base, ~nondetString1~4.offset + (~length1~4 - 1) * 1, 1); srcloc: L563)) [2018-01-31 09:33:33,327 INFO L547 PartitionManager]: partitioning result: [2018-01-31 09:33:33,327 INFO L552 PartitionManager]: location blocks for array group [#memory_int] [2018-01-31 09:33:33,327 INFO L562 PartitionManager]: at dimension 0 [2018-01-31 09:33:33,327 INFO L563 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 3 [2018-01-31 09:33:33,328 INFO L564 PartitionManager]: # location blocks :3 [2018-01-31 09:33:33,328 INFO L562 PartitionManager]: at dimension 1 [2018-01-31 09:33:33,328 INFO L563 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 2 [2018-01-31 09:33:33,328 INFO L564 PartitionManager]: # location blocks :1 [2018-01-31 09:33:33,328 INFO L86 ransitionTransformer]: executing heap partitioning transformation [2018-01-31 09:33:33,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 09:33:33 BasicIcfg [2018-01-31 09:33:33,344 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-01-31 09:33:33,345 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 09:33:33,345 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 09:33:33,347 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 09:33:33,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 09:32:49" (1/4) ... [2018-01-31 09:33:33,348 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d9bbcce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:33:33, skipping insertion in model container [2018-01-31 09:33:33,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:32:49" (2/4) ... [2018-01-31 09:33:33,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d9bbcce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:33:33, skipping insertion in model container [2018-01-31 09:33:33,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:32:50" (3/4) ... [2018-01-31 09:33:33,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d9bbcce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 09:33:33, skipping insertion in model container [2018-01-31 09:33:33,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 09:33:33" (4/4) ... [2018-01-31 09:33:33,351 INFO L107 eAbstractionObserver]: Analyzing ICFG HeapSeparatedIcfg [2018-01-31 09:33:33,457 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 09:33:33,463 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-31 09:33:33,510 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 09:33:33,510 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 09:33:33,511 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 09:33:33,511 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 09:33:33,511 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 09:33:33,511 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 09:33:33,511 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 09:33:33,511 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 09:33:33,512 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 09:33:33,522 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states. [2018-01-31 09:33:33,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-31 09:33:33,527 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:33:33,528 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:33:33,528 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-01-31 09:33:33,531 INFO L82 PathProgramCache]: Analyzing trace with hash -780815606, now seen corresponding path program 1 times [2018-01-31 09:33:33,532 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:33:33,533 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:33:33,573 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:33:33,573 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:33:33,573 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:33:33,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:33:33,637 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:33:33,786 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-31 09:33:33,788 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:33:33,789 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 09:33:33,790 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 09:33:33,797 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 09:33:33,797 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 09:33:33,799 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 4 states. [2018-01-31 09:33:34,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:33:34,070 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2018-01-31 09:33:34,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-31 09:33:34,072 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-31 09:33:34,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:33:34,086 INFO L225 Difference]: With dead ends: 83 [2018-01-31 09:33:34,086 INFO L226 Difference]: Without dead ends: 65 [2018-01-31 09:33:34,092 INFO L554 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-31 09:33:34,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-31 09:33:34,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-01-31 09:33:34,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-01-31 09:33:34,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2018-01-31 09:33:34,135 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 15 [2018-01-31 09:33:34,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:33:34,135 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2018-01-31 09:33:34,136 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 09:33:34,136 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2018-01-31 09:33:34,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-31 09:33:34,137 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:33:34,137 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:33:34,137 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-01-31 09:33:34,137 INFO L82 PathProgramCache]: Analyzing trace with hash -780815604, now seen corresponding path program 1 times [2018-01-31 09:33:34,137 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:33:34,137 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:33:34,138 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:33:34,138 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:33:34,138 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:33:34,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:33:34,155 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:33:34,353 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-31 09:33:34,353 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:33:34,354 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 09:33:34,355 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:33:34,355 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:33:34,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:33:34,356 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 6 states. [2018-01-31 09:33:34,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:33:34,461 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2018-01-31 09:33:34,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 09:33:34,462 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-01-31 09:33:34,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:33:34,463 INFO L225 Difference]: With dead ends: 65 [2018-01-31 09:33:34,463 INFO L226 Difference]: Without dead ends: 64 [2018-01-31 09:33:34,464 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-31 09:33:34,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-31 09:33:34,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-01-31 09:33:34,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-31 09:33:34,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2018-01-31 09:33:34,471 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 15 [2018-01-31 09:33:34,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:33:34,471 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2018-01-31 09:33:34,472 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:33:34,472 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2018-01-31 09:33:34,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-31 09:33:34,472 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:33:34,473 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:33:34,473 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-01-31 09:33:34,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1564520289, now seen corresponding path program 1 times [2018-01-31 09:33:34,473 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:33:34,473 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:33:34,474 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:33:34,474 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:33:34,475 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:33:34,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:33:34,494 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:33:34,532 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-31 09:33:34,533 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:33:34,533 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 09:33:34,533 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 09:33:34,533 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 09:33:34,533 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 09:33:34,534 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand 4 states. [2018-01-31 09:33:34,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:33:34,671 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2018-01-31 09:33:34,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-31 09:33:34,672 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-31 09:33:34,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:33:34,673 INFO L225 Difference]: With dead ends: 64 [2018-01-31 09:33:34,673 INFO L226 Difference]: Without dead ends: 63 [2018-01-31 09:33:34,674 INFO L554 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-31 09:33:34,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-01-31 09:33:34,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-01-31 09:33:34,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-01-31 09:33:34,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2018-01-31 09:33:34,682 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 16 [2018-01-31 09:33:34,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:33:34,683 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2018-01-31 09:33:34,683 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 09:33:34,683 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2018-01-31 09:33:34,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-31 09:33:34,684 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:33:34,684 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:33:34,684 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-01-31 09:33:34,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1564520291, now seen corresponding path program 1 times [2018-01-31 09:33:34,684 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:33:34,684 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:33:34,685 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:33:34,685 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:33:34,685 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:33:34,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:33:34,701 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:33:34,768 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-31 09:33:34,768 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:33:34,768 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 09:33:34,769 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 09:33:34,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 09:33:34,769 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:33:34,769 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 5 states. [2018-01-31 09:33:34,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:33:34,925 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-01-31 09:33:34,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 09:33:34,926 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-01-31 09:33:34,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:33:34,927 INFO L225 Difference]: With dead ends: 63 [2018-01-31 09:33:34,927 INFO L226 Difference]: Without dead ends: 62 [2018-01-31 09:33:34,927 INFO L554 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-31 09:33:34,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-31 09:33:34,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-01-31 09:33:34,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-31 09:33:34,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2018-01-31 09:33:34,938 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 16 [2018-01-31 09:33:34,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:33:34,939 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2018-01-31 09:33:34,939 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 09:33:34,939 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2018-01-31 09:33:34,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-31 09:33:34,940 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:33:34,940 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:33:34,940 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-01-31 09:33:34,940 INFO L82 PathProgramCache]: Analyzing trace with hash -664631567, now seen corresponding path program 1 times [2018-01-31 09:33:34,941 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:33:34,941 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:33:34,942 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:33:34,942 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:33:34,942 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:33:34,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:33:34,986 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:33:35,296 WARN L146 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 19 DAG size of output 10 [2018-01-31 09:33:35,347 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-31 09:33:35,347 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:33:35,348 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 09:33:35,348 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:33:35,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:33:35,348 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:33:35,348 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand 6 states. [2018-01-31 09:33:35,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:33:35,579 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2018-01-31 09:33:35,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 09:33:35,580 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-31 09:33:35,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:33:35,580 INFO L225 Difference]: With dead ends: 62 [2018-01-31 09:33:35,581 INFO L226 Difference]: Without dead ends: 49 [2018-01-31 09:33:35,581 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:33:35,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-31 09:33:35,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-31 09:33:35,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-31 09:33:35,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-01-31 09:33:35,584 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 24 [2018-01-31 09:33:35,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:33:35,585 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-01-31 09:33:35,585 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:33:35,585 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-01-31 09:33:35,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-31 09:33:35,586 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:33:35,586 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:33:35,586 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-01-31 09:33:35,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1743904363, now seen corresponding path program 1 times [2018-01-31 09:33:35,586 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:33:35,587 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:33:35,587 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:33:35,588 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:33:35,588 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:33:35,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:33:35,600 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:33:35,665 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-31 09:33:35,665 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:33:35,665 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 09:33:35,666 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 09:33:35,666 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 09:33:35,666 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-31 09:33:35,666 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 7 states. [2018-01-31 09:33:35,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:33:35,777 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-01-31 09:33:35,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 09:33:35,779 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-01-31 09:33:35,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:33:35,780 INFO L225 Difference]: With dead ends: 49 [2018-01-31 09:33:35,780 INFO L226 Difference]: Without dead ends: 48 [2018-01-31 09:33:35,781 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 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-31 09:33:35,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-31 09:33:35,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-31 09:33:35,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-31 09:33:35,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-01-31 09:33:35,786 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 26 [2018-01-31 09:33:35,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:33:35,786 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-01-31 09:33:35,787 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 09:33:35,787 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-01-31 09:33:35,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-31 09:33:35,788 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:33:35,788 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:33:35,788 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-01-31 09:33:35,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1743904361, now seen corresponding path program 1 times [2018-01-31 09:33:35,788 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:33:35,788 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:33:35,789 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:33:35,789 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:33:35,789 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:33:35,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:33:35,801 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:33:35,993 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-31 09:33:35,994 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:33:35,994 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-31 09:33:35,994 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-31 09:33:35,994 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-31 09:33:35,994 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-31 09:33:35,994 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 10 states. [2018-01-31 09:33:36,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:33:36,344 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2018-01-31 09:33:36,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-31 09:33:36,345 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2018-01-31 09:33:36,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:33:36,346 INFO L225 Difference]: With dead ends: 54 [2018-01-31 09:33:36,346 INFO L226 Difference]: Without dead ends: 53 [2018-01-31 09:33:36,346 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2018-01-31 09:33:36,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-31 09:33:36,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2018-01-31 09:33:36,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-31 09:33:36,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-01-31 09:33:36,352 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 26 [2018-01-31 09:33:36,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:33:36,353 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-01-31 09:33:36,353 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-31 09:33:36,353 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-01-31 09:33:36,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-31 09:33:36,354 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:33:36,354 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:33:36,354 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-01-31 09:33:36,355 INFO L82 PathProgramCache]: Analyzing trace with hash 525505057, now seen corresponding path program 1 times [2018-01-31 09:33:36,355 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:33:36,355 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:33:36,356 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:33:36,356 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:33:36,356 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:33:36,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:33:36,367 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:33:36,511 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-31 09:33:36,511 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:33:36,511 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 09:33:36,511 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 09:33:36,511 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 09:33:36,512 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-31 09:33:36,512 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 7 states. [2018-01-31 09:33:36,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:33:36,625 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2018-01-31 09:33:36,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 09:33:36,625 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-01-31 09:33:36,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:33:36,626 INFO L225 Difference]: With dead ends: 55 [2018-01-31 09:33:36,626 INFO L226 Difference]: Without dead ends: 54 [2018-01-31 09:33:36,626 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-01-31 09:33:36,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-31 09:33:36,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2018-01-31 09:33:36,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-31 09:33:36,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-01-31 09:33:36,632 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 34 [2018-01-31 09:33:36,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:33:36,632 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-01-31 09:33:36,632 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 09:33:36,632 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-01-31 09:33:36,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-31 09:33:36,633 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:33:36,634 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:33:36,634 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-01-31 09:33:36,634 INFO L82 PathProgramCache]: Analyzing trace with hash 525505059, now seen corresponding path program 1 times [2018-01-31 09:33:36,634 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:33:36,634 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:33:36,635 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:33:36,635 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:33:36,635 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:33:36,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:33:36,647 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:33:36,852 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-31 09:33:36,853 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:33:36,853 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-31 09:33:36,853 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-31 09:33:36,853 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-31 09:33:36,854 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-01-31 09:33:36,854 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 10 states. [2018-01-31 09:33:37,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:33:37,027 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2018-01-31 09:33:37,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-31 09:33:37,027 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-01-31 09:33:37,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:33:37,029 INFO L225 Difference]: With dead ends: 58 [2018-01-31 09:33:37,029 INFO L226 Difference]: Without dead ends: 57 [2018-01-31 09:33:37,029 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-01-31 09:33:37,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-31 09:33:37,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2018-01-31 09:33:37,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-31 09:33:37,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-01-31 09:33:37,036 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 34 [2018-01-31 09:33:37,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:33:37,036 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-01-31 09:33:37,036 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-31 09:33:37,036 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-01-31 09:33:37,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-31 09:33:37,037 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:33:37,038 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:33:37,038 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-01-31 09:33:37,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1281144453, now seen corresponding path program 1 times [2018-01-31 09:33:37,039 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:33:37,039 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:33:37,040 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:33:37,040 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:33:37,040 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:33:37,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:33:37,057 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:33:37,549 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:33:37,550 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:33:37,550 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-31 09:33:37,564 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:33:37,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:33:37,614 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:33:37,665 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-31 09:33:37,666 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:33:37,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 09:33:37,722 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:24 [2018-01-31 09:33:37,774 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-31 09:33:37,777 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-31 09:33:37,777 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:33:37,780 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:33:37,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 09:33:37,787 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2018-01-31 09:33:38,215 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 20 treesize of output 16 [2018-01-31 09:33:38,228 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 16 treesize of output 13 [2018-01-31 09:33:38,228 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 09:33:38,237 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 09:33:38,251 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-31 09:33:38,251 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-01-31 09:33:38,435 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:33:38,456 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:33:38,470 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 25 [2018-01-31 09:33:38,470 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-31 09:33:38,471 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-31 09:33:38,471 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=583, Unknown=3, NotChecked=0, Total=650 [2018-01-31 09:33:38,471 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 26 states. [2018-01-31 09:33:39,495 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 75 DAG size of output 55 [2018-01-31 09:33:40,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:33:40,682 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2018-01-31 09:33:40,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-31 09:33:40,683 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 42 [2018-01-31 09:33:40,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:33:40,683 INFO L225 Difference]: With dead ends: 79 [2018-01-31 09:33:40,684 INFO L226 Difference]: Without dead ends: 78 [2018-01-31 09:33:40,684 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=243, Invalid=1394, Unknown=3, NotChecked=0, Total=1640 [2018-01-31 09:33:40,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-31 09:33:40,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2018-01-31 09:33:40,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-31 09:33:40,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2018-01-31 09:33:40,700 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 42 [2018-01-31 09:33:40,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:33:40,702 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2018-01-31 09:33:40,702 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-31 09:33:40,702 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2018-01-31 09:33:40,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-31 09:33:40,703 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:33:40,703 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:33:40,703 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-01-31 09:33:40,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1058368890, now seen corresponding path program 1 times [2018-01-31 09:33:40,704 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:33:40,704 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:33:40,705 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:33:40,705 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:33:40,705 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:33:40,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:33:40,732 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:33:41,264 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:33:41,265 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:33:41,265 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-31 09:33:41,270 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:33:41,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:33:41,311 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:33:41,328 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 14 treesize of output 12 [2018-01-31 09:33:41,342 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 12 treesize of output 15 [2018-01-31 09:33:41,357 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_arrayElimArr_1 term size 6 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:270) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:243) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:445) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:283) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:237) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:185) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackTraceAbstractionRefinementStrategy.getTraceCheck(MultiTrackTraceAbstractionRefinementStrategy.java:218) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-01-31 09:33:41,360 INFO L168 Benchmark]: Toolchain (without parser) took 51690.59 ms. Allocated memory was 304.6 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 263.3 MB in the beginning and 1.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 880.5 MB. Max. memory is 5.3 GB. [2018-01-31 09:33:41,361 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 304.6 MB. Free memory is still 269.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 09:33:41,361 INFO L168 Benchmark]: CACSL2BoogieTranslator took 318.22 ms. Allocated memory is still 304.6 MB. Free memory was 263.3 MB in the beginning and 253.4 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-31 09:33:41,362 INFO L168 Benchmark]: Boogie Preprocessor took 58.79 ms. Allocated memory is still 304.6 MB. Free memory was 253.4 MB in the beginning and 251.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-31 09:33:41,362 INFO L168 Benchmark]: RCFGBuilder took 623.47 ms. Allocated memory is still 304.6 MB. Free memory was 251.4 MB in the beginning and 230.4 MB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 5.3 GB. [2018-01-31 09:33:41,362 INFO L168 Benchmark]: IcfgTransformer took 42662.54 ms. Allocated memory was 304.6 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 230.4 MB in the beginning and 1.9 GB in the end (delta: -1.6 GB). Peak memory consumption was 246.9 MB. Max. memory is 5.3 GB. [2018-01-31 09:33:41,363 INFO L168 Benchmark]: TraceAbstraction took 8015.08 ms. Allocated memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 66.6 MB). Free memory was 1.9 GB in the beginning and 1.3 GB in the end (delta: 534.2 MB). Peak memory consumption was 600.8 MB. Max. memory is 5.3 GB. [2018-01-31 09:33:41,364 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 304.6 MB. Free memory is still 269.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 318.22 ms. Allocated memory is still 304.6 MB. Free memory was 263.3 MB in the beginning and 253.4 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 58.79 ms. Allocated memory is still 304.6 MB. Free memory was 253.4 MB in the beginning and 251.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 623.47 ms. Allocated memory is still 304.6 MB. Free memory was 251.4 MB in the beginning and 230.4 MB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 5.3 GB. * IcfgTransformer took 42662.54 ms. Allocated memory was 304.6 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 230.4 MB in the beginning and 1.9 GB in the end (delta: -1.6 GB). Peak memory consumption was 246.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 8015.08 ms. Allocated memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 66.6 MB). Free memory was 1.9 GB in the beginning and 1.3 GB in the end (delta: 534.2 MB). Peak memory consumption was 600.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 64 LocStat_MAX_WEQGRAPH_SIZE : 5 LocStat_MAX_SIZEOF_WEQEDGELABEL : 3 LocStat_NO_SUPPORTING_EQUALITIES : 1663 LocStat_NO_SUPPORTING_DISEQUALITIES : 957 LocStat_NO_DISJUNCTIONS : -128 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 85 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 148 TransStat_NO_SUPPORTING_DISEQUALITIES : 11 TransStat_NO_DISJUNCTIONS : 88 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.531071 RENAME_VARIABLES(MILLISECONDS) : 0.008658 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.784140 PROJECTAWAY(MILLISECONDS) : 0.846987 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.108502 DISJOIN(MILLISECONDS) : 0.316867 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.018834 ADD_EQUALITY(MILLISECONDS) : 0.010746 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.030626 #CONJOIN_DISJUNCTIVE : 675 #RENAME_VARIABLES : 1425 #UNFREEZE : 0 #CONJOIN : 924 #PROJECTAWAY : 835 #ADD_WEAK_EQUALITY : 11 #DISJOIN : 147 #RENAME_VARIABLES_DISJUNCTIVE : 1404 #ADD_EQUALITY : 150 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 9 * Results from de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: - StatisticsResult: HeapSeparatorStatistics #COUNT_NEW_ARRAY_VARS_[#memory_int] : 3 COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_0 : 3 COUNT_BLOCKS_for_[#memory_int]_at_dim_0 : 3 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.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimArr_1 term size 6 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimArr_1 term size 6: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-Benchmark-0-2018-01-31_09-33-41-374.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-VPDomainBenchmark-0-2018-01-31_09-33-41-374.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-BenchmarkWithCounters-0-2018-01-31_09-33-41-374.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-HeapSeparatorBenchmark-0-2018-01-31_09-33-41-374.csv Received shutdown request...