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-acfac67 [2018-01-28 23:35:55,107 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-28 23:35:55,121 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-28 23:35:55,133 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-28 23:35:55,134 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-28 23:35:55,135 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-28 23:35:55,136 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-28 23:35:55,137 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-28 23:35:55,139 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-28 23:35:55,140 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-28 23:35:55,141 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-28 23:35:55,141 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-28 23:35:55,142 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-28 23:35:55,143 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-28 23:35:55,144 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-28 23:35:55,147 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-28 23:35:55,149 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-28 23:35:55,151 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-28 23:35:55,152 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-28 23:35:55,153 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-28 23:35:55,155 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-28 23:35:55,156 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-28 23:35:55,156 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-28 23:35:55,157 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-28 23:35:55,157 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-28 23:35:55,159 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-28 23:35:55,159 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-28 23:35:55,159 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-28 23:35:55,160 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-28 23:35:55,160 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-28 23:35:55,160 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-28 23:35:55,161 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-28 23:35:55,171 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-28 23:35:55,171 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-28 23:35:55,172 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-28 23:35:55,172 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-28 23:35:55,172 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-28 23:35:55,172 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-28 23:35:55,173 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-28 23:35:55,173 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-28 23:35:55,173 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-28 23:35:55,174 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-28 23:35:55,174 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-28 23:35:55,174 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-28 23:35:55,174 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-28 23:35:55,175 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-28 23:35:55,175 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-28 23:35:55,175 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-28 23:35:55,175 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-28 23:35:55,175 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-28 23:35:55,175 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-28 23:35:55,176 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-28 23:35:55,176 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-28 23:35:55,176 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-28 23:35:55,176 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-28 23:35:55,176 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-28 23:35:55,177 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-28 23:35:55,177 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-28 23:35:55,177 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-28 23:35:55,177 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-28 23:35:55,178 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-28 23:35:55,178 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-28 23:35:55,178 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-28 23:35:55,178 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-28 23:35:55,179 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-28 23:35:55,179 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-28 23:35:55,214 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-28 23:35:55,226 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-28 23:35:55,230 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-28 23:35:55,231 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-28 23:35:55,232 INFO L276 PluginConnector]: CDTParser initialized [2018-01-28 23:35:55,232 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-28 23:35:55,404 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-28 23:35:55,410 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-01-28 23:35:55,411 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-28 23:35:55,411 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-28 23:35:55,417 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-28 23:35:55,417 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 11:35:55" (1/1) ... [2018-01-28 23:35:55,420 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@741a0bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:35:55, skipping insertion in model container [2018-01-28 23:35:55,420 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 11:35:55" (1/1) ... [2018-01-28 23:35:55,440 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 23:35:55,478 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 23:35:55,593 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 23:35:55,610 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 23:35:55,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:35:55 WrapperNode [2018-01-28 23:35:55,618 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-28 23:35:55,619 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-28 23:35:55,619 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-28 23:35:55,619 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-28 23:35:55,629 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:35:55" (1/1) ... [2018-01-28 23:35:55,629 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:35:55" (1/1) ... [2018-01-28 23:35:55,640 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:35:55" (1/1) ... [2018-01-28 23:35:55,640 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:35:55" (1/1) ... [2018-01-28 23:35:55,643 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:35:55" (1/1) ... [2018-01-28 23:35:55,646 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:35:55" (1/1) ... [2018-01-28 23:35:55,647 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:35:55" (1/1) ... [2018-01-28 23:35:55,648 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-28 23:35:55,649 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-28 23:35:55,649 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-28 23:35:55,649 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-28 23:35:55,650 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:35:55" (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-28 23:35:55,696 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-28 23:35:55,697 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-28 23:35:55,697 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrspn [2018-01-28 23:35:55,697 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-28 23:35:55,697 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-28 23:35:55,697 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-28 23:35:55,697 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-28 23:35:55,697 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-28 23:35:55,698 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-28 23:35:55,698 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-28 23:35:55,698 INFO L128 BoogieDeclarations]: Found specification of procedure cstrspn [2018-01-28 23:35:55,698 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-28 23:35:55,698 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-28 23:35:55,698 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-28 23:35:55,924 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-28 23:35:55,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 11:35:55 BoogieIcfgContainer [2018-01-28 23:35:55,925 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-28 23:35:55,926 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-01-28 23:35:55,926 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-01-28 23:35:55,927 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-01-28 23:35:55,931 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 11:35:55" (1/1) ... [2018-01-28 23:35:55,940 INFO L103 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-01-28 23:35:55,940 INFO L104 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-01-28 23:35:55,941 INFO L150 apSepIcfgTransformer]: starting freeze-var-style preprocessing [2018-01-28 23:35:56,008 INFO L218 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-01-28 23:35:56,073 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-28 23:36:17,116 INFO L311 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 40 variables. [2018-01-28 23:36:17,118 INFO L226 apSepIcfgTransformer]: finished equality analysis [2018-01-28 23:36:17,128 INFO L244 HeapSepPreAnalysis]: Number of read from array group [#memory_int] : 4 [2018-01-28 23:36:17,128 INFO L238 apSepIcfgTransformer]: Finished pre analysis before partitioning [2018-01-28 23:36:17,129 INFO L239 apSepIcfgTransformer]: array groups: Set: [#memory_int] [2018-01-28 23:36:17,129 INFO L241 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-28 23:36:17,147 INFO L544 PartitionManager]: partitioning result: [2018-01-28 23:36:17,147 INFO L549 PartitionManager]: location blocks for array group [#memory_int] [2018-01-28 23:36:17,147 INFO L558 PartitionManager]: at dimension 0 [2018-01-28 23:36:17,147 INFO L559 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-01-28 23:36:17,147 INFO L560 PartitionManager]: # location blocks :1 [2018-01-28 23:36:17,147 INFO L558 PartitionManager]: at dimension 1 [2018-01-28 23:36:17,147 INFO L559 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-01-28 23:36:17,148 INFO L560 PartitionManager]: # location blocks :1 [2018-01-28 23:36:17,148 INFO L86 ransitionTransformer]: executing heap partitioning transformation [2018-01-28 23:36:17,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 28.01 11:36:17 BasicIcfg [2018-01-28 23:36:17,164 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-01-28 23:36:17,165 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-28 23:36:17,165 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-28 23:36:17,234 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-28 23:36:17,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 11:35:55" (1/4) ... [2018-01-28 23:36:17,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@665ab3f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 11:36:17, skipping insertion in model container [2018-01-28 23:36:17,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:35:55" (2/4) ... [2018-01-28 23:36:17,236 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@665ab3f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 11:36:17, skipping insertion in model container [2018-01-28 23:36:17,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 11:35:55" (3/4) ... [2018-01-28 23:36:17,236 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@665ab3f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 11:36:17, skipping insertion in model container [2018-01-28 23:36:17,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 28.01 11:36:17" (4/4) ... [2018-01-28 23:36:17,238 INFO L107 eAbstractionObserver]: Analyzing ICFG HeapSeparatedIcfg [2018-01-28 23:36:17,245 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-28 23:36:17,250 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-28 23:36:17,282 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-28 23:36:17,283 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-28 23:36:17,283 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-28 23:36:17,283 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-28 23:36:17,283 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-28 23:36:17,283 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-28 23:36:17,284 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-28 23:36:17,284 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-28 23:36:17,285 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-28 23:36:17,296 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states. [2018-01-28 23:36:17,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-28 23:36:17,301 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:36:17,302 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 23:36:17,302 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-01-28 23:36:17,305 INFO L82 PathProgramCache]: Analyzing trace with hash -780815606, now seen corresponding path program 1 times [2018-01-28 23:36:17,307 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:36:17,307 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:36:17,347 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:36:17,347 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:36:17,347 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:36:17,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:36:17,398 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:36:17,489 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-28 23:36:17,492 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:36:17,492 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 23:36:17,493 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 23:36:17,501 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 23:36:17,502 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 23:36:17,504 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 4 states. [2018-01-28 23:36:17,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:36:17,636 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2018-01-28 23:36:17,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 23:36:17,638 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-28 23:36:17,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:36:17,650 INFO L225 Difference]: With dead ends: 83 [2018-01-28 23:36:17,651 INFO L226 Difference]: Without dead ends: 65 [2018-01-28 23:36:17,654 INFO L533 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-28 23:36:17,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-28 23:36:17,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-01-28 23:36:17,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-01-28 23:36:17,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2018-01-28 23:36:17,697 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 15 [2018-01-28 23:36:17,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:36:17,697 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2018-01-28 23:36:17,698 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 23:36:17,698 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2018-01-28 23:36:17,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-28 23:36:17,698 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:36:17,699 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 23:36:17,699 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-01-28 23:36:17,699 INFO L82 PathProgramCache]: Analyzing trace with hash -780815604, now seen corresponding path program 1 times [2018-01-28 23:36:17,699 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:36:17,699 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:36:17,700 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:36:17,700 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:36:17,701 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:36:17,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:36:17,716 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:36:17,846 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-28 23:36:17,846 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:36:17,846 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 23:36:17,848 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 23:36:17,848 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 23:36:17,849 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-28 23:36:17,849 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 6 states. [2018-01-28 23:36:17,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:36:17,924 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2018-01-28 23:36:17,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 23:36:17,924 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-01-28 23:36:17,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:36:17,925 INFO L225 Difference]: With dead ends: 65 [2018-01-28 23:36:17,925 INFO L226 Difference]: Without dead ends: 64 [2018-01-28 23:36:17,926 INFO L533 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-28 23:36:17,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-28 23:36:17,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-01-28 23:36:17,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-28 23:36:17,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2018-01-28 23:36:17,931 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 15 [2018-01-28 23:36:17,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:36:17,932 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2018-01-28 23:36:17,932 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 23:36:17,932 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2018-01-28 23:36:17,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-28 23:36:17,932 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:36:17,932 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 23:36:17,933 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-01-28 23:36:17,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1564520289, now seen corresponding path program 1 times [2018-01-28 23:36:17,933 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:36:17,933 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:36:17,934 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:36:17,934 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:36:17,934 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:36:17,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:36:17,946 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:36:17,972 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-28 23:36:17,972 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:36:17,972 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 23:36:17,973 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 23:36:17,973 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 23:36:17,973 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 23:36:17,973 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand 4 states. [2018-01-28 23:36:18,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:36:18,050 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2018-01-28 23:36:18,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 23:36:18,051 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-28 23:36:18,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:36:18,052 INFO L225 Difference]: With dead ends: 64 [2018-01-28 23:36:18,053 INFO L226 Difference]: Without dead ends: 63 [2018-01-28 23:36:18,053 INFO L533 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-28 23:36:18,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-01-28 23:36:18,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-01-28 23:36:18,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-01-28 23:36:18,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2018-01-28 23:36:18,060 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 16 [2018-01-28 23:36:18,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:36:18,060 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2018-01-28 23:36:18,061 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 23:36:18,061 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2018-01-28 23:36:18,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-28 23:36:18,062 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:36:18,062 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 23:36:18,062 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-01-28 23:36:18,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1564520291, now seen corresponding path program 1 times [2018-01-28 23:36:18,062 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:36:18,062 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:36:18,063 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:36:18,063 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:36:18,064 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:36:18,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:36:18,076 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:36:18,151 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-28 23:36:18,151 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:36:18,152 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 23:36:18,152 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 23:36:18,152 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 23:36:18,152 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 23:36:18,153 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 5 states. [2018-01-28 23:36:18,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:36:18,227 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-01-28 23:36:18,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 23:36:18,228 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-01-28 23:36:18,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:36:18,229 INFO L225 Difference]: With dead ends: 63 [2018-01-28 23:36:18,230 INFO L226 Difference]: Without dead ends: 62 [2018-01-28 23:36:18,230 INFO L533 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-28 23:36:18,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-28 23:36:18,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-01-28 23:36:18,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-28 23:36:18,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2018-01-28 23:36:18,237 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 16 [2018-01-28 23:36:18,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:36:18,237 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2018-01-28 23:36:18,237 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 23:36:18,237 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2018-01-28 23:36:18,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-28 23:36:18,238 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:36:18,238 INFO L330 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-28 23:36:18,239 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-01-28 23:36:18,239 INFO L82 PathProgramCache]: Analyzing trace with hash -664631567, now seen corresponding path program 1 times [2018-01-28 23:36:18,239 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:36:18,239 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:36:18,240 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:36:18,240 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:36:18,240 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:36:18,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:36:18,261 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:36:18,433 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-28 23:36:18,434 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:36:18,434 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 23:36:18,434 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 23:36:18,435 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 23:36:18,435 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 23:36:18,435 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand 6 states. [2018-01-28 23:36:18,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:36:18,661 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2018-01-28 23:36:18,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 23:36:18,662 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-28 23:36:18,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:36:18,663 INFO L225 Difference]: With dead ends: 62 [2018-01-28 23:36:18,663 INFO L226 Difference]: Without dead ends: 49 [2018-01-28 23:36:18,663 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-28 23:36:18,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-28 23:36:18,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-28 23:36:18,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-28 23:36:18,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-01-28 23:36:18,672 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 24 [2018-01-28 23:36:18,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:36:18,672 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-01-28 23:36:18,672 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 23:36:18,672 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-01-28 23:36:18,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-28 23:36:18,673 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:36:18,673 INFO L330 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-28 23:36:18,674 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-01-28 23:36:18,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1743904363, now seen corresponding path program 1 times [2018-01-28 23:36:18,674 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:36:18,674 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:36:18,675 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:36:18,675 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:36:18,676 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:36:18,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:36:18,687 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:36:18,749 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-28 23:36:18,749 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:36:18,749 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 23:36:18,749 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 23:36:18,750 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 23:36:18,750 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-28 23:36:18,750 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 7 states. [2018-01-28 23:36:18,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:36:18,852 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-01-28 23:36:18,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 23:36:18,856 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-01-28 23:36:18,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:36:18,856 INFO L225 Difference]: With dead ends: 49 [2018-01-28 23:36:18,857 INFO L226 Difference]: Without dead ends: 48 [2018-01-28 23:36:18,857 INFO L533 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-28 23:36:18,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-28 23:36:18,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-28 23:36:18,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-28 23:36:18,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-01-28 23:36:18,863 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 26 [2018-01-28 23:36:18,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:36:18,863 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-01-28 23:36:18,863 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-28 23:36:18,864 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-01-28 23:36:18,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-28 23:36:18,864 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:36:18,865 INFO L330 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-28 23:36:18,865 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-01-28 23:36:18,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1743904361, now seen corresponding path program 1 times [2018-01-28 23:36:18,865 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:36:18,865 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:36:18,866 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:36:18,866 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:36:18,866 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:36:18,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:36:18,879 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:36:19,000 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-28 23:36:19,001 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:36:19,001 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-28 23:36:19,001 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-28 23:36:19,001 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-28 23:36:19,001 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-28 23:36:19,002 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 10 states. [2018-01-28 23:36:19,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:36:19,136 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2018-01-28 23:36:19,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-28 23:36:19,136 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2018-01-28 23:36:19,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:36:19,137 INFO L225 Difference]: With dead ends: 54 [2018-01-28 23:36:19,137 INFO L226 Difference]: Without dead ends: 53 [2018-01-28 23:36:19,138 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2018-01-28 23:36:19,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-28 23:36:19,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2018-01-28 23:36:19,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-28 23:36:19,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-01-28 23:36:19,144 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 26 [2018-01-28 23:36:19,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:36:19,145 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-01-28 23:36:19,145 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-28 23:36:19,145 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-01-28 23:36:19,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-28 23:36:19,146 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:36:19,146 INFO L330 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-28 23:36:19,146 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-01-28 23:36:19,146 INFO L82 PathProgramCache]: Analyzing trace with hash 525505057, now seen corresponding path program 1 times [2018-01-28 23:36:19,146 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:36:19,146 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:36:19,147 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:36:19,147 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:36:19,147 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:36:19,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:36:19,159 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:36:19,205 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-28 23:36:19,205 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:36:19,205 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 23:36:19,205 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 23:36:19,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 23:36:19,206 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-28 23:36:19,206 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 7 states. [2018-01-28 23:36:19,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:36:19,263 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2018-01-28 23:36:19,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 23:36:19,264 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-01-28 23:36:19,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:36:19,265 INFO L225 Difference]: With dead ends: 55 [2018-01-28 23:36:19,265 INFO L226 Difference]: Without dead ends: 54 [2018-01-28 23:36:19,265 INFO L533 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-28 23:36:19,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-28 23:36:19,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2018-01-28 23:36:19,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-28 23:36:19,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-01-28 23:36:19,271 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 34 [2018-01-28 23:36:19,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:36:19,272 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-01-28 23:36:19,272 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-28 23:36:19,272 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-01-28 23:36:19,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-28 23:36:19,273 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:36:19,273 INFO L330 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-28 23:36:19,274 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-01-28 23:36:19,274 INFO L82 PathProgramCache]: Analyzing trace with hash 525505059, now seen corresponding path program 1 times [2018-01-28 23:36:19,274 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:36:19,274 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:36:19,275 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:36:19,275 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:36:19,275 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:36:19,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:36:19,288 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:36:19,401 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-28 23:36:19,401 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:36:19,401 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-28 23:36:19,401 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-28 23:36:19,402 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-28 23:36:19,402 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-01-28 23:36:19,402 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 10 states. [2018-01-28 23:36:19,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:36:19,502 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2018-01-28 23:36:19,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 23:36:19,502 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-01-28 23:36:19,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:36:19,503 INFO L225 Difference]: With dead ends: 58 [2018-01-28 23:36:19,503 INFO L226 Difference]: Without dead ends: 57 [2018-01-28 23:36:19,503 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-01-28 23:36:19,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-28 23:36:19,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2018-01-28 23:36:19,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-28 23:36:19,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-01-28 23:36:19,511 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 34 [2018-01-28 23:36:19,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:36:19,511 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-01-28 23:36:19,511 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-28 23:36:19,511 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-01-28 23:36:19,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-28 23:36:19,512 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:36:19,513 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 23:36:19,513 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-01-28 23:36:19,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1281144453, now seen corresponding path program 1 times [2018-01-28 23:36:19,513 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:36:19,513 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:36:19,514 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:36:19,514 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:36:19,514 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:36:19,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-28 23:36:19,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-28 23:36:19,568 INFO L389 BasicCegarLoop]: Counterexample might be feasible [2018-01-28 23:36:19,571 INFO L84 mationBacktranslator]: Skipped ATE [305] [305] ULTIMATE.startENTRY-->L1: Formula: true InVars {} OutVars{#NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] [2018-01-28 23:36:19,571 INFO L84 mationBacktranslator]: Skipped ATE [311] [311] L1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-01-28 23:36:19,572 INFO L84 mationBacktranslator]: Skipped ATE [317] [317] mainENTRY-->L553: Formula: (and (<= 0 (+ |v_main_#t~nondet4_1| 2147483648)) (<= |v_main_#t~nondet4_1| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] [2018-01-28 23:36:19,572 INFO L84 mationBacktranslator]: Skipped ATE [321] [321] L553-->L553': Formula: (= v_main_~length1~4_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_#t~nondet4=|v_main_#t~nondet4_2|, main_~length1~4=v_main_~length1~4_1} AuxVars[] AssignedVars[main_~length1~4] [2018-01-28 23:36:19,572 INFO L84 mationBacktranslator]: Skipped ATE [325] [325] L553'-->L554: Formula: true InVars {} OutVars{main_#t~nondet4=|v_main_#t~nondet4_3|} AuxVars[] AssignedVars[main_#t~nondet4] [2018-01-28 23:36:19,572 INFO L84 mationBacktranslator]: Skipped ATE [327] [327] L554-->L554': Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|} AuxVars[] AssignedVars[] [2018-01-28 23:36:19,572 INFO L84 mationBacktranslator]: Skipped ATE [329] [329] L554'-->L554'': Formula: (= v_main_~length2~4_1 |v_main_#t~nondet5_2|) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_#t~nondet5=|v_main_#t~nondet5_2|, main_~length2~4=v_main_~length2~4_1} AuxVars[] AssignedVars[main_~length2~4] [2018-01-28 23:36:19,572 INFO L84 mationBacktranslator]: Skipped ATE [331] [331] L554''-->L555: Formula: true InVars {} OutVars{main_#t~nondet5=|v_main_#t~nondet5_3|} AuxVars[] AssignedVars[main_#t~nondet5] [2018-01-28 23:36:19,572 INFO L84 mationBacktranslator]: Skipped ATE [335] [335] L555-->L555'': Formula: (not (< v_main_~length1~4_4 1)) InVars {main_~length1~4=v_main_~length1~4_4} OutVars{main_~length1~4=v_main_~length1~4_4} AuxVars[] AssignedVars[] [2018-01-28 23:36:19,573 INFO L84 mationBacktranslator]: Skipped ATE [341] [341] L555''-->L558': Formula: (not (< v_main_~length2~4_4 1)) InVars {main_~length2~4=v_main_~length2~4_4} OutVars{main_~length2~4=v_main_~length2~4_4} AuxVars[] AssignedVars[] [2018-01-28 23:36:19,573 INFO L84 mationBacktranslator]: Skipped ATE [345] [345] L558'-->L561: Formula: (and (not (= 0 |v_main_#t~malloc6.base_1|)) (= |v_#valid_7| (store |v_#valid_8| |v_main_#t~malloc6.base_1| 1)) (= |v_main_#t~malloc6.offset_1| 0) (= |v_#length_3| (store |v_#length_4| |v_main_#t~malloc6.base_1| v_main_~length1~4_5)) (= 0 (select |v_#valid_8| |v_main_#t~malloc6.base_1|))) InVars {#length=|v_#length_4|, main_~length1~4=v_main_~length1~4_5, #valid=|v_#valid_8|} OutVars{#length=|v_#length_3|, main_#t~malloc6.base=|v_main_#t~malloc6.base_1|, main_~length1~4=v_main_~length1~4_5, main_#t~malloc6.offset=|v_main_#t~malloc6.offset_1|, #valid=|v_#valid_7|} AuxVars[] AssignedVars[#valid, #length, main_#t~malloc6.base, main_#t~malloc6.offset] [2018-01-28 23:36:19,573 INFO L84 mationBacktranslator]: Skipped ATE [347] [347] L561-->L562: Formula: (and (= v_main_~nondetString1~4.base_1 |v_main_#t~malloc6.base_2|) (= v_main_~nondetString1~4.offset_1 |v_main_#t~malloc6.offset_2|)) InVars {main_#t~malloc6.offset=|v_main_#t~malloc6.offset_2|, main_#t~malloc6.base=|v_main_#t~malloc6.base_2|} OutVars{main_#t~malloc6.base=|v_main_#t~malloc6.base_2|, main_~nondetString1~4.offset=v_main_~nondetString1~4.offset_1, main_#t~malloc6.offset=|v_main_#t~malloc6.offset_2|, main_~nondetString1~4.base=v_main_~nondetString1~4.base_1} AuxVars[] AssignedVars[main_~nondetString1~4.base, main_~nondetString1~4.offset] [2018-01-28 23:36:19,573 INFO L84 mationBacktranslator]: Skipped ATE [349] [349] L562-->L562': Formula: (and (= |v_#length_5| (store |v_#length_6| |v_main_#t~malloc7.base_1| v_main_~length2~4_5)) (= (store |v_#valid_10| |v_main_#t~malloc7.base_1| 1) |v_#valid_9|) (not (= |v_main_#t~malloc7.base_1| 0)) (= 0 (select |v_#valid_10| |v_main_#t~malloc7.base_1|)) (= |v_main_#t~malloc7.offset_1| 0)) InVars {main_~length2~4=v_main_~length2~4_5, #length=|v_#length_6|, #valid=|v_#valid_10|} OutVars{main_~length2~4=v_main_~length2~4_5, #length=|v_#length_5|, main_#t~malloc7.base=|v_main_#t~malloc7.base_1|, main_#t~malloc7.offset=|v_main_#t~malloc7.offset_1|, #valid=|v_#valid_9|} AuxVars[] AssignedVars[main_#t~malloc7.offset, #valid, #length, main_#t~malloc7.base] [2018-01-28 23:36:19,573 INFO L84 mationBacktranslator]: Skipped ATE [351] [351] L562'-->L563: Formula: (and (= v_main_~nondetString2~4.offset_1 |v_main_#t~malloc7.offset_2|) (= v_main_~nondetString2~4.base_1 |v_main_#t~malloc7.base_2|)) InVars {main_#t~malloc7.offset=|v_main_#t~malloc7.offset_2|, main_#t~malloc7.base=|v_main_#t~malloc7.base_2|} OutVars{main_~nondetString2~4.offset=v_main_~nondetString2~4.offset_1, main_#t~malloc7.base=|v_main_#t~malloc7.base_2|, main_#t~malloc7.offset=|v_main_#t~malloc7.offset_2|, main_~nondetString2~4.base=v_main_~nondetString2~4.base_1} AuxVars[] AssignedVars[main_~nondetString2~4.offset, main_~nondetString2~4.base] [2018-01-28 23:36:19,573 INFO L84 mationBacktranslator]: Skipped ATE [353] [353] L563-->L563': Formula: (let ((.cse0 (+ v_main_~length1~4_6 v_main_~nondetString1~4.offset_2))) (and (= 1 (select |v_#valid_11| v_main_~nondetString1~4.base_2)) (<= 1 .cse0) (<= .cse0 (select |v_#length_7| v_main_~nondetString1~4.base_2)) (= |v_#memory_int_part_locs_0_locs_0_1| |v_#memory_int_part_locs_0_locs_0_2|))) InVars {#memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_1|, main_~length1~4=v_main_~length1~4_6, main_~nondetString1~4.base=v_main_~nondetString1~4.base_2, #valid=|v_#valid_11|, #length=|v_#length_7|, main_~nondetString1~4.offset=v_main_~nondetString1~4.offset_2} OutVars{#memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_2|, main_~length1~4=v_main_~length1~4_6, main_~nondetString1~4.base=v_main_~nondetString1~4.base_2, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, main_~nondetString1~4.offset=v_main_~nondetString1~4.offset_2} AuxVars[] AssignedVars[#memory_int_part_locs_0_locs_0, #memory_int] [2018-01-28 23:36:19,574 INFO L84 mationBacktranslator]: Skipped ATE [359] [359] L563'-->L564: Formula: (let ((.cse0 (+ v_main_~nondetString2~4.offset_2 v_main_~length2~4_6))) (and (<= .cse0 (select |v_#length_9| v_main_~nondetString2~4.base_2)) (= |v_#memory_int_part_locs_0_locs_0_3| |v_#memory_int_part_locs_0_locs_0_4|) (= (select |v_#valid_13| v_main_~nondetString2~4.base_2) 1) (<= 1 .cse0))) InVars {main_~nondetString2~4.offset=v_main_~nondetString2~4.offset_2, #memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_3|, #valid=|v_#valid_13|, main_~length2~4=v_main_~length2~4_6, #length=|v_#length_9|, main_~nondetString2~4.base=v_main_~nondetString2~4.base_2} OutVars{main_~nondetString2~4.offset=v_main_~nondetString2~4.offset_2, #memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_4|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, main_~length2~4=v_main_~length2~4_6, #length=|v_#length_9|, main_~nondetString2~4.base=v_main_~nondetString2~4.base_2} AuxVars[] AssignedVars[#memory_int_part_locs_0_locs_0, #memory_int] [2018-01-28 23:36:19,574 INFO L84 mationBacktranslator]: Skipped ATE [367] [367] L564-->cstrspnENTRY: Formula: (and (= |v_cstrspn_#in~s1.offsetInParam_1| v_main_~nondetString1~4.offset_5) (= |v_cstrspn_#in~s1.baseInParam_1| v_main_~nondetString1~4.base_6) (= |v_cstrspn_#in~s2.baseInParam_1| v_main_~nondetString2~4.base_6) (= |v_cstrspn_#in~s2.offsetInParam_1| v_main_~nondetString2~4.offset_5)) InVars {main_~nondetString2~4.offset=v_main_~nondetString2~4.offset_5, main_~nondetString1~4.offset=v_main_~nondetString1~4.offset_5, main_~nondetString1~4.base=v_main_~nondetString1~4.base_6, main_~nondetString2~4.base=v_main_~nondetString2~4.base_6} OutVars{cstrspn_#in~s1.offset=|v_cstrspn_#in~s1.offsetInParam_1|, cstrspn_#in~s2.base=|v_cstrspn_#in~s2.baseInParam_1|, cstrspn_#in~s2.offset=|v_cstrspn_#in~s2.offsetInParam_1|, cstrspn_#in~s1.base=|v_cstrspn_#in~s1.baseInParam_1|} AuxVars[] AssignedVars[cstrspn_#in~s1.offset, cstrspn_#in~s1.base, cstrspn_#in~s2.base, cstrspn_#in~s2.offset] [2018-01-28 23:36:19,574 INFO L84 mationBacktranslator]: Skipped ATE [371] [371] cstrspnENTRY-->L540: Formula: (and (= v_cstrspn_~s1.offset_2 |v_cstrspn_#in~s1.offset_1|) (= v_cstrspn_~s1.base_1 |v_cstrspn_#in~s1.base_1|)) InVars {cstrspn_#in~s1.offset=|v_cstrspn_#in~s1.offset_1|, cstrspn_#in~s1.base=|v_cstrspn_#in~s1.base_1|} OutVars{cstrspn_#in~s1.offset=|v_cstrspn_#in~s1.offset_1|, cstrspn_~s1.base=v_cstrspn_~s1.base_1, cstrspn_~s1.offset=v_cstrspn_~s1.offset_2, cstrspn_#in~s1.base=|v_cstrspn_#in~s1.base_1|} AuxVars[] AssignedVars[cstrspn_~s1.base, cstrspn_~s1.offset] [2018-01-28 23:36:19,574 INFO L84 mationBacktranslator]: Skipped ATE [375] [375] L540-->L543: Formula: (and (= v_cstrspn_~s2.base_1 |v_cstrspn_#in~s2.base_1|) (= v_cstrspn_~s2.offset_1 |v_cstrspn_#in~s2.offset_1|)) InVars {cstrspn_#in~s2.base=|v_cstrspn_#in~s2.base_1|, cstrspn_#in~s2.offset=|v_cstrspn_#in~s2.offset_1|} OutVars{cstrspn_#in~s2.base=|v_cstrspn_#in~s2.base_1|, cstrspn_#in~s2.offset=|v_cstrspn_#in~s2.offset_1|, cstrspn_~s2.base=v_cstrspn_~s2.base_1, cstrspn_~s2.offset=v_cstrspn_~s2.offset_1} AuxVars[] AssignedVars[cstrspn_~s2.base, cstrspn_~s2.offset] [2018-01-28 23:36:19,574 INFO L84 mationBacktranslator]: Skipped ATE [379] [379] L543-->L543': Formula: (and (= v_cstrspn_~p~2.base_1 v_cstrspn_~s1.base_2) (= v_cstrspn_~p~2.offset_2 v_cstrspn_~s1.offset_3)) InVars {cstrspn_~s1.offset=v_cstrspn_~s1.offset_3, cstrspn_~s1.base=v_cstrspn_~s1.base_2} OutVars{cstrspn_~p~2.offset=v_cstrspn_~p~2.offset_2, cstrspn_~s1.base=v_cstrspn_~s1.base_2, cstrspn_~s1.offset=v_cstrspn_~s1.offset_3, cstrspn_~p~2.base=v_cstrspn_~p~2.base_1} AuxVars[] AssignedVars[cstrspn_~p~2.offset, cstrspn_~p~2.base] [2018-01-28 23:36:19,574 INFO L84 mationBacktranslator]: Skipped ATE [383] [383] L543'-->L544: Formula: true InVars {} OutVars{cstrspn_~spanp~2.offset=v_cstrspn_~spanp~2.offset_3, cstrspn_~spanp~2.base=v_cstrspn_~spanp~2.base_3} AuxVars[] AssignedVars[cstrspn_~spanp~2.offset, cstrspn_~spanp~2.base] [2018-01-28 23:36:19,575 INFO L84 mationBacktranslator]: Skipped ATE [387] [387] L544-->L544': Formula: true InVars {} OutVars{cstrspn_~c~2=v_cstrspn_~c~2_3} AuxVars[] AssignedVars[cstrspn_~c~2] [2018-01-28 23:36:19,575 INFO L84 mationBacktranslator]: Skipped ATE [391] [391] L544'-->L549: Formula: true InVars {} OutVars{cstrspn_~sc~2=v_cstrspn_~sc~2_6} AuxVars[] AssignedVars[cstrspn_~sc~2] [2018-01-28 23:36:19,575 INFO L84 mationBacktranslator]: Skipped ATE [397] [397] L549-->L546: Formula: (and (= |v_cstrspn_#t~post0.offset_1| v_cstrspn_~p~2.offset_3) (= |v_cstrspn_#t~post0.base_1| v_cstrspn_~p~2.base_2)) InVars {cstrspn_~p~2.offset=v_cstrspn_~p~2.offset_3, cstrspn_~p~2.base=v_cstrspn_~p~2.base_2} OutVars{cstrspn_~p~2.offset=v_cstrspn_~p~2.offset_3, cstrspn_#t~post0.offset=|v_cstrspn_#t~post0.offset_1|, cstrspn_#t~post0.base=|v_cstrspn_#t~post0.base_1|, cstrspn_~p~2.base=v_cstrspn_~p~2.base_2} AuxVars[] AssignedVars[cstrspn_#t~post0.base, cstrspn_#t~post0.offset] [2018-01-28 23:36:19,575 INFO L84 mationBacktranslator]: Skipped ATE [399] [399] L546-->L546': Formula: (and (= v_cstrspn_~p~2.base_3 |v_cstrspn_#t~post0.base_2|) (= v_cstrspn_~p~2.offset_4 (+ |v_cstrspn_#t~post0.offset_2| 1))) InVars {cstrspn_#t~post0.offset=|v_cstrspn_#t~post0.offset_2|, cstrspn_#t~post0.base=|v_cstrspn_#t~post0.base_2|} OutVars{cstrspn_~p~2.offset=v_cstrspn_~p~2.offset_4, cstrspn_#t~post0.offset=|v_cstrspn_#t~post0.offset_2|, cstrspn_#t~post0.base=|v_cstrspn_#t~post0.base_2|, cstrspn_~p~2.base=v_cstrspn_~p~2.base_3} AuxVars[] AssignedVars[cstrspn_~p~2.offset, cstrspn_~p~2.base] [2018-01-28 23:36:19,575 INFO L84 mationBacktranslator]: Skipped ATE [401] [401] L546'-->L546'': Formula: (and (= (select (select |v_#memory_int_part_locs_0_locs_0_5| |v_cstrspn_#t~post0.base_3|) |v_cstrspn_#t~post0.offset_3|) |v_cstrspn_#t~mem1_1|) (= 1 (select |v_#valid_23| |v_cstrspn_#t~post0.base_3|)) (<= (+ |v_cstrspn_#t~post0.offset_3| 1) (select |v_#length_13| |v_cstrspn_#t~post0.base_3|)) (<= 0 |v_cstrspn_#t~post0.offset_3|)) InVars {#memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_5|, #length=|v_#length_13|, cstrspn_#t~post0.offset=|v_cstrspn_#t~post0.offset_3|, cstrspn_#t~post0.base=|v_cstrspn_#t~post0.base_3|, #valid=|v_#valid_23|} OutVars{#memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_5|, cstrspn_#t~mem1=|v_cstrspn_#t~mem1_1|, cstrspn_#t~post0.base=|v_cstrspn_#t~post0.base_3|, #valid=|v_#valid_23|, #length=|v_#length_13|, cstrspn_#t~post0.offset=|v_cstrspn_#t~post0.offset_3|} AuxVars[] AssignedVars[cstrspn_#t~mem1] [2018-01-28 23:36:19,575 INFO L84 mationBacktranslator]: Skipped ATE [407] [407] L546''-->L546''': Formula: (= v_cstrspn_~c~2_4 |v_cstrspn_#t~mem1_2|) InVars {cstrspn_#t~mem1=|v_cstrspn_#t~mem1_2|} OutVars{cstrspn_~c~2=v_cstrspn_~c~2_4, cstrspn_#t~mem1=|v_cstrspn_#t~mem1_2|} AuxVars[] AssignedVars[cstrspn_~c~2] [2018-01-28 23:36:19,575 INFO L84 mationBacktranslator]: Skipped ATE [409] [409] L546'''-->L546'''': Formula: true InVars {} OutVars{cstrspn_#t~post0.offset=|v_cstrspn_#t~post0.offset_5|, cstrspn_#t~post0.base=|v_cstrspn_#t~post0.base_6|} AuxVars[] AssignedVars[cstrspn_#t~post0.base, cstrspn_#t~post0.offset] [2018-01-28 23:36:19,576 INFO L84 mationBacktranslator]: Skipped ATE [411] [411] L546''''-->L547: Formula: true InVars {} OutVars{cstrspn_#t~mem1=|v_cstrspn_#t~mem1_3|} AuxVars[] AssignedVars[cstrspn_#t~mem1] [2018-01-28 23:36:19,576 INFO L84 mationBacktranslator]: Skipped ATE [413] [413] L547-->L547''''''''''': Formula: (and (= v_cstrspn_~spanp~2.offset_4 v_cstrspn_~s2.offset_2) (= v_cstrspn_~spanp~2.base_4 v_cstrspn_~s2.base_2)) InVars {cstrspn_~s2.offset=v_cstrspn_~s2.offset_2, cstrspn_~s2.base=v_cstrspn_~s2.base_2} OutVars{cstrspn_~spanp~2.offset=v_cstrspn_~spanp~2.offset_4, cstrspn_~s2.base=v_cstrspn_~s2.base_2, cstrspn_~s2.offset=v_cstrspn_~s2.offset_2, cstrspn_~spanp~2.base=v_cstrspn_~spanp~2.base_4} AuxVars[] AssignedVars[cstrspn_~spanp~2.offset, cstrspn_~spanp~2.base] [2018-01-28 23:36:19,576 INFO L84 mationBacktranslator]: Skipped ATE [415] [415] L547'''''''''''-->L547': Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-01-28 23:36:19,576 INFO L84 mationBacktranslator]: Skipped ATE [419] [419] L547'-->L547'': Formula: (and (= |v_cstrspn_#t~post2.base_1| v_cstrspn_~spanp~2.base_1) (= |v_cstrspn_#t~post2.offset_1| v_cstrspn_~spanp~2.offset_1)) InVars {cstrspn_~spanp~2.offset=v_cstrspn_~spanp~2.offset_1, cstrspn_~spanp~2.base=v_cstrspn_~spanp~2.base_1} OutVars{cstrspn_~spanp~2.offset=v_cstrspn_~spanp~2.offset_1, cstrspn_#t~post2.base=|v_cstrspn_#t~post2.base_1|, cstrspn_#t~post2.offset=|v_cstrspn_#t~post2.offset_1|, cstrspn_~spanp~2.base=v_cstrspn_~spanp~2.base_1} AuxVars[] AssignedVars[cstrspn_#t~post2.offset, cstrspn_#t~post2.base] [2018-01-28 23:36:19,576 INFO L84 mationBacktranslator]: Skipped ATE [423] [423] L547''-->L547''': Formula: (and (= v_cstrspn_~spanp~2.base_2 |v_cstrspn_#t~post2.base_2|) (= v_cstrspn_~spanp~2.offset_2 (+ |v_cstrspn_#t~post2.offset_2| 1))) InVars {cstrspn_#t~post2.base=|v_cstrspn_#t~post2.base_2|, cstrspn_#t~post2.offset=|v_cstrspn_#t~post2.offset_2|} OutVars{cstrspn_~spanp~2.offset=v_cstrspn_~spanp~2.offset_2, cstrspn_#t~post2.base=|v_cstrspn_#t~post2.base_2|, cstrspn_#t~post2.offset=|v_cstrspn_#t~post2.offset_2|, cstrspn_~spanp~2.base=v_cstrspn_~spanp~2.base_2} AuxVars[] AssignedVars[cstrspn_~spanp~2.offset, cstrspn_~spanp~2.base] [2018-01-28 23:36:19,576 INFO L84 mationBacktranslator]: Skipped ATE [427] [427] L547'''-->L547'''': Formula: (and (= 1 (select |v_#valid_21| |v_cstrspn_#t~post2.base_3|)) (= (select (select |v_#memory_int_part_locs_0_locs_0_6| |v_cstrspn_#t~post2.base_3|) |v_cstrspn_#t~post2.offset_3|) |v_cstrspn_#t~mem3_1|) (<= 0 |v_cstrspn_#t~post2.offset_3|) (<= (+ |v_cstrspn_#t~post2.offset_3| 1) (select |v_#length_11| |v_cstrspn_#t~post2.base_3|))) InVars {#memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_6|, cstrspn_#t~post2.base=|v_cstrspn_#t~post2.base_3|, #length=|v_#length_11|, cstrspn_#t~post2.offset=|v_cstrspn_#t~post2.offset_3|, #valid=|v_#valid_21|} OutVars{#memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_6|, cstrspn_#t~post2.offset=|v_cstrspn_#t~post2.offset_3|, #valid=|v_#valid_21|, cstrspn_#t~post2.base=|v_cstrspn_#t~post2.base_3|, #length=|v_#length_11|, cstrspn_#t~mem3=|v_cstrspn_#t~mem3_1|} AuxVars[] AssignedVars[cstrspn_#t~mem3] [2018-01-28 23:36:19,577 INFO L84 mationBacktranslator]: Skipped ATE [433] [433] L547''''-->L547''''': Formula: (= v_cstrspn_~sc~2_1 |v_cstrspn_#t~mem3_2|) InVars {cstrspn_#t~mem3=|v_cstrspn_#t~mem3_2|} OutVars{cstrspn_~sc~2=v_cstrspn_~sc~2_1, cstrspn_#t~mem3=|v_cstrspn_#t~mem3_2|} AuxVars[] AssignedVars[cstrspn_~sc~2] [2018-01-28 23:36:19,577 INFO L84 mationBacktranslator]: Skipped ATE [437] [437] L547'''''-->L547''''''''': Formula: (not (= 0 v_cstrspn_~sc~2_3)) InVars {cstrspn_~sc~2=v_cstrspn_~sc~2_3} OutVars{cstrspn_~sc~2=v_cstrspn_~sc~2_3} AuxVars[] AssignedVars[] [2018-01-28 23:36:19,577 INFO L84 mationBacktranslator]: Skipped ATE [441] [441] L547'''''''''-->L547'''''''''': Formula: true InVars {} OutVars{cstrspn_#t~post2.base=|v_cstrspn_#t~post2.base_7|, cstrspn_#t~post2.offset=|v_cstrspn_#t~post2.offset_6|} AuxVars[] AssignedVars[cstrspn_#t~post2.offset, cstrspn_#t~post2.base] [2018-01-28 23:36:19,577 INFO L84 mationBacktranslator]: Skipped ATE [445] [445] L547''''''''''-->L548: Formula: true InVars {} OutVars{cstrspn_#t~mem3=|v_cstrspn_#t~mem3_4|} AuxVars[] AssignedVars[cstrspn_#t~mem3] [2018-01-28 23:36:19,577 INFO L84 mationBacktranslator]: Skipped ATE [447] [447] L548-->L549: Formula: (= v_cstrspn_~c~2_1 v_cstrspn_~sc~2_4) InVars {cstrspn_~sc~2=v_cstrspn_~sc~2_4, cstrspn_~c~2=v_cstrspn_~c~2_1} OutVars{cstrspn_~sc~2=v_cstrspn_~sc~2_4, cstrspn_~c~2=v_cstrspn_~c~2_1} AuxVars[] AssignedVars[] [2018-01-28 23:36:19,577 INFO L84 mationBacktranslator]: Skipped ATE [397] [397] L549-->L546: Formula: (and (= |v_cstrspn_#t~post0.offset_1| v_cstrspn_~p~2.offset_3) (= |v_cstrspn_#t~post0.base_1| v_cstrspn_~p~2.base_2)) InVars {cstrspn_~p~2.offset=v_cstrspn_~p~2.offset_3, cstrspn_~p~2.base=v_cstrspn_~p~2.base_2} OutVars{cstrspn_~p~2.offset=v_cstrspn_~p~2.offset_3, cstrspn_#t~post0.offset=|v_cstrspn_#t~post0.offset_1|, cstrspn_#t~post0.base=|v_cstrspn_#t~post0.base_1|, cstrspn_~p~2.base=v_cstrspn_~p~2.base_2} AuxVars[] AssignedVars[cstrspn_#t~post0.base, cstrspn_#t~post0.offset] [2018-01-28 23:36:19,577 INFO L84 mationBacktranslator]: Skipped ATE [399] [399] L546-->L546': Formula: (and (= v_cstrspn_~p~2.base_3 |v_cstrspn_#t~post0.base_2|) (= v_cstrspn_~p~2.offset_4 (+ |v_cstrspn_#t~post0.offset_2| 1))) InVars {cstrspn_#t~post0.offset=|v_cstrspn_#t~post0.offset_2|, cstrspn_#t~post0.base=|v_cstrspn_#t~post0.base_2|} OutVars{cstrspn_~p~2.offset=v_cstrspn_~p~2.offset_4, cstrspn_#t~post0.offset=|v_cstrspn_#t~post0.offset_2|, cstrspn_#t~post0.base=|v_cstrspn_#t~post0.base_2|, cstrspn_~p~2.base=v_cstrspn_~p~2.base_3} AuxVars[] AssignedVars[cstrspn_~p~2.offset, cstrspn_~p~2.base] [2018-01-28 23:36:19,578 INFO L84 mationBacktranslator]: Skipped ATE [405] [405] L546'-->cstrspnErr1RequiresViolation: Formula: (or (not (<= (+ |v_cstrspn_#t~post0.offset_4| 1) (select |v_#length_14| |v_cstrspn_#t~post0.base_5|))) (not (<= 0 |v_cstrspn_#t~post0.offset_4|))) InVars {#length=|v_#length_14|, cstrspn_#t~post0.offset=|v_cstrspn_#t~post0.offset_4|, cstrspn_#t~post0.base=|v_cstrspn_#t~post0.base_5|} OutVars{#length=|v_#length_14|, cstrspn_#t~post0.offset=|v_cstrspn_#t~post0.offset_4|, cstrspn_#t~post0.base=|v_cstrspn_#t~post0.base_5|} AuxVars[] AssignedVars[] [2018-01-28 23:36:19,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 11:36:19 BasicIcfg [2018-01-28 23:36:19,584 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-28 23:36:19,585 INFO L168 Benchmark]: Toolchain (without parser) took 24180.32 ms. Allocated memory was 299.4 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 259.4 MB in the beginning and 1.3 GB in the end (delta: -1.0 GB). Peak memory consumption was 268.1 MB. Max. memory is 5.3 GB. [2018-01-28 23:36:19,586 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 299.4 MB. Free memory is still 265.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-28 23:36:19,586 INFO L168 Benchmark]: CACSL2BoogieTranslator took 207.30 ms. Allocated memory is still 299.4 MB. Free memory was 258.4 MB in the beginning and 248.4 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-28 23:36:19,586 INFO L168 Benchmark]: Boogie Preprocessor took 29.67 ms. Allocated memory is still 299.4 MB. Free memory was 248.4 MB in the beginning and 246.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-28 23:36:19,587 INFO L168 Benchmark]: RCFGBuilder took 276.80 ms. Allocated memory is still 299.4 MB. Free memory was 246.4 MB in the beginning and 226.7 MB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 5.3 GB. [2018-01-28 23:36:19,587 INFO L168 Benchmark]: IcfgTransformer took 21238.00 ms. Allocated memory was 299.4 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 226.7 MB in the beginning and 749.4 MB in the end (delta: -522.6 MB). Peak memory consumption was 607.7 MB. Max. memory is 5.3 GB. [2018-01-28 23:36:19,588 INFO L168 Benchmark]: TraceAbstraction took 2419.74 ms. Allocated memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: 173.0 MB). Free memory was 749.4 MB in the beginning and 1.3 GB in the end (delta: -545.4 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-28 23:36:19,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 299.4 MB. Free memory is still 265.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 207.30 ms. Allocated memory is still 299.4 MB. Free memory was 258.4 MB in the beginning and 248.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 29.67 ms. Allocated memory is still 299.4 MB. Free memory was 248.4 MB in the beginning and 246.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 276.80 ms. Allocated memory is still 299.4 MB. Free memory was 246.4 MB in the beginning and 226.7 MB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 5.3 GB. * IcfgTransformer took 21238.00 ms. Allocated memory was 299.4 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 226.7 MB in the beginning and 749.4 MB in the end (delta: -522.6 MB). Peak memory consumption was 607.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2419.74 ms. Allocated memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: 173.0 MB). Free memory was 749.4 MB in the beginning and 1.3 GB in the end (delta: -545.4 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 : 64 LocStat_MAX_WEQGRAPH_SIZE : 5 LocStat_MAX_SIZEOF_WEQEDGELABEL : 3 LocStat_NO_SUPPORTING_EQUALITIES : 975 LocStat_NO_SUPPORTING_DISEQUALITIES : 416 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 : 106 TransStat_NO_SUPPORTING_DISEQUALITIES : 11 TransStat_NO_DISJUNCTIONS : 88 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.507365 RENAME_VARIABLES(MILLISECONDS) : 0.009820 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.863556 PROJECTAWAY(MILLISECONDS) : 0.764441 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.055004 DISJOIN(MILLISECONDS) : 0.212965 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.019474 ADD_EQUALITY(MILLISECONDS) : 0.009003 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.006029 #CONJOIN_DISJUNCTIVE : 675 #RENAME_VARIABLES : 1425 #UNFREEZE : 0 #CONJOIN : 882 #PROJECTAWAY : 835 #ADD_WEAK_EQUALITY : 11 #DISJOIN : 147 #RENAME_VARIABLES_DISJUNCTIVE : 1404 #ADD_EQUALITY : 108 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 9 * Results from de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: - StatisticsResult: HeapSeparatorStatistics COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_0 : 1 COUNT_BLOCKS_for_[#memory_int]_at_dim_0 : 1 COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_1 : 1 COUNT_BLOCKS_for_[#memory_int]_at_dim_1 : 1 COUNT_ARRAY_READS for [#memory_int] : 4 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 69 locations, 9 error locations. UNSAFE Result, 2.3s OverallTime, 10 OverallIterations, 2 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 476 SDtfs, 397 SDslu, 1006 SDs, 0 SdLazy, 533 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 248 NumberOfCodeBlocks, 248 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 197 ConstructedInterpolants, 0 QuantifiedInterpolants, 23485 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! 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-28_23-36-19-597.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-28_23-36-19-597.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-28_23-36-19-597.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-28_23-36-19-597.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-TraceAbstractionBenchmarks-0-2018-01-28_23-36-19-597.csv Received shutdown request...