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_cstrcspn-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-acfac67 [2018-01-28 23:32:09,766 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-28 23:32:09,768 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-28 23:32:09,782 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-28 23:32:09,783 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-28 23:32:09,784 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-28 23:32:09,785 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-28 23:32:09,787 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-28 23:32:09,789 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-28 23:32:09,790 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-28 23:32:09,790 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-28 23:32:09,790 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-28 23:32:09,791 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-28 23:32:09,792 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-28 23:32:09,793 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-28 23:32:09,795 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-28 23:32:09,798 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-28 23:32:09,800 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-28 23:32:09,801 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-28 23:32:09,802 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-28 23:32:09,804 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-28 23:32:09,805 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-28 23:32:09,805 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-28 23:32:09,806 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-28 23:32:09,807 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-28 23:32:09,808 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-28 23:32:09,808 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-28 23:32:09,809 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-28 23:32:09,809 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-28 23:32:09,809 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-28 23:32:09,810 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-28 23:32:09,810 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:32:09,820 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-28 23:32:09,820 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-28 23:32:09,821 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-28 23:32:09,821 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-28 23:32:09,821 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-28 23:32:09,822 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-28 23:32:09,822 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-28 23:32:09,822 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-28 23:32:09,823 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-28 23:32:09,823 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-28 23:32:09,823 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-28 23:32:09,823 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-28 23:32:09,823 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-28 23:32:09,824 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-28 23:32:09,824 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-28 23:32:09,824 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-28 23:32:09,824 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-28 23:32:09,824 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-28 23:32:09,825 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-28 23:32:09,825 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-28 23:32:09,825 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-28 23:32:09,825 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-28 23:32:09,825 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-28 23:32:09,826 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-28 23:32:09,826 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-28 23:32:09,826 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-28 23:32:09,826 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-28 23:32:09,826 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-28 23:32:09,827 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-28 23:32:09,827 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-28 23:32:09,827 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-28 23:32:09,827 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-28 23:32:09,828 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-28 23:32:09,828 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-28 23:32:09,864 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-28 23:32:09,876 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-28 23:32:09,880 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-28 23:32:09,882 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-28 23:32:09,882 INFO L276 PluginConnector]: CDTParser initialized [2018-01-28 23:32:09,883 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-01-28 23:32:10,059 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-28 23:32:10,067 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-01-28 23:32:10,085 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-28 23:32:10,085 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-28 23:32:10,090 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-28 23:32:10,091 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 11:32:10" (1/1) ... [2018-01-28 23:32:10,094 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d08f096 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:32:10, skipping insertion in model container [2018-01-28 23:32:10,094 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 11:32:10" (1/1) ... [2018-01-28 23:32:10,107 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 23:32:10,146 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 23:32:10,262 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 23:32:10,278 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 23:32:10,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:32:10 WrapperNode [2018-01-28 23:32:10,284 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-28 23:32:10,284 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-28 23:32:10,284 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-28 23:32:10,284 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-28 23:32:10,296 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:32:10" (1/1) ... [2018-01-28 23:32:10,296 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:32:10" (1/1) ... [2018-01-28 23:32:10,308 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:32:10" (1/1) ... [2018-01-28 23:32:10,308 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:32:10" (1/1) ... [2018-01-28 23:32:10,312 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:32:10" (1/1) ... [2018-01-28 23:32:10,315 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:32:10" (1/1) ... [2018-01-28 23:32:10,316 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:32:10" (1/1) ... [2018-01-28 23:32:10,318 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-28 23:32:10,318 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-28 23:32:10,318 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-28 23:32:10,318 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-28 23:32:10,319 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:32:10" (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:32:10,365 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-28 23:32:10,365 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-28 23:32:10,365 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcspn [2018-01-28 23:32:10,365 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-28 23:32:10,365 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-28 23:32:10,366 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-28 23:32:10,366 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-28 23:32:10,366 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-28 23:32:10,366 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-28 23:32:10,366 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-28 23:32:10,366 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcspn [2018-01-28 23:32:10,366 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-28 23:32:10,366 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-28 23:32:10,366 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-28 23:32:10,593 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-28 23:32:10,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 11:32:10 BoogieIcfgContainer [2018-01-28 23:32:10,593 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-28 23:32:10,594 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-01-28 23:32:10,594 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-01-28 23:32:10,594 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-01-28 23:32:10,597 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 11:32:10" (1/1) ... [2018-01-28 23:32:10,604 INFO L103 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-01-28 23:32:10,605 INFO L104 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-01-28 23:32:10,605 INFO L150 apSepIcfgTransformer]: starting freeze-var-style preprocessing [2018-01-28 23:32:10,671 INFO L218 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-01-28 23:32:10,733 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-28 23:32:36,218 INFO L311 AbstractInterpreter]: Visited 81 different actions 690 times. Merged at 48 different actions 381 times. Never widened. Found 51 fixpoints after 5 different actions. Largest state had 40 variables. [2018-01-28 23:32:36,221 INFO L226 apSepIcfgTransformer]: finished equality analysis [2018-01-28 23:32:36,232 INFO L244 HeapSepPreAnalysis]: Number of read from array group [#memory_int] : 4 [2018-01-28 23:32:36,232 INFO L238 apSepIcfgTransformer]: Finished pre analysis before partitioning [2018-01-28 23:32:36,232 INFO L239 apSepIcfgTransformer]: array groups: Set: [#memory_int] [2018-01-28 23:32:36,233 INFO L241 apSepIcfgTransformer]: select infos: Set: ((select |v_#memory_int_6| v_main_~nondetString1~5.base_2), at (SUMMARY for call write~int(0, ~nondetString1~5.base, ~nondetString1~5.offset + (~length1~5 - 1) * 1, 1); srcloc: L565)) ((select |v_#memory_int_8| v_main_~nondetString2~5.base_2), at (SUMMARY for call write~int(0, ~nondetString2~5.base, ~nondetString2~5.offset + (~length2~5 - 1) * 1, 1); srcloc: L565')) ((select (select |v_#memory_int_1| |v_cstrcspn_#t~post0.base_3|) |v_cstrcspn_#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_2| |v_cstrcspn_#t~post2.base_3|) |v_cstrcspn_#t~post2.offset_3|), at (SUMMARY for call #t~mem3 := read~int(#t~post2.base, #t~post2.offset, 1); srcloc: L549'')) [2018-01-28 23:32:36,237 INFO L544 PartitionManager]: partitioning result: [2018-01-28 23:32:36,237 INFO L549 PartitionManager]: location blocks for array group [#memory_int] [2018-01-28 23:32:36,237 INFO L558 PartitionManager]: at dimension 0 [2018-01-28 23:32:36,237 INFO L559 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-01-28 23:32:36,237 INFO L560 PartitionManager]: # location blocks :1 [2018-01-28 23:32:36,237 INFO L558 PartitionManager]: at dimension 1 [2018-01-28 23:32:36,238 INFO L559 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-01-28 23:32:36,238 INFO L560 PartitionManager]: # location blocks :1 [2018-01-28 23:32:36,238 INFO L86 ransitionTransformer]: executing heap partitioning transformation [2018-01-28 23:32:36,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 28.01 11:32:36 BasicIcfg [2018-01-28 23:32:36,255 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-01-28 23:32:36,256 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-28 23:32:36,256 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-28 23:32:36,322 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-28 23:32:36,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 11:32:10" (1/4) ... [2018-01-28 23:32:36,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f384fb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 11:32:36, skipping insertion in model container [2018-01-28 23:32:36,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:32:10" (2/4) ... [2018-01-28 23:32:36,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f384fb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 11:32:36, skipping insertion in model container [2018-01-28 23:32:36,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 11:32:10" (3/4) ... [2018-01-28 23:32:36,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f384fb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 11:32:36, skipping insertion in model container [2018-01-28 23:32:36,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 28.01 11:32:36" (4/4) ... [2018-01-28 23:32:36,326 INFO L107 eAbstractionObserver]: Analyzing ICFG HeapSeparatedIcfg [2018-01-28 23:32:36,335 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-28 23:32:36,341 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-28 23:32:36,371 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-28 23:32:36,371 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-28 23:32:36,371 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-28 23:32:36,371 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-28 23:32:36,371 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-28 23:32:36,372 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-28 23:32:36,372 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-28 23:32:36,372 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-28 23:32:36,372 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-28 23:32:36,383 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states. [2018-01-28 23:32:36,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-28 23:32:36,388 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:32:36,389 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 23:32:36,389 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 23:32:36,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1742139806, now seen corresponding path program 1 times [2018-01-28 23:32:36,394 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:32:36,394 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:32:36,433 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:32:36,434 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:32:36,434 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:32:36,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:32:36,482 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:32:36,593 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:32:36,596 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:32:36,596 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 23:32:36,598 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 23:32:36,605 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 23:32:36,606 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 23:32:36,607 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 4 states. [2018-01-28 23:32:36,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:32:36,759 INFO L93 Difference]: Finished difference Result 110 states and 123 transitions. [2018-01-28 23:32:36,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 23:32:36,760 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-28 23:32:36,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:32:36,771 INFO L225 Difference]: With dead ends: 110 [2018-01-28 23:32:36,771 INFO L226 Difference]: Without dead ends: 68 [2018-01-28 23:32:36,775 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 23:32:36,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-28 23:32:36,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-01-28 23:32:36,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-01-28 23:32:36,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2018-01-28 23:32:36,811 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 15 [2018-01-28 23:32:36,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:32:36,811 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2018-01-28 23:32:36,811 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 23:32:36,812 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2018-01-28 23:32:36,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-28 23:32:36,812 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:32:36,813 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 23:32:36,813 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 23:32:36,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1742139808, now seen corresponding path program 1 times [2018-01-28 23:32:36,813 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:32:36,813 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:32:36,814 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:32:36,814 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:32:36,815 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:32:36,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:32:36,829 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:32:36,960 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:32:36,961 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:32:36,961 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 23:32:36,963 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 23:32:36,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 23:32:36,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-28 23:32:36,963 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand 6 states. [2018-01-28 23:32:37,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:32:37,058 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2018-01-28 23:32:37,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 23:32:37,059 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-01-28 23:32:37,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:32:37,060 INFO L225 Difference]: With dead ends: 68 [2018-01-28 23:32:37,060 INFO L226 Difference]: Without dead ends: 67 [2018-01-28 23:32:37,060 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:32:37,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-28 23:32:37,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-01-28 23:32:37,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-28 23:32:37,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2018-01-28 23:32:37,065 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 15 [2018-01-28 23:32:37,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:32:37,066 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2018-01-28 23:32:37,066 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 23:32:37,066 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2018-01-28 23:32:37,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-28 23:32:37,066 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:32:37,066 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:32:37,066 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 23:32:37,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1828240543, now seen corresponding path program 1 times [2018-01-28 23:32:37,067 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:32:37,067 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:32:37,068 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:32:37,068 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:32:37,068 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:32:37,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:32:37,075 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:32:37,113 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:32:37,113 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:32:37,113 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 23:32:37,113 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 23:32:37,114 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 23:32:37,114 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 23:32:37,114 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand 4 states. [2018-01-28 23:32:37,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:32:37,195 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2018-01-28 23:32:37,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 23:32:37,196 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-28 23:32:37,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:32:37,197 INFO L225 Difference]: With dead ends: 67 [2018-01-28 23:32:37,198 INFO L226 Difference]: Without dead ends: 66 [2018-01-28 23:32:37,198 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:32:37,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-28 23:32:37,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-01-28 23:32:37,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-28 23:32:37,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2018-01-28 23:32:37,205 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 16 [2018-01-28 23:32:37,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:32:37,206 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2018-01-28 23:32:37,206 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 23:32:37,206 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2018-01-28 23:32:37,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-28 23:32:37,206 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:32:37,207 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:32:37,207 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 23:32:37,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1828240541, now seen corresponding path program 1 times [2018-01-28 23:32:37,207 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:32:37,207 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:32:37,208 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:32:37,208 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:32:37,209 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:32:37,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:32:37,220 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:32:37,297 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:32:37,297 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:32:37,297 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 23:32:37,298 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 23:32:37,298 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 23:32:37,298 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 23:32:37,298 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand 5 states. [2018-01-28 23:32:37,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:32:37,332 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2018-01-28 23:32:37,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 23:32:37,333 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-01-28 23:32:37,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:32:37,334 INFO L225 Difference]: With dead ends: 66 [2018-01-28 23:32:37,334 INFO L226 Difference]: Without dead ends: 65 [2018-01-28 23:32:37,334 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:32:37,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-28 23:32:37,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-01-28 23:32:37,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-01-28 23:32:37,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2018-01-28 23:32:37,339 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 16 [2018-01-28 23:32:37,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:32:37,339 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2018-01-28 23:32:37,339 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 23:32:37,339 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2018-01-28 23:32:37,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-28 23:32:37,340 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:32:37,340 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:32:37,340 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 23:32:37,340 INFO L82 PathProgramCache]: Analyzing trace with hash -617782031, now seen corresponding path program 1 times [2018-01-28 23:32:37,340 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:32:37,340 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:32:37,341 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:32:37,341 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:32:37,341 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:32:37,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:32:37,356 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:32:37,468 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:32:37,469 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:32:37,469 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 23:32:37,469 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 23:32:37,470 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 23:32:37,470 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 23:32:37,470 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 6 states. [2018-01-28 23:32:37,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:32:37,647 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2018-01-28 23:32:37,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 23:32:37,648 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-28 23:32:37,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:32:37,648 INFO L225 Difference]: With dead ends: 65 [2018-01-28 23:32:37,649 INFO L226 Difference]: Without dead ends: 52 [2018-01-28 23:32:37,649 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-28 23:32:37,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-28 23:32:37,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-28 23:32:37,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-28 23:32:37,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-01-28 23:32:37,654 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 24 [2018-01-28 23:32:37,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:32:37,655 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-01-28 23:32:37,655 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 23:32:37,655 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-01-28 23:32:37,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-28 23:32:37,656 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:32:37,656 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] [2018-01-28 23:32:37,656 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 23:32:37,657 INFO L82 PathProgramCache]: Analyzing trace with hash -722455846, now seen corresponding path program 1 times [2018-01-28 23:32:37,657 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:32:37,657 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:32:37,658 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:32:37,658 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:32:37,658 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:32:37,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:32:37,669 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:32:37,733 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:32:37,734 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:32:37,734 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 23:32:37,734 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 23:32:37,734 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 23:32:37,734 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-28 23:32:37,735 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 7 states. [2018-01-28 23:32:37,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:32:37,812 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-01-28 23:32:37,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 23:32:37,812 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-01-28 23:32:37,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:32:37,812 INFO L225 Difference]: With dead ends: 52 [2018-01-28 23:32:37,813 INFO L226 Difference]: Without dead ends: 51 [2018-01-28 23:32:37,813 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:32:37,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-28 23:32:37,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-28 23:32:37,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-28 23:32:37,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-01-28 23:32:37,818 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 29 [2018-01-28 23:32:37,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:32:37,818 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-01-28 23:32:37,818 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-28 23:32:37,818 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-01-28 23:32:37,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-28 23:32:37,819 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:32:37,819 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] [2018-01-28 23:32:37,819 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 23:32:37,819 INFO L82 PathProgramCache]: Analyzing trace with hash -722455844, now seen corresponding path program 1 times [2018-01-28 23:32:37,819 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:32:37,820 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:32:37,820 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:32:37,820 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:32:37,820 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:32:37,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:32:37,829 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:32:37,965 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:32:37,966 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:32:37,966 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-28 23:32:37,966 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-28 23:32:37,966 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-28 23:32:37,966 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-28 23:32:37,967 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 10 states. [2018-01-28 23:32:38,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:32:38,152 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-01-28 23:32:38,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-28 23:32:38,152 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2018-01-28 23:32:38,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:32:38,153 INFO L225 Difference]: With dead ends: 59 [2018-01-28 23:32:38,153 INFO L226 Difference]: Without dead ends: 58 [2018-01-28 23:32:38,153 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:32:38,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-28 23:32:38,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2018-01-28 23:32:38,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-28 23:32:38,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-01-28 23:32:38,158 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 29 [2018-01-28 23:32:38,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:32:38,159 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-01-28 23:32:38,159 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-28 23:32:38,159 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-01-28 23:32:38,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-28 23:32:38,159 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:32:38,159 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, 1, 1, 1] [2018-01-28 23:32:38,160 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 23:32:38,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1386242524, now seen corresponding path program 1 times [2018-01-28 23:32:38,160 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:32:38,160 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:32:38,160 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:32:38,160 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:32:38,161 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:32:38,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:32:38,172 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:32:38,204 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:32:38,204 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:32:38,204 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 23:32:38,205 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 23:32:38,205 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 23:32:38,205 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-28 23:32:38,205 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 7 states. [2018-01-28 23:32:38,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:32:38,259 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-01-28 23:32:38,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 23:32:38,260 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2018-01-28 23:32:38,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:32:38,260 INFO L225 Difference]: With dead ends: 60 [2018-01-28 23:32:38,260 INFO L226 Difference]: Without dead ends: 59 [2018-01-28 23:32:38,261 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:32:38,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-28 23:32:38,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2018-01-28 23:32:38,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-28 23:32:38,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-01-28 23:32:38,265 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 37 [2018-01-28 23:32:38,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:32:38,266 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-01-28 23:32:38,266 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-28 23:32:38,266 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-01-28 23:32:38,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-28 23:32:38,267 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:32:38,267 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, 1, 1, 1] [2018-01-28 23:32:38,267 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 23:32:38,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1386242522, now seen corresponding path program 1 times [2018-01-28 23:32:38,267 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:32:38,268 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:32:38,268 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:32:38,269 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:32:38,269 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:32:38,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:32:38,280 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:32:38,407 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:32:38,408 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:32:38,408 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-28 23:32:38,408 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-28 23:32:38,408 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-28 23:32:38,408 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-01-28 23:32:38,408 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 10 states. [2018-01-28 23:32:38,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:32:38,531 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2018-01-28 23:32:38,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 23:32:38,531 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2018-01-28 23:32:38,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:32:38,532 INFO L225 Difference]: With dead ends: 63 [2018-01-28 23:32:38,532 INFO L226 Difference]: Without dead ends: 62 [2018-01-28 23:32:38,532 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:32:38,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-28 23:32:38,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2018-01-28 23:32:38,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-28 23:32:38,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2018-01-28 23:32:38,537 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 37 [2018-01-28 23:32:38,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:32:38,537 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-01-28 23:32:38,537 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-28 23:32:38,537 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2018-01-28 23:32:38,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-28 23:32:38,538 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:32:38,538 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 23:32:38,538 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 23:32:38,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1905239105, now seen corresponding path program 1 times [2018-01-28 23:32:38,539 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:32:38,539 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:32:38,539 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:32:38,539 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:32:38,539 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:32:38,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-28 23:32:38,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-28 23:32:38,592 INFO L389 BasicCegarLoop]: Counterexample might be feasible [2018-01-28 23:32:38,595 INFO L84 mationBacktranslator]: Skipped ATE [325] [325] ULTIMATE.startENTRY-->L1: Formula: true InVars {} OutVars{#NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|, #valid=|v_#valid_7|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] [2018-01-28 23:32:38,596 INFO L84 mationBacktranslator]: Skipped ATE [331] [331] L1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-01-28 23:32:38,596 INFO L84 mationBacktranslator]: Skipped ATE [337] [337] mainENTRY-->L555: Formula: (and (<= |v_main_#t~nondet4_3| 2147483647) (<= 0 (+ |v_main_#t~nondet4_3| 2147483648))) InVars {main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_#t~nondet4=|v_main_#t~nondet4_3|} AuxVars[] AssignedVars[] [2018-01-28 23:32:38,596 INFO L84 mationBacktranslator]: Skipped ATE [341] [341] L555-->L555': Formula: (= v_main_~length1~5_1 |v_main_#t~nondet4_1|) InVars {main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{main_#t~nondet4=|v_main_#t~nondet4_1|, main_~length1~5=v_main_~length1~5_1} AuxVars[] AssignedVars[main_~length1~5] [2018-01-28 23:32:38,596 INFO L84 mationBacktranslator]: Skipped ATE [345] [345] L555'-->L556: Formula: true InVars {} OutVars{main_#t~nondet4=|v_main_#t~nondet4_2|} AuxVars[] AssignedVars[main_#t~nondet4] [2018-01-28 23:32:38,596 INFO L84 mationBacktranslator]: Skipped ATE [347] [347] L556-->L556': 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:32:38,596 INFO L84 mationBacktranslator]: Skipped ATE [349] [349] L556'-->L556'': Formula: (= v_main_~length2~5_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~5=v_main_~length2~5_1} AuxVars[] AssignedVars[main_~length2~5] [2018-01-28 23:32:38,597 INFO L84 mationBacktranslator]: Skipped ATE [351] [351] L556''-->L557: Formula: true InVars {} OutVars{main_#t~nondet5=|v_main_#t~nondet5_3|} AuxVars[] AssignedVars[main_#t~nondet5] [2018-01-28 23:32:38,597 INFO L84 mationBacktranslator]: Skipped ATE [355] [355] L557-->L557'': Formula: (not (< v_main_~length1~5_4 1)) InVars {main_~length1~5=v_main_~length1~5_4} OutVars{main_~length1~5=v_main_~length1~5_4} AuxVars[] AssignedVars[] [2018-01-28 23:32:38,597 INFO L84 mationBacktranslator]: Skipped ATE [361] [361] L557''-->L560': Formula: (not (< v_main_~length2~5_4 1)) InVars {main_~length2~5=v_main_~length2~5_4} OutVars{main_~length2~5=v_main_~length2~5_4} AuxVars[] AssignedVars[] [2018-01-28 23:32:38,597 INFO L84 mationBacktranslator]: Skipped ATE [365] [365] L560'-->L563: Formula: (and (not (= 0 |v_main_#t~malloc6.base_1|)) (= |v_main_#t~malloc6.offset_1| 0) (= |v_#length_7| (store |v_#length_8| |v_main_#t~malloc6.base_1| v_main_~length1~5_5)) (= |v_#valid_11| (store |v_#valid_12| |v_main_#t~malloc6.base_1| 1)) (= (select |v_#valid_12| |v_main_#t~malloc6.base_1|) 0)) InVars {#length=|v_#length_8|, #valid=|v_#valid_12|, main_~length1~5=v_main_~length1~5_5} OutVars{#length=|v_#length_7|, main_#t~malloc6.base=|v_main_#t~malloc6.base_1|, main_#t~malloc6.offset=|v_main_#t~malloc6.offset_1|, #valid=|v_#valid_11|, main_~length1~5=v_main_~length1~5_5} AuxVars[] AssignedVars[#valid, #length, main_#t~malloc6.base, main_#t~malloc6.offset] [2018-01-28 23:32:38,597 INFO L84 mationBacktranslator]: Skipped ATE [367] [367] L563-->L564: Formula: (and (= v_main_~nondetString1~5.base_1 |v_main_#t~malloc6.base_2|) (= v_main_~nondetString1~5.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_~nondetString1~5.offset=v_main_~nondetString1~5.offset_1, main_#t~malloc6.base=|v_main_#t~malloc6.base_2|, main_#t~malloc6.offset=|v_main_#t~malloc6.offset_2|, main_~nondetString1~5.base=v_main_~nondetString1~5.base_1} AuxVars[] AssignedVars[main_~nondetString1~5.base, main_~nondetString1~5.offset] [2018-01-28 23:32:38,598 INFO L84 mationBacktranslator]: Skipped ATE [369] [369] L564-->L564': Formula: (and (= |v_#valid_13| (store |v_#valid_14| |v_main_#t~malloc7.base_1| 1)) (not (= |v_main_#t~malloc7.base_1| 0)) (= |v_main_#t~malloc7.offset_1| 0) (= |v_#length_9| (store |v_#length_10| |v_main_#t~malloc7.base_1| v_main_~length2~5_5)) (= 0 (select |v_#valid_14| |v_main_#t~malloc7.base_1|))) InVars {#length=|v_#length_10|, main_~length2~5=v_main_~length2~5_5, #valid=|v_#valid_14|} OutVars{#length=|v_#length_9|, main_#t~malloc7.base=|v_main_#t~malloc7.base_1|, main_#t~malloc7.offset=|v_main_#t~malloc7.offset_1|, main_~length2~5=v_main_~length2~5_5, #valid=|v_#valid_13|} AuxVars[] AssignedVars[main_#t~malloc7.offset, #valid, #length, main_#t~malloc7.base] [2018-01-28 23:32:38,598 INFO L84 mationBacktranslator]: Skipped ATE [371] [371] L564'-->L565: Formula: (and (= v_main_~nondetString2~5.offset_1 |v_main_#t~malloc7.offset_2|) (= v_main_~nondetString2~5.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~5.offset=v_main_~nondetString2~5.offset_1, main_#t~malloc7.base=|v_main_#t~malloc7.base_2|, main_#t~malloc7.offset=|v_main_#t~malloc7.offset_2|, main_~nondetString2~5.base=v_main_~nondetString2~5.base_1} AuxVars[] AssignedVars[main_~nondetString2~5.offset, main_~nondetString2~5.base] [2018-01-28 23:32:38,598 INFO L84 mationBacktranslator]: Skipped ATE [373] [373] L565-->L565': Formula: (let ((.cse0 (+ v_main_~nondetString1~5.offset_2 v_main_~length1~5_6))) (and (= |v_#memory_int_part_locs_0_locs_0_1| |v_#memory_int_part_locs_0_locs_0_2|) (<= .cse0 (select |v_#length_11| v_main_~nondetString1~5.base_2)) (<= 1 .cse0) (= 1 (select |v_#valid_15| v_main_~nondetString1~5.base_2)))) InVars {#memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_2|, main_~nondetString1~5.base=v_main_~nondetString1~5.base_2, main_~length1~5=v_main_~length1~5_6, #valid=|v_#valid_15|, main_~nondetString1~5.offset=v_main_~nondetString1~5.offset_2, #length=|v_#length_11|} OutVars{#memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_1|, main_~nondetString1~5.base=v_main_~nondetString1~5.base_2, main_~length1~5=v_main_~length1~5_6, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_5|, main_~nondetString1~5.offset=v_main_~nondetString1~5.offset_2, #length=|v_#length_11|} AuxVars[] AssignedVars[#memory_int_part_locs_0_locs_0, #memory_int] [2018-01-28 23:32:38,598 INFO L84 mationBacktranslator]: Skipped ATE [379] [379] L565'-->L566: Formula: (let ((.cse0 (+ v_main_~nondetString2~5.offset_2 v_main_~length2~5_6))) (and (= (select |v_#valid_17| v_main_~nondetString2~5.base_2) 1) (<= 1 .cse0) (<= .cse0 (select |v_#length_13| v_main_~nondetString2~5.base_2)) (= |v_#memory_int_part_locs_0_locs_0_3| |v_#memory_int_part_locs_0_locs_0_4|))) InVars {#memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_4|, main_~length2~5=v_main_~length2~5_6, #valid=|v_#valid_17|, main_~nondetString2~5.offset=v_main_~nondetString2~5.offset_2, #length=|v_#length_13|, main_~nondetString2~5.base=v_main_~nondetString2~5.base_2} OutVars{#memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_3|, main_~length2~5=v_main_~length2~5_6, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_7|, main_~nondetString2~5.offset=v_main_~nondetString2~5.offset_2, #length=|v_#length_13|, main_~nondetString2~5.base=v_main_~nondetString2~5.base_2} AuxVars[] AssignedVars[#memory_int_part_locs_0_locs_0, #memory_int] [2018-01-28 23:32:38,598 INFO L84 mationBacktranslator]: Skipped ATE [387] [387] L566-->cstrcspnENTRY: Formula: (and (= |v_cstrcspn_#in~s2.baseInParam_1| v_main_~nondetString2~5.base_6) (= |v_cstrcspn_#in~s1.baseInParam_1| v_main_~nondetString1~5.base_6) (= |v_cstrcspn_#in~s2.offsetInParam_1| v_main_~nondetString2~5.offset_5) (= |v_cstrcspn_#in~s1.offsetInParam_1| v_main_~nondetString1~5.offset_5)) InVars {main_~nondetString1~5.offset=v_main_~nondetString1~5.offset_5, main_~nondetString2~5.offset=v_main_~nondetString2~5.offset_5, main_~nondetString1~5.base=v_main_~nondetString1~5.base_6, main_~nondetString2~5.base=v_main_~nondetString2~5.base_6} OutVars{cstrcspn_#in~s1.base=|v_cstrcspn_#in~s1.baseInParam_1|, cstrcspn_#in~s2.base=|v_cstrcspn_#in~s2.baseInParam_1|, cstrcspn_#in~s1.offset=|v_cstrcspn_#in~s1.offsetInParam_1|, cstrcspn_#in~s2.offset=|v_cstrcspn_#in~s2.offsetInParam_1|} AuxVars[] AssignedVars[cstrcspn_#in~s1.offset, cstrcspn_#in~s1.base, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset] [2018-01-28 23:32:38,598 INFO L84 mationBacktranslator]: Skipped ATE [391] [391] cstrcspnENTRY-->L540: Formula: (and (= v_cstrcspn_~s1.offset_1 |v_cstrcspn_#in~s1.offset_1|) (= v_cstrcspn_~s1.base_1 |v_cstrcspn_#in~s1.base_1|)) InVars {cstrcspn_#in~s1.base=|v_cstrcspn_#in~s1.base_1|, cstrcspn_#in~s1.offset=|v_cstrcspn_#in~s1.offset_1|} OutVars{cstrcspn_#in~s1.base=|v_cstrcspn_#in~s1.base_1|, cstrcspn_~s1.offset=v_cstrcspn_~s1.offset_1, cstrcspn_~s1.base=v_cstrcspn_~s1.base_1, cstrcspn_#in~s1.offset=|v_cstrcspn_#in~s1.offset_1|} AuxVars[] AssignedVars[cstrcspn_~s1.base, cstrcspn_~s1.offset] [2018-01-28 23:32:38,599 INFO L84 mationBacktranslator]: Skipped ATE [395] [395] L540-->L543: Formula: (and (= v_cstrcspn_~s2.offset_1 |v_cstrcspn_#in~s2.offset_1|) (= v_cstrcspn_~s2.base_1 |v_cstrcspn_#in~s2.base_1|)) InVars {cstrcspn_#in~s2.base=|v_cstrcspn_#in~s2.base_1|, cstrcspn_#in~s2.offset=|v_cstrcspn_#in~s2.offset_1|} OutVars{cstrcspn_#in~s2.base=|v_cstrcspn_#in~s2.base_1|, cstrcspn_~s2.offset=v_cstrcspn_~s2.offset_1, cstrcspn_~s2.base=v_cstrcspn_~s2.base_1, cstrcspn_#in~s2.offset=|v_cstrcspn_#in~s2.offset_1|} AuxVars[] AssignedVars[cstrcspn_~s2.offset, cstrcspn_~s2.base] [2018-01-28 23:32:38,599 INFO L84 mationBacktranslator]: Skipped ATE [399] [399] L543-->L543': Formula: true InVars {} OutVars{cstrcspn_~p~2.base=v_cstrcspn_~p~2.base_1, cstrcspn_~p~2.offset=v_cstrcspn_~p~2.offset_1} AuxVars[] AssignedVars[cstrcspn_~p~2.offset, cstrcspn_~p~2.base] [2018-01-28 23:32:38,599 INFO L84 mationBacktranslator]: Skipped ATE [403] [403] L543'-->L544: Formula: true InVars {} OutVars{cstrcspn_~spanp~2.base=v_cstrcspn_~spanp~2.base_1, cstrcspn_~spanp~2.offset=v_cstrcspn_~spanp~2.offset_1} AuxVars[] AssignedVars[cstrcspn_~spanp~2.offset, cstrcspn_~spanp~2.base] [2018-01-28 23:32:38,599 INFO L84 mationBacktranslator]: Skipped ATE [407] [407] L544-->L544': Formula: true InVars {} OutVars{cstrcspn_~c~2=v_cstrcspn_~c~2_1} AuxVars[] AssignedVars[cstrcspn_~c~2] [2018-01-28 23:32:38,599 INFO L84 mationBacktranslator]: Skipped ATE [411] [411] L544'-->L545: Formula: true InVars {} OutVars{cstrcspn_~sc~2=v_cstrcspn_~sc~2_1} AuxVars[] AssignedVars[cstrcspn_~sc~2] [2018-01-28 23:32:38,599 INFO L84 mationBacktranslator]: Skipped ATE [417] [417] L545-->L545''': Formula: (and (= v_cstrcspn_~p~2.offset_2 v_cstrcspn_~s1.offset_2) (= v_cstrcspn_~p~2.base_2 v_cstrcspn_~s1.base_2)) InVars {cstrcspn_~s1.base=v_cstrcspn_~s1.base_2, cstrcspn_~s1.offset=v_cstrcspn_~s1.offset_2} OutVars{cstrcspn_~p~2.offset=v_cstrcspn_~p~2.offset_2, cstrcspn_~s1.offset=v_cstrcspn_~s1.offset_2, cstrcspn_~p~2.base=v_cstrcspn_~p~2.base_2, cstrcspn_~s1.base=v_cstrcspn_~s1.base_2} AuxVars[] AssignedVars[cstrcspn_~p~2.offset, cstrcspn_~p~2.base] [2018-01-28 23:32:38,599 INFO L84 mationBacktranslator]: Skipped ATE [419] [419] L545'''-->L545': Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-01-28 23:32:38,600 INFO L84 mationBacktranslator]: Skipped ATE [425] [425] L545'-->L546: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-01-28 23:32:38,600 INFO L84 mationBacktranslator]: Skipped ATE [429] [429] L546-->L546': Formula: (and (= |v_cstrcspn_#t~post0.base_1| v_cstrcspn_~p~2.base_3) (= |v_cstrcspn_#t~post0.offset_1| v_cstrcspn_~p~2.offset_3)) InVars {cstrcspn_~p~2.base=v_cstrcspn_~p~2.base_3, cstrcspn_~p~2.offset=v_cstrcspn_~p~2.offset_3} OutVars{cstrcspn_~p~2.offset=v_cstrcspn_~p~2.offset_3, cstrcspn_#t~post0.base=|v_cstrcspn_#t~post0.base_1|, cstrcspn_#t~post0.offset=|v_cstrcspn_#t~post0.offset_1|, cstrcspn_~p~2.base=v_cstrcspn_~p~2.base_3} AuxVars[] AssignedVars[cstrcspn_#t~post0.base, cstrcspn_#t~post0.offset] [2018-01-28 23:32:38,600 INFO L84 mationBacktranslator]: Skipped ATE [431] [431] L546'-->L546'': Formula: (and (= v_cstrcspn_~p~2.base_4 |v_cstrcspn_#t~post0.base_2|) (= v_cstrcspn_~p~2.offset_4 (+ |v_cstrcspn_#t~post0.offset_2| 1))) InVars {cstrcspn_#t~post0.base=|v_cstrcspn_#t~post0.base_2|, cstrcspn_#t~post0.offset=|v_cstrcspn_#t~post0.offset_2|} OutVars{cstrcspn_~p~2.offset=v_cstrcspn_~p~2.offset_4, cstrcspn_#t~post0.base=|v_cstrcspn_#t~post0.base_2|, cstrcspn_~p~2.base=v_cstrcspn_~p~2.base_4, cstrcspn_#t~post0.offset=|v_cstrcspn_#t~post0.offset_2|} AuxVars[] AssignedVars[cstrcspn_~p~2.offset, cstrcspn_~p~2.base] [2018-01-28 23:32:38,600 INFO L84 mationBacktranslator]: Skipped ATE [433] [433] L546''-->L546''': Formula: (and (<= (+ |v_cstrcspn_#t~post0.offset_3| 1) (select |v_#length_1| |v_cstrcspn_#t~post0.base_3|)) (= (select |v_#valid_3| |v_cstrcspn_#t~post0.base_3|) 1) (<= 0 |v_cstrcspn_#t~post0.offset_3|) (= (select (select |v_#memory_int_part_locs_0_locs_0_5| |v_cstrcspn_#t~post0.base_3|) |v_cstrcspn_#t~post0.offset_3|) |v_cstrcspn_#t~mem1_1|)) InVars {#memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_5|, #length=|v_#length_1|, cstrcspn_#t~post0.base=|v_cstrcspn_#t~post0.base_3|, cstrcspn_#t~post0.offset=|v_cstrcspn_#t~post0.offset_3|, #valid=|v_#valid_3|} OutVars{cstrcspn_#t~mem1=|v_cstrcspn_#t~mem1_1|, #memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_5|, cstrcspn_#t~post0.base=|v_cstrcspn_#t~post0.base_3|, cstrcspn_#t~post0.offset=|v_cstrcspn_#t~post0.offset_3|, #valid=|v_#valid_3|, #length=|v_#length_1|} AuxVars[] AssignedVars[cstrcspn_#t~mem1] [2018-01-28 23:32:38,600 INFO L84 mationBacktranslator]: Skipped ATE [439] [439] L546'''-->L546'''': Formula: (= v_cstrcspn_~c~2_2 |v_cstrcspn_#t~mem1_2|) InVars {cstrcspn_#t~mem1=|v_cstrcspn_#t~mem1_2|} OutVars{cstrcspn_#t~mem1=|v_cstrcspn_#t~mem1_2|, cstrcspn_~c~2=v_cstrcspn_~c~2_2} AuxVars[] AssignedVars[cstrcspn_~c~2] [2018-01-28 23:32:38,600 INFO L84 mationBacktranslator]: Skipped ATE [441] [441] L546''''-->L546''''': Formula: true InVars {} OutVars{cstrcspn_#t~post0.base=|v_cstrcspn_#t~post0.base_6|, cstrcspn_#t~post0.offset=|v_cstrcspn_#t~post0.offset_5|} AuxVars[] AssignedVars[cstrcspn_#t~post0.base, cstrcspn_#t~post0.offset] [2018-01-28 23:32:38,601 INFO L84 mationBacktranslator]: Skipped ATE [443] [443] L546'''''-->L547: Formula: true InVars {} OutVars{cstrcspn_#t~mem1=|v_cstrcspn_#t~mem1_3|} AuxVars[] AssignedVars[cstrcspn_#t~mem1] [2018-01-28 23:32:38,601 INFO L84 mationBacktranslator]: Skipped ATE [445] [445] L547-->L548'': Formula: (and (= v_cstrcspn_~spanp~2.offset_2 v_cstrcspn_~s2.offset_2) (= v_cstrcspn_~spanp~2.base_2 v_cstrcspn_~s2.base_2)) InVars {cstrcspn_~s2.base=v_cstrcspn_~s2.base_2, cstrcspn_~s2.offset=v_cstrcspn_~s2.offset_2} OutVars{cstrcspn_~spanp~2.base=v_cstrcspn_~spanp~2.base_2, cstrcspn_~s2.offset=v_cstrcspn_~s2.offset_2, cstrcspn_~s2.base=v_cstrcspn_~s2.base_2, cstrcspn_~spanp~2.offset=v_cstrcspn_~spanp~2.offset_2} AuxVars[] AssignedVars[cstrcspn_~spanp~2.offset, cstrcspn_~spanp~2.base] [2018-01-28 23:32:38,601 INFO L84 mationBacktranslator]: Skipped ATE [447] [447] L548''-->L549: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-01-28 23:32:38,601 INFO L84 mationBacktranslator]: Skipped ATE [451] [451] L549-->L549': Formula: (and (= |v_cstrcspn_#t~post2.offset_1| v_cstrcspn_~spanp~2.offset_3) (= |v_cstrcspn_#t~post2.base_1| v_cstrcspn_~spanp~2.base_3)) InVars {cstrcspn_~spanp~2.base=v_cstrcspn_~spanp~2.base_3, cstrcspn_~spanp~2.offset=v_cstrcspn_~spanp~2.offset_3} OutVars{cstrcspn_#t~post2.base=|v_cstrcspn_#t~post2.base_1|, cstrcspn_~spanp~2.base=v_cstrcspn_~spanp~2.base_3, cstrcspn_#t~post2.offset=|v_cstrcspn_#t~post2.offset_1|, cstrcspn_~spanp~2.offset=v_cstrcspn_~spanp~2.offset_3} AuxVars[] AssignedVars[cstrcspn_#t~post2.offset, cstrcspn_#t~post2.base] [2018-01-28 23:32:38,601 INFO L84 mationBacktranslator]: Skipped ATE [453] [453] L549'-->L549'': Formula: (and (= v_cstrcspn_~spanp~2.base_4 |v_cstrcspn_#t~post2.base_2|) (= v_cstrcspn_~spanp~2.offset_4 (+ |v_cstrcspn_#t~post2.offset_2| 1))) InVars {cstrcspn_#t~post2.base=|v_cstrcspn_#t~post2.base_2|, cstrcspn_#t~post2.offset=|v_cstrcspn_#t~post2.offset_2|} OutVars{cstrcspn_~spanp~2.base=v_cstrcspn_~spanp~2.base_4, cstrcspn_#t~post2.base=|v_cstrcspn_#t~post2.base_2|, cstrcspn_#t~post2.offset=|v_cstrcspn_#t~post2.offset_2|, cstrcspn_~spanp~2.offset=v_cstrcspn_~spanp~2.offset_4} AuxVars[] AssignedVars[cstrcspn_~spanp~2.offset, cstrcspn_~spanp~2.base] [2018-01-28 23:32:38,601 INFO L84 mationBacktranslator]: Skipped ATE [455] [455] L549''-->L549''': Formula: (and (<= (+ |v_cstrcspn_#t~post2.offset_3| 1) (select |v_#length_3| |v_cstrcspn_#t~post2.base_3|)) (= (select |v_#valid_5| |v_cstrcspn_#t~post2.base_3|) 1) (<= 0 |v_cstrcspn_#t~post2.offset_3|) (= |v_cstrcspn_#t~mem3_1| (select (select |v_#memory_int_part_locs_0_locs_0_6| |v_cstrcspn_#t~post2.base_3|) |v_cstrcspn_#t~post2.offset_3|))) InVars {#memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_6|, cstrcspn_#t~post2.base=|v_cstrcspn_#t~post2.base_3|, #length=|v_#length_3|, cstrcspn_#t~post2.offset=|v_cstrcspn_#t~post2.offset_3|, #valid=|v_#valid_5|} OutVars{#memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_6|, cstrcspn_#t~post2.offset=|v_cstrcspn_#t~post2.offset_3|, #valid=|v_#valid_5|, cstrcspn_#t~post2.base=|v_cstrcspn_#t~post2.base_3|, #length=|v_#length_3|, cstrcspn_#t~mem3=|v_cstrcspn_#t~mem3_1|} AuxVars[] AssignedVars[cstrcspn_#t~mem3] [2018-01-28 23:32:38,601 INFO L84 mationBacktranslator]: Skipped ATE [461] [461] L549'''-->L549'''': Formula: (= v_cstrcspn_~sc~2_2 |v_cstrcspn_#t~mem3_2|) InVars {cstrcspn_#t~mem3=|v_cstrcspn_#t~mem3_2|} OutVars{cstrcspn_~sc~2=v_cstrcspn_~sc~2_2, cstrcspn_#t~mem3=|v_cstrcspn_#t~mem3_2|} AuxVars[] AssignedVars[cstrcspn_~sc~2] [2018-01-28 23:32:38,602 INFO L84 mationBacktranslator]: Skipped ATE [465] [465] L549''''-->L549''''''': Formula: (not (= v_cstrcspn_~sc~2_4 v_cstrcspn_~c~2_4)) InVars {cstrcspn_~sc~2=v_cstrcspn_~sc~2_4, cstrcspn_~c~2=v_cstrcspn_~c~2_4} OutVars{cstrcspn_~sc~2=v_cstrcspn_~sc~2_4, cstrcspn_~c~2=v_cstrcspn_~c~2_4} AuxVars[] AssignedVars[] [2018-01-28 23:32:38,602 INFO L84 mationBacktranslator]: Skipped ATE [469] [469] L549'''''''-->L549'''''''': Formula: true InVars {} OutVars{cstrcspn_#t~post2.base=|v_cstrcspn_#t~post2.base_7|, cstrcspn_#t~post2.offset=|v_cstrcspn_#t~post2.offset_6|} AuxVars[] AssignedVars[cstrcspn_#t~post2.offset, cstrcspn_#t~post2.base] [2018-01-28 23:32:38,602 INFO L84 mationBacktranslator]: Skipped ATE [473] [473] L549''''''''-->L548: Formula: true InVars {} OutVars{cstrcspn_#t~mem3=|v_cstrcspn_#t~mem3_4|} AuxVars[] AssignedVars[cstrcspn_#t~mem3] [2018-01-28 23:32:38,602 INFO L84 mationBacktranslator]: Skipped ATE [479] [479] L548-->L548'': Formula: (not (= v_cstrcspn_~sc~2_6 0)) InVars {cstrcspn_~sc~2=v_cstrcspn_~sc~2_6} OutVars{cstrcspn_~sc~2=v_cstrcspn_~sc~2_6} AuxVars[] AssignedVars[] [2018-01-28 23:32:38,602 INFO L84 mationBacktranslator]: Skipped ATE [447] [447] L548''-->L549: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-01-28 23:32:38,602 INFO L84 mationBacktranslator]: Skipped ATE [451] [451] L549-->L549': Formula: (and (= |v_cstrcspn_#t~post2.offset_1| v_cstrcspn_~spanp~2.offset_3) (= |v_cstrcspn_#t~post2.base_1| v_cstrcspn_~spanp~2.base_3)) InVars {cstrcspn_~spanp~2.base=v_cstrcspn_~spanp~2.base_3, cstrcspn_~spanp~2.offset=v_cstrcspn_~spanp~2.offset_3} OutVars{cstrcspn_#t~post2.base=|v_cstrcspn_#t~post2.base_1|, cstrcspn_~spanp~2.base=v_cstrcspn_~spanp~2.base_3, cstrcspn_#t~post2.offset=|v_cstrcspn_#t~post2.offset_1|, cstrcspn_~spanp~2.offset=v_cstrcspn_~spanp~2.offset_3} AuxVars[] AssignedVars[cstrcspn_#t~post2.offset, cstrcspn_#t~post2.base] [2018-01-28 23:32:38,602 INFO L84 mationBacktranslator]: Skipped ATE [453] [453] L549'-->L549'': Formula: (and (= v_cstrcspn_~spanp~2.base_4 |v_cstrcspn_#t~post2.base_2|) (= v_cstrcspn_~spanp~2.offset_4 (+ |v_cstrcspn_#t~post2.offset_2| 1))) InVars {cstrcspn_#t~post2.base=|v_cstrcspn_#t~post2.base_2|, cstrcspn_#t~post2.offset=|v_cstrcspn_#t~post2.offset_2|} OutVars{cstrcspn_~spanp~2.base=v_cstrcspn_~spanp~2.base_4, cstrcspn_#t~post2.base=|v_cstrcspn_#t~post2.base_2|, cstrcspn_#t~post2.offset=|v_cstrcspn_#t~post2.offset_2|, cstrcspn_~spanp~2.offset=v_cstrcspn_~spanp~2.offset_4} AuxVars[] AssignedVars[cstrcspn_~spanp~2.offset, cstrcspn_~spanp~2.base] [2018-01-28 23:32:38,602 INFO L84 mationBacktranslator]: Skipped ATE [459] [459] L549''-->cstrcspnErr3RequiresViolation: Formula: (or (not (<= 0 |v_cstrcspn_#t~post2.offset_4|)) (not (<= (+ |v_cstrcspn_#t~post2.offset_4| 1) (select |v_#length_4| |v_cstrcspn_#t~post2.base_5|)))) InVars {cstrcspn_#t~post2.base=|v_cstrcspn_#t~post2.base_5|, #length=|v_#length_4|, cstrcspn_#t~post2.offset=|v_cstrcspn_#t~post2.offset_4|} OutVars{cstrcspn_#t~post2.base=|v_cstrcspn_#t~post2.base_5|, #length=|v_#length_4|, cstrcspn_#t~post2.offset=|v_cstrcspn_#t~post2.offset_4|} AuxVars[] AssignedVars[] [2018-01-28 23:32:38,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 11:32:38 BasicIcfg [2018-01-28 23:32:38,608 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-28 23:32:38,609 INFO L168 Benchmark]: Toolchain (without parser) took 28549.24 ms. Allocated memory was 305.1 MB in the beginning and 1.9 GB in the end (delta: 1.6 GB). Free memory was 264.2 MB in the beginning and 1.6 GB in the end (delta: -1.3 GB). Peak memory consumption was 274.0 MB. Max. memory is 5.3 GB. [2018-01-28 23:32:38,610 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 305.1 MB. Free memory is still 270.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-28 23:32:38,610 INFO L168 Benchmark]: CACSL2BoogieTranslator took 198.63 ms. Allocated memory is still 305.1 MB. Free memory was 264.2 MB in the beginning and 254.2 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:32:38,611 INFO L168 Benchmark]: Boogie Preprocessor took 33.76 ms. Allocated memory is still 305.1 MB. Free memory was 254.2 MB in the beginning and 252.2 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:32:38,611 INFO L168 Benchmark]: RCFGBuilder took 275.15 ms. Allocated memory is still 305.1 MB. Free memory was 252.2 MB in the beginning and 231.7 MB in the end (delta: 20.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 5.3 GB. [2018-01-28 23:32:38,611 INFO L168 Benchmark]: IcfgTransformer took 25661.42 ms. Allocated memory was 305.1 MB in the beginning and 1.8 GB in the end (delta: 1.5 GB). Free memory was 231.7 MB in the beginning and 742.9 MB in the end (delta: -511.2 MB). Peak memory consumption was 999.2 MB. Max. memory is 5.3 GB. [2018-01-28 23:32:38,612 INFO L168 Benchmark]: TraceAbstraction took 2352.70 ms. Allocated memory was 1.8 GB in the beginning and 1.9 GB in the end (delta: 103.3 MB). Free memory was 742.9 MB in the beginning and 1.6 GB in the end (delta: -861.0 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-28 23:32:38,613 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.20 ms. Allocated memory is still 305.1 MB. Free memory is still 270.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 198.63 ms. Allocated memory is still 305.1 MB. Free memory was 264.2 MB in the beginning and 254.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 33.76 ms. Allocated memory is still 305.1 MB. Free memory was 254.2 MB in the beginning and 252.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 275.15 ms. Allocated memory is still 305.1 MB. Free memory was 252.2 MB in the beginning and 231.7 MB in the end (delta: 20.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 5.3 GB. * IcfgTransformer took 25661.42 ms. Allocated memory was 305.1 MB in the beginning and 1.8 GB in the end (delta: 1.5 GB). Free memory was 231.7 MB in the beginning and 742.9 MB in the end (delta: -511.2 MB). Peak memory consumption was 999.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2352.70 ms. Allocated memory was 1.8 GB in the beginning and 1.9 GB in the end (delta: 103.3 MB). Free memory was 742.9 MB in the beginning and 1.6 GB in the end (delta: -861.0 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 : 67 LocStat_MAX_WEQGRAPH_SIZE : 5 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 1119 LocStat_NO_SUPPORTING_DISEQUALITIES : 443 LocStat_NO_DISJUNCTIONS : -134 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 90 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 106 TransStat_NO_SUPPORTING_DISEQUALITIES : 11 TransStat_NO_DISJUNCTIONS : 91 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 2.028030 RENAME_VARIABLES(MILLISECONDS) : 0.009081 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.323507 PROJECTAWAY(MILLISECONDS) : 0.904995 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.057555 DISJOIN(MILLISECONDS) : 0.380418 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.017871 ADD_EQUALITY(MILLISECONDS) : 0.012163 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.011158 #CONJOIN_DISJUNCTIVE : 1089 #RENAME_VARIABLES : 2294 #UNFREEZE : 0 #CONJOIN : 1361 #PROJECTAWAY : 1295 #ADD_WEAK_EQUALITY : 11 #DISJOIN : 196 #RENAME_VARIABLES_DISJUNCTIVE : 2306 #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, 72 locations, 9 error locations. UNSAFE Result, 2.2s OverallTime, 10 OverallIterations, 2 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 505 SDtfs, 414 SDslu, 1106 SDs, 0 SdLazy, 554 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred 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, 264 NumberOfCodeBlocks, 264 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 209 ConstructedInterpolants, 0 QuantifiedInterpolants, 27778 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_cstrcspn-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-32-38-623.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcspn-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-32-38-623.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcspn-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-32-38-623.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcspn-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-32-38-623.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcspn-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-32-38-623.csv Received shutdown request...