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/cstrcspn-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e [2018-01-31 09:21:15,716 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 09:21:15,718 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 09:21:15,740 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 09:21:15,740 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 09:21:15,741 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 09:21:15,742 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 09:21:15,746 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 09:21:15,748 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 09:21:15,749 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 09:21:15,757 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 09:21:15,757 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 09:21:15,758 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 09:21:15,759 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 09:21:15,760 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 09:21:15,766 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 09:21:15,768 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 09:21:15,772 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 09:21:15,773 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 09:21:15,776 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 09:21:15,778 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 09:21:15,778 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 09:21:15,779 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 09:21:15,781 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 09:21:15,781 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 09:21:15,782 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 09:21:15,783 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 09:21:15,783 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 09:21:15,783 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 09:21:15,784 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 09:21:15,788 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 09:21:15,788 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:21:15,801 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 09:21:15,802 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 09:21:15,804 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 09:21:15,805 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 09:21:15,805 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 09:21:15,805 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 09:21:15,805 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 09:21:15,806 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 09:21:15,806 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 09:21:15,806 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 09:21:15,806 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 09:21:15,806 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 09:21:15,807 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 09:21:15,807 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 09:21:15,807 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 09:21:15,808 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 09:21:15,808 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 09:21:15,808 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 09:21:15,808 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 09:21:15,808 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 09:21:15,809 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 09:21:15,809 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 09:21:15,809 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 09:21:15,809 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 09:21:15,809 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 09:21:15,809 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 09:21:15,810 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 09:21:15,810 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 09:21:15,810 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 09:21:15,810 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 09:21:15,810 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 09:21:15,810 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 09:21:15,813 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 09:21:15,813 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 09:21:15,848 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 09:21:15,859 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 09:21:15,862 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 09:21:15,863 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 09:21:15,863 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 09:21:15,864 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-01-31 09:21:16,068 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 09:21:16,074 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-01-31 09:21:16,075 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 09:21:16,076 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 09:21:16,082 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 09:21:16,084 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:21:16" (1/1) ... [2018-01-31 09:21:16,087 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52b312c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:21:16, skipping insertion in model container [2018-01-31 09:21:16,087 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:21:16" (1/1) ... [2018-01-31 09:21:16,108 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 09:21:16,168 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 09:21:16,335 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 09:21:16,356 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 09:21:16,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:21:16 WrapperNode [2018-01-31 09:21:16,373 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 09:21:16,376 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 09:21:16,377 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 09:21:16,377 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 09:21:16,394 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:21:16" (1/1) ... [2018-01-31 09:21:16,394 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:21:16" (1/1) ... [2018-01-31 09:21:16,408 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:21:16" (1/1) ... [2018-01-31 09:21:16,408 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:21:16" (1/1) ... [2018-01-31 09:21:16,413 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:21:16" (1/1) ... [2018-01-31 09:21:16,420 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:21:16" (1/1) ... [2018-01-31 09:21:16,423 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:21:16" (1/1) ... [2018-01-31 09:21:16,425 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 09:21:16,426 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 09:21:16,426 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 09:21:16,437 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 09:21:16,438 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:21:16" (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:21:16,508 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 09:21:16,508 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 09:21:16,509 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcspn [2018-01-31 09:21:16,509 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 09:21:16,509 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-31 09:21:16,509 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-31 09:21:16,509 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 09:21:16,509 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 09:21:16,509 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 09:21:16,510 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-31 09:21:16,510 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcspn [2018-01-31 09:21:16,510 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 09:21:16,511 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 09:21:16,511 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 09:21:17,118 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 09:21:17,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:21:17 BoogieIcfgContainer [2018-01-31 09:21:17,119 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 09:21:17,120 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-01-31 09:21:17,120 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-01-31 09:21:17,121 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-01-31 09:21:17,129 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:21:17" (1/1) ... [2018-01-31 09:21:17,140 INFO L103 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-01-31 09:21:17,140 INFO L104 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-01-31 09:21:17,141 INFO L150 apSepIcfgTransformer]: starting freeze-var-style preprocessing [2018-01-31 09:21:17,210 INFO L162 apSepIcfgTransformer]: finished StoreIndexFreezer, created 9 freeze vars and freeze var literals (each corresponds to one heap write) [2018-01-31 09:21:17,251 INFO L221 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-01-31 09:21:17,323 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-31 09:22:37,455 INFO L314 AbstractInterpreter]: Visited 101 different actions 1278 times. Merged at 67 different actions 776 times. Widened at 1 different actions 4 times. Found 107 fixpoints after 12 different actions. Largest state had 61 variables. [2018-01-31 09:22:37,458 INFO L229 apSepIcfgTransformer]: finished equality analysis [2018-01-31 09:22:37,479 INFO L244 HeapSepPreAnalysis]: Number of read from array group [#memory_int] : 7 [2018-01-31 09:22:37,481 INFO L241 apSepIcfgTransformer]: Finished pre analysis before partitioning [2018-01-31 09:22:37,482 INFO L242 apSepIcfgTransformer]: array groups: Set: [#memory_int] [2018-01-31 09:22:37,482 INFO L244 apSepIcfgTransformer]: select infos: Set: ((select (select |v_#memory_int_2| v_cstrcspn_~sc1~2.base_6) v_cstrcspn_~sc1~2.offset_5), at (SUMMARY for call #t~mem2 := read~int(~sc1~2.base, ~sc1~2.offset, 1); srcloc: L547)) ((select (select |v_#memory_int_5| v_cstrcspn_~s~2.base_11) v_cstrcspn_~s~2.offset_9), at (SUMMARY for call #t~mem7 := read~int(~s~2.base, ~s~2.offset, 1); srcloc: L548''''''''''''''')) ((select |v_#memory_int_11| 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: L566')) ((select |v_#memory_int_9| 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: L566)) ((select (select |v_#memory_int_1| v_cstrcspn_~sc1~2.base_3) v_cstrcspn_~sc1~2.offset_3), at (SUMMARY for call #t~mem1 := read~int(~sc1~2.base, ~sc1~2.offset, 1); srcloc: L545')) ((select (select |v_#memory_int_4| v_cstrcspn_~s~2.base_6) v_cstrcspn_~s~2.offset_5), at (SUMMARY for call #t~mem4 := read~int(~s~2.base, ~s~2.offset, 1); srcloc: L548''')) ((select (select |v_#memory_int_3| v_cstrcspn_~s~2.base_3) v_cstrcspn_~s~2.offset_3), at (SUMMARY for call #t~mem3 := read~int(~s~2.base, ~s~2.offset, 1); srcloc: L548)) [2018-01-31 09:22:37,531 INFO L547 PartitionManager]: partitioning result: [2018-01-31 09:22:37,531 INFO L552 PartitionManager]: location blocks for array group [#memory_int] [2018-01-31 09:22:37,532 INFO L562 PartitionManager]: at dimension 0 [2018-01-31 09:22:37,532 INFO L563 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 3 [2018-01-31 09:22:37,532 INFO L564 PartitionManager]: # location blocks :3 [2018-01-31 09:22:37,532 INFO L562 PartitionManager]: at dimension 1 [2018-01-31 09:22:37,532 INFO L563 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 2 [2018-01-31 09:22:37,533 INFO L564 PartitionManager]: # location blocks :1 [2018-01-31 09:22:37,533 INFO L86 ransitionTransformer]: executing heap partitioning transformation [2018-01-31 09:22:37,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 09:22:37 BasicIcfg [2018-01-31 09:22:37,571 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-01-31 09:22:37,572 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 09:22:37,572 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 09:22:37,661 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 09:22:37,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 09:21:16" (1/4) ... [2018-01-31 09:22:37,663 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b3921b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:22:37, skipping insertion in model container [2018-01-31 09:22:37,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:21:16" (2/4) ... [2018-01-31 09:22:37,663 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b3921b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:22:37, skipping insertion in model container [2018-01-31 09:22:37,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:21:17" (3/4) ... [2018-01-31 09:22:37,664 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b3921b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 09:22:37, skipping insertion in model container [2018-01-31 09:22:37,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 09:22:37" (4/4) ... [2018-01-31 09:22:37,668 INFO L107 eAbstractionObserver]: Analyzing ICFG HeapSeparatedIcfg [2018-01-31 09:22:37,677 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 09:22:37,689 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-31 09:22:37,736 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 09:22:37,737 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 09:22:37,737 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 09:22:37,737 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 09:22:37,737 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 09:22:37,737 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 09:22:37,738 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 09:22:37,738 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 09:22:37,739 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 09:22:37,757 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states. [2018-01-31 09:22:37,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-31 09:22:37,764 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:22:37,765 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:22:37,765 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 09:22:37,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1050940434, now seen corresponding path program 1 times [2018-01-31 09:22:37,772 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:22:37,773 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:22:37,829 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:22:37,829 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:22:37,829 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:22:37,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:22:37,900 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:22:38,023 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:22:38,025 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:22:38,026 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 09:22:38,027 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 09:22:38,035 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 09:22:38,035 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 09:22:38,038 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 4 states. [2018-01-31 09:22:38,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:22:38,275 INFO L93 Difference]: Finished difference Result 149 states and 164 transitions. [2018-01-31 09:22:38,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-31 09:22:38,276 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-31 09:22:38,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:22:38,285 INFO L225 Difference]: With dead ends: 149 [2018-01-31 09:22:38,285 INFO L226 Difference]: Without dead ends: 87 [2018-01-31 09:22:38,288 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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:22:38,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-31 09:22:38,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-01-31 09:22:38,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-31 09:22:38,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2018-01-31 09:22:38,327 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 15 [2018-01-31 09:22:38,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:22:38,328 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2018-01-31 09:22:38,328 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 09:22:38,328 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2018-01-31 09:22:38,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-31 09:22:38,328 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:22:38,329 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:22:38,329 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 09:22:38,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1050940432, now seen corresponding path program 1 times [2018-01-31 09:22:38,331 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:22:38,331 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:22:38,332 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:22:38,332 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:22:38,332 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:22:38,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:22:38,358 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:22:38,607 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:22:38,607 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:22:38,608 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 09:22:38,609 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:22:38,609 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:22:38,609 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:22:38,610 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand 6 states. [2018-01-31 09:22:38,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:22:38,800 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2018-01-31 09:22:38,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 09:22:38,801 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-01-31 09:22:38,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:22:38,802 INFO L225 Difference]: With dead ends: 87 [2018-01-31 09:22:38,802 INFO L226 Difference]: Without dead ends: 86 [2018-01-31 09:22:38,803 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-31 09:22:38,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-31 09:22:38,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-01-31 09:22:38,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-31 09:22:38,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2018-01-31 09:22:38,812 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 15 [2018-01-31 09:22:38,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:22:38,812 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2018-01-31 09:22:38,812 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:22:38,812 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2018-01-31 09:22:38,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-31 09:22:38,813 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:22:38,813 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:22:38,813 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 09:22:38,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1780585313, now seen corresponding path program 1 times [2018-01-31 09:22:38,814 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:22:38,814 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:22:38,815 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:22:38,815 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:22:38,815 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:22:38,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:22:38,827 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:22:38,919 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:22:38,920 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:22:38,920 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 09:22:38,920 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 09:22:38,921 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 09:22:38,921 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 09:22:38,921 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand 4 states. [2018-01-31 09:22:39,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:22:39,256 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2018-01-31 09:22:39,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-31 09:22:39,257 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-31 09:22:39,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:22:39,258 INFO L225 Difference]: With dead ends: 86 [2018-01-31 09:22:39,258 INFO L226 Difference]: Without dead ends: 85 [2018-01-31 09:22:39,258 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:22:39,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-31 09:22:39,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-01-31 09:22:39,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-31 09:22:39,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2018-01-31 09:22:39,273 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 16 [2018-01-31 09:22:39,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:22:39,274 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2018-01-31 09:22:39,274 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 09:22:39,274 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2018-01-31 09:22:39,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-31 09:22:39,275 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:22:39,275 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:22:39,275 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 09:22:39,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1780585315, now seen corresponding path program 1 times [2018-01-31 09:22:39,276 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:22:39,276 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:22:39,277 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:22:39,277 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:22:39,277 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:22:39,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:22:39,288 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:22:39,614 WARN L146 SmtUtils]: Spent 261ms on a formula simplification. DAG size of input: 15 DAG size of output 11 [2018-01-31 09:22:39,615 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:22:39,615 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:22:39,615 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 09:22:39,616 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 09:22:39,616 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 09:22:39,616 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:22:39,616 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand 5 states. [2018-01-31 09:22:39,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:22:39,691 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2018-01-31 09:22:39,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 09:22:39,692 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-01-31 09:22:39,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:22:39,693 INFO L225 Difference]: With dead ends: 85 [2018-01-31 09:22:39,694 INFO L226 Difference]: Without dead ends: 84 [2018-01-31 09:22:39,694 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:22:39,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-31 09:22:39,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-01-31 09:22:39,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-31 09:22:39,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2018-01-31 09:22:39,703 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 16 [2018-01-31 09:22:39,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:22:39,703 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2018-01-31 09:22:39,703 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 09:22:39,704 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2018-01-31 09:22:39,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-31 09:22:39,704 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:22:39,704 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] [2018-01-31 09:22:39,704 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 09:22:39,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1247887850, now seen corresponding path program 1 times [2018-01-31 09:22:39,705 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:22:39,705 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:22:39,706 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:22:39,706 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:22:39,706 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:22:39,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:22:39,722 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:22:39,789 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:22:39,789 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:22:39,790 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 09:22:39,790 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:22:39,790 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:22:39,790 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:22:39,790 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand 6 states. [2018-01-31 09:22:39,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:22:39,916 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2018-01-31 09:22:39,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 09:22:39,917 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-31 09:22:39,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:22:39,918 INFO L225 Difference]: With dead ends: 88 [2018-01-31 09:22:39,918 INFO L226 Difference]: Without dead ends: 86 [2018-01-31 09:22:39,918 INFO L554 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-31 09:22:39,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-31 09:22:39,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2018-01-31 09:22:39,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-31 09:22:39,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 93 transitions. [2018-01-31 09:22:39,926 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 93 transitions. Word has length 25 [2018-01-31 09:22:39,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:22:39,926 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 93 transitions. [2018-01-31 09:22:39,926 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:22:39,926 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2018-01-31 09:22:39,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-31 09:22:39,927 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:22:39,928 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] [2018-01-31 09:22:39,928 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 09:22:39,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1247887852, now seen corresponding path program 1 times [2018-01-31 09:22:39,928 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:22:39,928 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:22:39,929 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:22:39,929 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:22:39,929 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:22:39,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:22:39,942 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:22:40,064 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:22:40,064 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:22:40,065 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-31 09:22:40,065 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 09:22:40,065 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 09:22:40,065 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-31 09:22:40,066 INFO L87 Difference]: Start difference. First operand 85 states and 93 transitions. Second operand 9 states. [2018-01-31 09:22:40,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:22:40,394 INFO L93 Difference]: Finished difference Result 126 states and 137 transitions. [2018-01-31 09:22:40,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-31 09:22:40,395 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-01-31 09:22:40,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:22:40,398 INFO L225 Difference]: With dead ends: 126 [2018-01-31 09:22:40,398 INFO L226 Difference]: Without dead ends: 124 [2018-01-31 09:22:40,399 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-01-31 09:22:40,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-31 09:22:40,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 89. [2018-01-31 09:22:40,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-31 09:22:40,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2018-01-31 09:22:40,410 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 25 [2018-01-31 09:22:40,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:22:40,410 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2018-01-31 09:22:40,410 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 09:22:40,410 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2018-01-31 09:22:40,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-31 09:22:40,413 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:22:40,413 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] [2018-01-31 09:22:40,413 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 09:22:40,413 INFO L82 PathProgramCache]: Analyzing trace with hash -456998170, now seen corresponding path program 1 times [2018-01-31 09:22:40,414 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:22:40,414 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:22:40,415 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:22:40,415 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:22:40,415 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:22:40,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:22:40,428 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:22:40,594 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:22:40,595 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:22:40,595 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 09:22:40,595 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:22:40,595 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:22:40,595 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:22:40,596 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand 6 states. [2018-01-31 09:22:40,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:22:40,899 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2018-01-31 09:22:40,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 09:22:40,899 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-31 09:22:40,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:22:40,900 INFO L225 Difference]: With dead ends: 89 [2018-01-31 09:22:40,900 INFO L226 Difference]: Without dead ends: 74 [2018-01-31 09:22:40,900 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:22:40,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-31 09:22:40,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-01-31 09:22:40,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-31 09:22:40,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2018-01-31 09:22:40,907 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 25 [2018-01-31 09:22:40,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:22:40,907 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2018-01-31 09:22:40,907 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:22:40,907 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2018-01-31 09:22:40,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-31 09:22:40,908 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:22:40,908 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] [2018-01-31 09:22:40,908 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 09:22:40,909 INFO L82 PathProgramCache]: Analyzing trace with hash 392251896, now seen corresponding path program 1 times [2018-01-31 09:22:40,909 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:22:40,909 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:22:40,910 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:22:40,910 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:22:40,910 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:22:40,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:22:40,924 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:22:40,976 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:22:40,976 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:22:40,976 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 09:22:40,976 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:22:40,977 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:22:40,977 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:22:40,977 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand 6 states. [2018-01-31 09:22:41,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:22:41,085 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2018-01-31 09:22:41,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 09:22:41,085 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-01-31 09:22:41,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:22:41,086 INFO L225 Difference]: With dead ends: 78 [2018-01-31 09:22:41,086 INFO L226 Difference]: Without dead ends: 75 [2018-01-31 09:22:41,087 INFO L554 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-31 09:22:41,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-31 09:22:41,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2018-01-31 09:22:41,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-31 09:22:41,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2018-01-31 09:22:41,097 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 33 [2018-01-31 09:22:41,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:22:41,097 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2018-01-31 09:22:41,097 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:22:41,097 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2018-01-31 09:22:41,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-31 09:22:41,098 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:22:41,098 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] [2018-01-31 09:22:41,099 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 09:22:41,099 INFO L82 PathProgramCache]: Analyzing trace with hash 392251898, now seen corresponding path program 1 times [2018-01-31 09:22:41,099 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:22:41,099 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:22:41,100 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:22:41,100 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:22:41,100 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:22:41,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:22:41,113 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:22:41,305 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:22:41,305 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:22:41,306 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-31 09:22:41,306 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 09:22:41,306 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 09:22:41,306 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-31 09:22:41,306 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 9 states. [2018-01-31 09:22:41,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:22:41,402 INFO L93 Difference]: Finished difference Result 103 states and 110 transitions. [2018-01-31 09:22:41,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 09:22:41,403 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-01-31 09:22:41,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:22:41,404 INFO L225 Difference]: With dead ends: 103 [2018-01-31 09:22:41,404 INFO L226 Difference]: Without dead ends: 100 [2018-01-31 09:22:41,404 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-01-31 09:22:41,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-01-31 09:22:41,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 83. [2018-01-31 09:22:41,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-31 09:22:41,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2018-01-31 09:22:41,411 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 33 [2018-01-31 09:22:41,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:22:41,412 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2018-01-31 09:22:41,412 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 09:22:41,412 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2018-01-31 09:22:41,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-31 09:22:41,413 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:22:41,413 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:22:41,413 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 09:22:41,414 INFO L82 PathProgramCache]: Analyzing trace with hash -378168851, now seen corresponding path program 1 times [2018-01-31 09:22:41,414 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:22:41,414 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:22:41,415 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:22:41,415 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:22:41,415 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:22:41,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:22:41,427 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:22:41,501 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:22:41,501 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:22:41,501 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 09:22:41,502 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-31 09:22:41,502 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-31 09:22:41,502 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 09:22:41,502 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand 3 states. [2018-01-31 09:22:41,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:22:41,620 INFO L93 Difference]: Finished difference Result 133 states and 146 transitions. [2018-01-31 09:22:41,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-31 09:22:41,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-01-31 09:22:41,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:22:41,629 INFO L225 Difference]: With dead ends: 133 [2018-01-31 09:22:41,630 INFO L226 Difference]: Without dead ends: 85 [2018-01-31 09:22:41,630 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 09:22:41,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-31 09:22:41,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-01-31 09:22:41,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-31 09:22:41,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2018-01-31 09:22:41,636 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 44 [2018-01-31 09:22:41,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:22:41,637 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2018-01-31 09:22:41,637 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-31 09:22:41,637 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2018-01-31 09:22:41,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-31 09:22:41,646 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:22:41,646 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:22:41,646 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 09:22:41,646 INFO L82 PathProgramCache]: Analyzing trace with hash 164873217, now seen corresponding path program 1 times [2018-01-31 09:22:41,647 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:22:41,647 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:22:41,647 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:22:41,648 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:22:41,648 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:22:41,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:22:41,672 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:22:41,819 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-31 09:22:41,819 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:22:41,820 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 09:22:41,820 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 09:22:41,820 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 09:22:41,820 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-31 09:22:41,821 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand 7 states. [2018-01-31 09:22:41,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:22:41,939 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2018-01-31 09:22:41,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 09:22:41,940 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2018-01-31 09:22:41,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:22:41,941 INFO L225 Difference]: With dead ends: 85 [2018-01-31 09:22:41,941 INFO L226 Difference]: Without dead ends: 84 [2018-01-31 09:22:41,941 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 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:22:41,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-31 09:22:41,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-01-31 09:22:41,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-31 09:22:41,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2018-01-31 09:22:41,948 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 46 [2018-01-31 09:22:41,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:22:41,949 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2018-01-31 09:22:41,949 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 09:22:41,949 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2018-01-31 09:22:41,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-31 09:22:41,950 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:22:41,950 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:22:41,950 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 09:22:41,950 INFO L82 PathProgramCache]: Analyzing trace with hash 164873219, now seen corresponding path program 1 times [2018-01-31 09:22:41,950 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:22:41,950 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:22:41,951 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:22:41,951 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:22:41,952 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:22:41,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:22:41,969 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:22:42,258 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-31 09:22:42,258 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:22:42,259 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:22:42,265 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:22:42,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:22:42,344 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:22:42,525 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:22:42,528 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:22:42,571 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:22:42,574 INFO L168 Benchmark]: Toolchain (without parser) took 86505.27 ms. Allocated memory was 305.7 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 265.4 MB in the beginning and 1.7 GB in the end (delta: -1.4 GB). Peak memory consumption was 488.9 MB. Max. memory is 5.3 GB. [2018-01-31 09:22:42,575 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 305.7 MB. Free memory is still 271.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 09:22:42,575 INFO L168 Benchmark]: CACSL2BoogieTranslator took 300.64 ms. Allocated memory is still 305.7 MB. Free memory was 264.4 MB in the beginning and 254.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:22:42,576 INFO L168 Benchmark]: Boogie Preprocessor took 48.87 ms. Allocated memory is still 305.7 MB. Free memory was 254.4 MB in the beginning and 252.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:22:42,584 INFO L168 Benchmark]: RCFGBuilder took 693.66 ms. Allocated memory is still 305.7 MB. Free memory was 252.4 MB in the beginning and 229.4 MB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 5.3 GB. [2018-01-31 09:22:42,585 INFO L168 Benchmark]: IcfgTransformer took 80451.99 ms. Allocated memory was 305.7 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 229.4 MB in the beginning and 927.1 MB in the end (delta: -697.7 MB). Peak memory consumption was 1.2 GB. Max. memory is 5.3 GB. [2018-01-31 09:22:42,585 INFO L168 Benchmark]: TraceAbstraction took 5001.11 ms. Allocated memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 88.1 MB). Free memory was 927.1 MB in the beginning and 1.7 GB in the end (delta: -787.7 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 09:22:42,589 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.18 ms. Allocated memory is still 305.7 MB. Free memory is still 271.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 300.64 ms. Allocated memory is still 305.7 MB. Free memory was 264.4 MB in the beginning and 254.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 48.87 ms. Allocated memory is still 305.7 MB. Free memory was 254.4 MB in the beginning and 252.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 693.66 ms. Allocated memory is still 305.7 MB. Free memory was 252.4 MB in the beginning and 229.4 MB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 5.3 GB. * IcfgTransformer took 80451.99 ms. Allocated memory was 305.7 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 229.4 MB in the beginning and 927.1 MB in the end (delta: -697.7 MB). Peak memory consumption was 1.2 GB. Max. memory is 5.3 GB. * TraceAbstraction took 5001.11 ms. Allocated memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 88.1 MB). Free memory was 927.1 MB in the beginning and 1.7 GB in the end (delta: -787.7 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 : 83 LocStat_MAX_WEQGRAPH_SIZE : 5 LocStat_MAX_SIZEOF_WEQEDGELABEL : 3 LocStat_NO_SUPPORTING_EQUALITIES : 2474 LocStat_NO_SUPPORTING_DISEQUALITIES : 1424 LocStat_NO_DISJUNCTIONS : -166 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 110 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 170 TransStat_NO_SUPPORTING_DISEQUALITIES : 16 TransStat_NO_DISJUNCTIONS : 117 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 4.531674 RENAME_VARIABLES(MILLISECONDS) : 0.259994 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 2.249684 PROJECTAWAY(MILLISECONDS) : 0.028509 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.057069 DISJOIN(MILLISECONDS) : 0.416245 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.281886 ADD_EQUALITY(MILLISECONDS) : 0.022448 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.004897 #CONJOIN_DISJUNCTIVE : 1908 #RENAME_VARIABLES : 4155 #UNFREEZE : 0 #CONJOIN : 2490 #PROJECTAWAY : 2226 #ADD_WEAK_EQUALITY : 11 #DISJOIN : 393 #RENAME_VARIABLES_DISJUNCTIVE : 3999 #ADD_EQUALITY : 172 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 14 * 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] : 7 * 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/cstrcspn-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-22-42-600.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcspn-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-22-42-600.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcspn-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-22-42-600.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcspn-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-22-42-600.csv Received shutdown request...