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_cstrpbrk-alloca_true-valid-memsafety_true-termination.i
--------------------------------------------------------------------------------
This is Ultimate 0.1.23-acfac67
[2018-01-28 23:35:45,460 INFO L170 SettingsManager]: Resetting all preferences to default values...
[2018-01-28 23:35:45,462 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values
[2018-01-28 23:35:45,476 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-01-28 23:35:45,477 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-01-28 23:35:45,478 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-01-28 23:35:45,479 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-01-28 23:35:45,480 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values
[2018-01-28 23:35:45,482 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-01-28 23:35:45,482 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-01-28 23:35:45,483 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-01-28 23:35:45,483 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-01-28 23:35:45,484 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-01-28 23:35:45,485 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-01-28 23:35:45,485 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-01-28 23:35:45,488 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-01-28 23:35:45,490 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values
[2018-01-28 23:35:45,492 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-01-28 23:35:45,493 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-01-28 23:35:45,494 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-01-28 23:35:45,496 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-01-28 23:35:45,497 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-01-28 23:35:45,497 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-01-28 23:35:45,498 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-01-28 23:35:45,499 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values
[2018-01-28 23:35:45,500 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-01-28 23:35:45,500 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values
[2018-01-28 23:35:45,501 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring...
[2018-01-28 23:35:45,501 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-01-28 23:35:45,501 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values
[2018-01-28 23:35:45,502 INFO L181 SettingsManager]: Finished resetting all preferences to default values...
[2018-01-28 23:35:45,502 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf
[2018-01-28 23:35:45,512 INFO L110 SettingsManager]: Loading preferences was successful
[2018-01-28 23:35:45,512 INFO L112 SettingsManager]: Preferences different from defaults after loading the file:
[2018-01-28 23:35:45,513 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2018-01-28 23:35:45,513 INFO L133 SettingsManager]: * to procedures, called more than once=true
[2018-01-28 23:35:45,513 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults:
[2018-01-28 23:35:45,513 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain
[2018-01-28 23:35:45,514 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true
[2018-01-28 23:35:45,514 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-01-28 23:35:45,515 INFO L133 SettingsManager]: * sizeof long=4
[2018-01-28 23:35:45,515 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false
[2018-01-28 23:35:45,515 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true
[2018-01-28 23:35:45,515 INFO L133 SettingsManager]: * sizeof POINTER=4
[2018-01-28 23:35:45,515 INFO L133 SettingsManager]: * Check division by zero=IGNORE
[2018-01-28 23:35:45,516 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2018-01-28 23:35:45,516 INFO L133 SettingsManager]: * Bitprecise bitfields=true
[2018-01-28 23:35:45,516 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2018-01-28 23:35:45,516 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-01-28 23:35:45,516 INFO L133 SettingsManager]: * sizeof long double=12
[2018-01-28 23:35:45,517 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-01-28 23:35:45,517 INFO L133 SettingsManager]: * Size of a code block=SingleStatement
[2018-01-28 23:35:45,517 INFO L133 SettingsManager]: * To the following directory=./dump/
[2018-01-28 23:35:45,517 INFO L133 SettingsManager]: * Add additional assume for each assert=false
[2018-01-28 23:35:45,517 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode
[2018-01-28 23:35:45,517 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-01-28 23:35:45,518 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-01-28 23:35:45,518 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK
[2018-01-28 23:35:45,518 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2018-01-28 23:35:45,518 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2018-01-28 23:35:45,519 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL
[2018-01-28 23:35:45,519 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2018-01-28 23:35:45,519 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-01-28 23:35:45,519 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2018-01-28 23:35:45,520 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2018-01-28 23:35:45,520 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR
[2018-01-28 23:35:45,552 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2018-01-28 23:35:45,565 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized
[2018-01-28 23:35:45,568 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected.
[2018-01-28 23:35:45,570 INFO L271 PluginConnector]: Initializing CDTParser...
[2018-01-28 23:35:45,571 INFO L276 PluginConnector]: CDTParser initialized
[2018-01-28 23:35:45,571 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i
[2018-01-28 23:35:45,718 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-01-28 23:35:45,725 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements.
[2018-01-28 23:35:45,726 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2018-01-28 23:35:45,726 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2018-01-28 23:35:45,731 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized
[2018-01-28 23:35:45,732 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 11:35:45" (1/1) ...
[2018-01-28 23:35:45,735 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67a116ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:35:45, skipping insertion in model container
[2018-01-28 23:35:45,736 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 11:35:45" (1/1) ...
[2018-01-28 23:35:45,755 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-01-28 23:35:45,797 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-01-28 23:35:45,914 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-01-28 23:35:45,929 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-01-28 23:35:45,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:35:45 WrapperNode
[2018-01-28 23:35:45,935 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2018-01-28 23:35:45,936 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-01-28 23:35:45,936 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2018-01-28 23:35:45,936 INFO L276 PluginConnector]: Boogie Preprocessor initialized
[2018-01-28 23:35:45,947 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:35:45" (1/1) ...
[2018-01-28 23:35:45,948 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:35:45" (1/1) ...
[2018-01-28 23:35:45,958 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:35:45" (1/1) ...
[2018-01-28 23:35:45,958 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:35:45" (1/1) ...
[2018-01-28 23:35:45,962 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:35:45" (1/1) ...
[2018-01-28 23:35:45,965 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:35:45" (1/1) ...
[2018-01-28 23:35:45,966 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:35:45" (1/1) ...
[2018-01-28 23:35:45,967 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-01-28 23:35:45,968 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-01-28 23:35:45,968 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2018-01-28 23:35:45,968 INFO L276 PluginConnector]: RCFGBuilder initialized
[2018-01-28 23:35:45,969 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:35:45" (1/1) ...
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-01-28 23:35:46,013 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2018-01-28 23:35:46,013 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-01-28 23:35:46,014 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrpbrk
[2018-01-28 23:35:46,014 INFO L136 BoogieDeclarations]: Found implementation of procedure main
[2018-01-28 23:35:46,014 INFO L128 BoogieDeclarations]: Found specification of procedure write~int
[2018-01-28 23:35:46,014 INFO L128 BoogieDeclarations]: Found specification of procedure read~int
[2018-01-28 23:35:46,014 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free
[2018-01-28 23:35:46,014 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2018-01-28 23:35:46,014 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc
[2018-01-28 23:35:46,015 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2018-01-28 23:35:46,015 INFO L128 BoogieDeclarations]: Found specification of procedure cstrpbrk
[2018-01-28 23:35:46,015 INFO L128 BoogieDeclarations]: Found specification of procedure main
[2018-01-28 23:35:46,015 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2018-01-28 23:35:46,015 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-01-28 23:35:46,232 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-01-28 23:35:46,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 11:35:46 BoogieIcfgContainer
[2018-01-28 23:35:46,233 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-01-28 23:35:46,233 INFO L113 PluginConnector]: ------------------------IcfgTransformer----------------------------
[2018-01-28 23:35:46,233 INFO L271 PluginConnector]: Initializing IcfgTransformer...
[2018-01-28 23:35:46,234 INFO L276 PluginConnector]: IcfgTransformer initialized
[2018-01-28 23:35:46,236 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 11:35:46" (1/1) ...
[2018-01-28 23:35:46,243 INFO L103 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning
[2018-01-28 23:35:46,243 INFO L104 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int]
[2018-01-28 23:35:46,243 INFO L150 apSepIcfgTransformer]: starting freeze-var-style preprocessing
[2018-01-28 23:35:46,299 INFO L218 apSepIcfgTransformer]: finished preprocessing for the equality analysis
[2018-01-28 23:35:46,365 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2)
[2018-01-28 23:36:08,164 INFO L311 AbstractInterpreter]: Visited 82 different actions 553 times. Merged at 52 different actions 310 times. Never widened. Found 45 fixpoints after 8 different actions. Largest state had 39 variables.
[2018-01-28 23:36:08,167 INFO L226 apSepIcfgTransformer]: finished equality analysis
[2018-01-28 23:36:08,178 INFO L244 HeapSepPreAnalysis]: Number of read from array group [#memory_int] : 4
[2018-01-28 23:36:08,179 INFO L238 apSepIcfgTransformer]: Finished pre analysis before partitioning
[2018-01-28 23:36:08,179 INFO L239 apSepIcfgTransformer]: array groups: Set:
[#memory_int]
[2018-01-28 23:36:08,179 INFO L241 apSepIcfgTransformer]: select infos: Set:
((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: L563'))
((select (select |v_#memory_int_2| |v_cstrpbrk_#t~post2.base_3|) |v_cstrpbrk_#t~post2.offset_3|), at (SUMMARY for call #t~mem3 := read~int(#t~post2.base, #t~post2.offset, 1); srcloc: L546'''))
((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: L563))
((select (select |v_#memory_int_1| |v_cstrpbrk_#t~post0.base_3|) |v_cstrpbrk_#t~post0.offset_3|), at (SUMMARY for call #t~mem1 := read~int(#t~post0.base, #t~post0.offset, 1); srcloc: L545''))
[2018-01-28 23:36:08,197 INFO L544 PartitionManager]: partitioning result:
[2018-01-28 23:36:08,197 INFO L549 PartitionManager]: location blocks for array group [#memory_int]
[2018-01-28 23:36:08,197 INFO L558 PartitionManager]: at dimension 0
[2018-01-28 23:36:08,197 INFO L559 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1
[2018-01-28 23:36:08,197 INFO L560 PartitionManager]: # location blocks :1
[2018-01-28 23:36:08,198 INFO L558 PartitionManager]: at dimension 1
[2018-01-28 23:36:08,198 INFO L559 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1
[2018-01-28 23:36:08,198 INFO L560 PartitionManager]: # location blocks :1
[2018-01-28 23:36:08,198 INFO L86 ransitionTransformer]: executing heap partitioning transformation
[2018-01-28 23:36:08,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 28.01 11:36:08 BasicIcfg
[2018-01-28 23:36:08,213 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer----------------------------
[2018-01-28 23:36:08,213 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2018-01-28 23:36:08,213 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2018-01-28 23:36:08,216 INFO L276 PluginConnector]: TraceAbstraction initialized
[2018-01-28 23:36:08,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 11:35:45" (1/4) ...
[2018-01-28 23:36:08,216 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c2e7857 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 11:36:08, skipping insertion in model container
[2018-01-28 23:36:08,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:35:45" (2/4) ...
[2018-01-28 23:36:08,217 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c2e7857 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 11:36:08, skipping insertion in model container
[2018-01-28 23:36:08,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 11:35:46" (3/4) ...
[2018-01-28 23:36:08,217 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c2e7857 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 11:36:08, skipping insertion in model container
[2018-01-28 23:36:08,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 28.01 11:36:08" (4/4) ...
[2018-01-28 23:36:08,218 INFO L107 eAbstractionObserver]: Analyzing ICFG HeapSeparatedIcfg
[2018-01-28 23:36:08,287 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2018-01-28 23:36:08,293 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations.
[2018-01-28 23:36:08,322 INFO L322 AbstractCegarLoop]: Interprodecural is true
[2018-01-28 23:36:08,323 INFO L323 AbstractCegarLoop]: Hoare is true
[2018-01-28 23:36:08,323 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP
[2018-01-28 23:36:08,323 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK
[2018-01-28 23:36:08,323 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-01-28 23:36:08,323 INFO L327 AbstractCegarLoop]: Difference is false
[2018-01-28 23:36:08,323 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-01-28 23:36:08,324 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-01-28 23:36:08,324 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure
[2018-01-28 23:36:08,335 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states.
[2018-01-28 23:36:08,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2018-01-28 23:36:08,339 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 23:36:08,340 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 23:36:08,340 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-01-28 23:36:08,343 INFO L82 PathProgramCache]: Analyzing trace with hash 528743970, now seen corresponding path program 1 times
[2018-01-28 23:36:08,344 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 23:36:08,344 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 23:36:08,381 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 23:36:08,381 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 23:36:08,382 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 23:36:08,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 23:36:08,431 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 23:36:08,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-28 23:36:08,540 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-28 23:36:08,541 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-01-28 23:36:08,542 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-01-28 23:36:08,549 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-01-28 23:36:08,549 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-01-28 23:36:08,551 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 4 states.
[2018-01-28 23:36:08,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 23:36:08,645 INFO L93 Difference]: Finished difference Result 114 states and 127 transitions.
[2018-01-28 23:36:08,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2018-01-28 23:36:08,647 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15
[2018-01-28 23:36:08,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 23:36:08,659 INFO L225 Difference]: With dead ends: 114
[2018-01-28 23:36:08,659 INFO L226 Difference]: Without dead ends: 69
[2018-01-28 23:36:08,662 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:36:08,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states.
[2018-01-28 23:36:08,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69.
[2018-01-28 23:36:08,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states.
[2018-01-28 23:36:08,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions.
[2018-01-28 23:36:08,695 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 15
[2018-01-28 23:36:08,696 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 23:36:08,696 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions.
[2018-01-28 23:36:08,696 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-01-28 23:36:08,696 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions.
[2018-01-28 23:36:08,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2018-01-28 23:36:08,697 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 23:36:08,697 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 23:36:08,697 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-01-28 23:36:08,697 INFO L82 PathProgramCache]: Analyzing trace with hash 528743972, now seen corresponding path program 1 times
[2018-01-28 23:36:08,697 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 23:36:08,697 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 23:36:08,698 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 23:36:08,698 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 23:36:08,698 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 23:36:08,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 23:36:08,712 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 23:36:08,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-28 23:36:08,851 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-28 23:36:08,851 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-01-28 23:36:08,853 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-01-28 23:36:08,853 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-01-28 23:36:08,853 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2018-01-28 23:36:08,854 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand 6 states.
[2018-01-28 23:36:08,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 23:36:08,940 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions.
[2018-01-28 23:36:08,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-01-28 23:36:08,941 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15
[2018-01-28 23:36:08,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 23:36:08,942 INFO L225 Difference]: With dead ends: 69
[2018-01-28 23:36:08,942 INFO L226 Difference]: Without dead ends: 68
[2018-01-28 23:36:08,943 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42
[2018-01-28 23:36:08,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states.
[2018-01-28 23:36:08,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68.
[2018-01-28 23:36:08,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states.
[2018-01-28 23:36:08,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions.
[2018-01-28 23:36:08,951 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 15
[2018-01-28 23:36:08,951 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 23:36:08,951 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions.
[2018-01-28 23:36:08,951 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-01-28 23:36:08,952 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions.
[2018-01-28 23:36:08,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2018-01-28 23:36:08,952 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 23:36:08,952 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 23:36:08,953 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-01-28 23:36:08,953 INFO L82 PathProgramCache]: Analyzing trace with hash -788805791, now seen corresponding path program 1 times
[2018-01-28 23:36:08,953 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 23:36:08,953 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 23:36:08,954 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 23:36:08,954 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 23:36:08,955 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 23:36:08,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 23:36:08,967 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 23:36:09,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-28 23:36:09,003 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-28 23:36:09,003 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-01-28 23:36:09,004 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-01-28 23:36:09,004 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-01-28 23:36:09,004 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-01-28 23:36:09,004 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand 4 states.
[2018-01-28 23:36:09,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 23:36:09,079 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions.
[2018-01-28 23:36:09,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2018-01-28 23:36:09,079 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16
[2018-01-28 23:36:09,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 23:36:09,080 INFO L225 Difference]: With dead ends: 68
[2018-01-28 23:36:09,080 INFO L226 Difference]: Without dead ends: 67
[2018-01-28 23:36:09,081 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-01-28 23:36:09,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states.
[2018-01-28 23:36:09,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67.
[2018-01-28 23:36:09,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states.
[2018-01-28 23:36:09,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions.
[2018-01-28 23:36:09,087 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 16
[2018-01-28 23:36:09,088 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 23:36:09,088 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions.
[2018-01-28 23:36:09,088 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-01-28 23:36:09,088 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions.
[2018-01-28 23:36:09,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2018-01-28 23:36:09,089 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 23:36:09,089 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 23:36:09,089 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-01-28 23:36:09,089 INFO L82 PathProgramCache]: Analyzing trace with hash -788805789, now seen corresponding path program 1 times
[2018-01-28 23:36:09,089 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 23:36:09,089 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 23:36:09,090 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 23:36:09,090 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 23:36:09,091 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 23:36:09,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 23:36:09,101 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 23:36:09,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-28 23:36:09,160 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-28 23:36:09,160 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-01-28 23:36:09,160 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-01-28 23:36:09,160 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-01-28 23:36:09,161 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-01-28 23:36:09,161 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 5 states.
[2018-01-28 23:36:09,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 23:36:09,195 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions.
[2018-01-28 23:36:09,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-01-28 23:36:09,196 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16
[2018-01-28 23:36:09,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 23:36:09,197 INFO L225 Difference]: With dead ends: 67
[2018-01-28 23:36:09,197 INFO L226 Difference]: Without dead ends: 66
[2018-01-28 23:36:09,197 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30
[2018-01-28 23:36:09,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states.
[2018-01-28 23:36:09,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66.
[2018-01-28 23:36:09,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states.
[2018-01-28 23:36:09,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions.
[2018-01-28 23:36:09,206 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 16
[2018-01-28 23:36:09,206 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 23:36:09,206 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions.
[2018-01-28 23:36:09,207 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-01-28 23:36:09,207 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions.
[2018-01-28 23:36:09,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2018-01-28 23:36:09,208 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 23:36:09,208 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 23:36:09,208 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-01-28 23:36:09,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1467405581, now seen corresponding path program 1 times
[2018-01-28 23:36:09,208 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 23:36:09,209 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 23:36:09,209 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 23:36:09,210 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 23:36:09,210 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 23:36:09,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 23:36:09,223 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 23:36:09,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-28 23:36:09,346 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-28 23:36:09,346 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-01-28 23:36:09,348 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-01-28 23:36:09,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-01-28 23:36:09,348 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2018-01-28 23:36:09,348 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand 6 states.
[2018-01-28 23:36:09,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 23:36:09,534 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions.
[2018-01-28 23:36:09,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2018-01-28 23:36:09,534 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24
[2018-01-28 23:36:09,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 23:36:09,535 INFO L225 Difference]: With dead ends: 66
[2018-01-28 23:36:09,535 INFO L226 Difference]: Without dead ends: 52
[2018-01-28 23:36:09,536 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:36:09,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states.
[2018-01-28 23:36:09,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52.
[2018-01-28 23:36:09,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states.
[2018-01-28 23:36:09,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions.
[2018-01-28 23:36:09,542 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 24
[2018-01-28 23:36:09,542 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 23:36:09,542 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions.
[2018-01-28 23:36:09,542 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-01-28 23:36:09,542 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions.
[2018-01-28 23:36:09,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2018-01-28 23:36:09,543 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 23:36:09,543 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 23:36:09,544 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-01-28 23:36:09,544 INFO L82 PathProgramCache]: Analyzing trace with hash -115617639, now seen corresponding path program 1 times
[2018-01-28 23:36:09,544 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 23:36:09,544 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 23:36:09,545 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 23:36:09,545 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 23:36:09,545 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 23:36:09,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 23:36:09,555 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 23:36:09,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-28 23:36:09,598 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-28 23:36:09,598 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-01-28 23:36:09,598 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-01-28 23:36:09,599 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-01-28 23:36:09,599 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2018-01-28 23:36:09,599 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 6 states.
[2018-01-28 23:36:09,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 23:36:09,652 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions.
[2018-01-28 23:36:09,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-01-28 23:36:09,652 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26
[2018-01-28 23:36:09,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 23:36:09,653 INFO L225 Difference]: With dead ends: 52
[2018-01-28 23:36:09,653 INFO L226 Difference]: Without dead ends: 51
[2018-01-28 23:36:09,654 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2018-01-28 23:36:09,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states.
[2018-01-28 23:36:09,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51.
[2018-01-28 23:36:09,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states.
[2018-01-28 23:36:09,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions.
[2018-01-28 23:36:09,658 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 26
[2018-01-28 23:36:09,658 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 23:36:09,658 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions.
[2018-01-28 23:36:09,659 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-01-28 23:36:09,659 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions.
[2018-01-28 23:36:09,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2018-01-28 23:36:09,659 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 23:36:09,659 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 23:36:09,659 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-01-28 23:36:09,660 INFO L82 PathProgramCache]: Analyzing trace with hash -115617637, now seen corresponding path program 1 times
[2018-01-28 23:36:09,660 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 23:36:09,660 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 23:36:09,660 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 23:36:09,660 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 23:36:09,661 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 23:36:09,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 23:36:09,673 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 23:36:09,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-28 23:36:09,797 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-28 23:36:09,797 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2018-01-28 23:36:09,797 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-01-28 23:36:09,798 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-01-28 23:36:09,798 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2018-01-28 23:36:09,798 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 9 states.
[2018-01-28 23:36:09,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 23:36:09,933 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions.
[2018-01-28 23:36:09,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2018-01-28 23:36:09,933 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26
[2018-01-28 23:36:09,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 23:36:09,935 INFO L225 Difference]: With dead ends: 59
[2018-01-28 23:36:09,935 INFO L226 Difference]: Without dead ends: 58
[2018-01-28 23:36:09,935 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182
[2018-01-28 23:36:09,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states.
[2018-01-28 23:36:09,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55.
[2018-01-28 23:36:09,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states.
[2018-01-28 23:36:09,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions.
[2018-01-28 23:36:09,941 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 26
[2018-01-28 23:36:09,941 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 23:36:09,942 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions.
[2018-01-28 23:36:09,942 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-01-28 23:36:09,942 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions.
[2018-01-28 23:36:09,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36
[2018-01-28 23:36:09,943 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 23:36:09,943 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]
[2018-01-28 23:36:09,943 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-01-28 23:36:09,943 INFO L82 PathProgramCache]: Analyzing trace with hash -263921074, now seen corresponding path program 1 times
[2018-01-28 23:36:09,943 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 23:36:09,944 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 23:36:09,944 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 23:36:09,945 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 23:36:09,945 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 23:36:09,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 23:36:09,957 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 23:36:10,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-28 23:36:10,124 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-28 23:36:10,124 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2018-01-28 23:36:10,124 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states
[2018-01-28 23:36:10,124 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2018-01-28 23:36:10,125 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2018-01-28 23:36:10,125 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 10 states.
[2018-01-28 23:36:10,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 23:36:10,246 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions.
[2018-01-28 23:36:10,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2018-01-28 23:36:10,246 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35
[2018-01-28 23:36:10,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 23:36:10,247 INFO L225 Difference]: With dead ends: 65
[2018-01-28 23:36:10,247 INFO L226 Difference]: Without dead ends: 64
[2018-01-28 23:36:10,247 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210
[2018-01-28 23:36:10,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states.
[2018-01-28 23:36:10,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 59.
[2018-01-28 23:36:10,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states.
[2018-01-28 23:36:10,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions.
[2018-01-28 23:36:10,251 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 35
[2018-01-28 23:36:10,252 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 23:36:10,252 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions.
[2018-01-28 23:36:10,252 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states.
[2018-01-28 23:36:10,252 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions.
[2018-01-28 23:36:10,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36
[2018-01-28 23:36:10,252 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 23:36:10,253 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]
[2018-01-28 23:36:10,253 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-01-28 23:36:10,253 INFO L82 PathProgramCache]: Analyzing trace with hash -263921076, now seen corresponding path program 1 times
[2018-01-28 23:36:10,253 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 23:36:10,253 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 23:36:10,254 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 23:36:10,254 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 23:36:10,254 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 23:36:10,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 23:36:10,264 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 23:36:10,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-28 23:36:10,299 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-28 23:36:10,300 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2018-01-28 23:36:10,300 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-01-28 23:36:10,300 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-01-28 23:36:10,300 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2018-01-28 23:36:10,300 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand 7 states.
[2018-01-28 23:36:10,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 23:36:10,353 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions.
[2018-01-28 23:36:10,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2018-01-28 23:36:10,353 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35
[2018-01-28 23:36:10,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 23:36:10,354 INFO L225 Difference]: With dead ends: 64
[2018-01-28 23:36:10,354 INFO L226 Difference]: Without dead ends: 63
[2018-01-28 23:36:10,354 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90
[2018-01-28 23:36:10,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states.
[2018-01-28 23:36:10,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 58.
[2018-01-28 23:36:10,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states.
[2018-01-28 23:36:10,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions.
[2018-01-28 23:36:10,361 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 35
[2018-01-28 23:36:10,361 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 23:36:10,361 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions.
[2018-01-28 23:36:10,361 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-01-28 23:36:10,362 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions.
[2018-01-28 23:36:10,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44
[2018-01-28 23:36:10,363 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 23:36:10,363 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]
[2018-01-28 23:36:10,363 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-01-28 23:36:10,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1573091744, now seen corresponding path program 1 times
[2018-01-28 23:36:10,363 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 23:36:10,364 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 23:36:10,364 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 23:36:10,365 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 23:36:10,365 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 23:36:10,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-01-28 23:36:10,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-01-28 23:36:10,416 INFO L389 BasicCegarLoop]: Counterexample might be feasible
[2018-01-28 23:36:10,419 INFO L84 mationBacktranslator]: Skipped ATE [329] [329] 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:36:10,420 INFO L84 mationBacktranslator]: Skipped ATE [335] [335] L1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]
[2018-01-28 23:36:10,420 INFO L84 mationBacktranslator]: Skipped ATE [341] [341] mainENTRY-->L553: Formula: (and (<= 0 (+ |v_main_#t~nondet4_1| 2147483648)) (<= |v_main_#t~nondet4_1| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[]
[2018-01-28 23:36:10,420 INFO L84 mationBacktranslator]: Skipped ATE [345] [345] L553-->L553': Formula: (= v_main_~length1~5_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_#t~nondet4=|v_main_#t~nondet4_2|, main_~length1~5=v_main_~length1~5_1} AuxVars[] AssignedVars[main_~length1~5]
[2018-01-28 23:36:10,420 INFO L84 mationBacktranslator]: Skipped ATE [349] [349] L553'-->L554: Formula: true InVars {} OutVars{main_#t~nondet4=|v_main_#t~nondet4_3|} AuxVars[] AssignedVars[main_#t~nondet4]
[2018-01-28 23:36:10,420 INFO L84 mationBacktranslator]: Skipped ATE [351] [351] L554-->L554': Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|} AuxVars[] AssignedVars[]
[2018-01-28 23:36:10,420 INFO L84 mationBacktranslator]: Skipped ATE [353] [353] L554'-->L554'': 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:36:10,420 INFO L84 mationBacktranslator]: Skipped ATE [355] [355] L554''-->L555: Formula: true InVars {} OutVars{main_#t~nondet5=|v_main_#t~nondet5_3|} AuxVars[] AssignedVars[main_#t~nondet5]
[2018-01-28 23:36:10,420 INFO L84 mationBacktranslator]: Skipped ATE [359] [359] L555-->L555'': 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:36:10,421 INFO L84 mationBacktranslator]: Skipped ATE [365] [365] L555''-->L558': 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:36:10,421 INFO L84 mationBacktranslator]: Skipped ATE [369] [369] L558'-->L561: 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:36:10,421 INFO L84 mationBacktranslator]: Skipped ATE [371] [371] L561-->L562: 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:36:10,421 INFO L84 mationBacktranslator]: Skipped ATE [373] [373] L562-->L562': 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:36:10,421 INFO L84 mationBacktranslator]: Skipped ATE [375] [375] L562'-->L563: 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:36:10,421 INFO L84 mationBacktranslator]: Skipped ATE [377] [377] L563-->L563': 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:36:10,422 INFO L84 mationBacktranslator]: Skipped ATE [383] [383] L563'-->L564: 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:36:10,422 INFO L84 mationBacktranslator]: Skipped ATE [391] [391] L564-->cstrpbrkENTRY: Formula: (and (= |v_cstrpbrk_#in~s2.offsetInParam_1| v_main_~nondetString2~5.offset_5) (= |v_cstrpbrk_#in~s1.offsetInParam_1| v_main_~nondetString1~5.offset_5) (= |v_cstrpbrk_#in~s2.baseInParam_1| v_main_~nondetString2~5.base_6) (= |v_cstrpbrk_#in~s1.baseInParam_1| v_main_~nondetString1~5.base_6)) 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{cstrpbrk_#in~s1.offset=|v_cstrpbrk_#in~s1.offsetInParam_1|, cstrpbrk_#in~s2.base=|v_cstrpbrk_#in~s2.baseInParam_1|, cstrpbrk_#in~s1.base=|v_cstrpbrk_#in~s1.baseInParam_1|, cstrpbrk_#in~s2.offset=|v_cstrpbrk_#in~s2.offsetInParam_1|} AuxVars[] AssignedVars[cstrpbrk_#in~s2.base, cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.offset]
[2018-01-28 23:36:10,422 INFO L84 mationBacktranslator]: Skipped ATE [395] [395] cstrpbrkENTRY-->L540: Formula: (and (= v_cstrpbrk_~s1.offset_1 |v_cstrpbrk_#in~s1.offset_1|) (= v_cstrpbrk_~s1.base_1 |v_cstrpbrk_#in~s1.base_1|)) InVars {cstrpbrk_#in~s1.offset=|v_cstrpbrk_#in~s1.offset_1|, cstrpbrk_#in~s1.base=|v_cstrpbrk_#in~s1.base_1|} OutVars{cstrpbrk_#in~s1.offset=|v_cstrpbrk_#in~s1.offset_1|, cstrpbrk_#in~s1.base=|v_cstrpbrk_#in~s1.base_1|, cstrpbrk_~s1.base=v_cstrpbrk_~s1.base_1, cstrpbrk_~s1.offset=v_cstrpbrk_~s1.offset_1} AuxVars[] AssignedVars[cstrpbrk_~s1.base, cstrpbrk_~s1.offset]
[2018-01-28 23:36:10,422 INFO L84 mationBacktranslator]: Skipped ATE [399] [399] L540-->L543: Formula: (and (= v_cstrpbrk_~s2.offset_1 |v_cstrpbrk_#in~s2.offset_1|) (= v_cstrpbrk_~s2.base_1 |v_cstrpbrk_#in~s2.base_1|)) InVars {cstrpbrk_#in~s2.offset=|v_cstrpbrk_#in~s2.offset_1|, cstrpbrk_#in~s2.base=|v_cstrpbrk_#in~s2.base_1|} OutVars{cstrpbrk_~s2.offset=v_cstrpbrk_~s2.offset_1, cstrpbrk_#in~s2.base=|v_cstrpbrk_#in~s2.base_1|, cstrpbrk_#in~s2.offset=|v_cstrpbrk_#in~s2.offset_1|, cstrpbrk_~s2.base=v_cstrpbrk_~s2.base_1} AuxVars[] AssignedVars[cstrpbrk_~s2.base, cstrpbrk_~s2.offset]
[2018-01-28 23:36:10,422 INFO L84 mationBacktranslator]: Skipped ATE [403] [403] L543-->L544: Formula: true InVars {} OutVars{cstrpbrk_~scanp~2.offset=v_cstrpbrk_~scanp~2.offset_1, cstrpbrk_~scanp~2.base=v_cstrpbrk_~scanp~2.base_1} AuxVars[] AssignedVars[cstrpbrk_~scanp~2.offset, cstrpbrk_~scanp~2.base]
[2018-01-28 23:36:10,422 INFO L84 mationBacktranslator]: Skipped ATE [407] [407] L544-->L544': Formula: true InVars {} OutVars{cstrpbrk_~c~2=v_cstrpbrk_~c~2_1} AuxVars[] AssignedVars[cstrpbrk_~c~2]
[2018-01-28 23:36:10,423 INFO L84 mationBacktranslator]: Skipped ATE [411] [411] L544'-->L546'''''''''''': Formula: true InVars {} OutVars{cstrpbrk_~sc~2=v_cstrpbrk_~sc~2_1} AuxVars[] AssignedVars[cstrpbrk_~sc~2]
[2018-01-28 23:36:10,423 INFO L84 mationBacktranslator]: Skipped ATE [415] [415] L546''''''''''''-->L545: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]
[2018-01-28 23:36:10,423 INFO L84 mationBacktranslator]: Skipped ATE [423] [423] L545-->L545': Formula: (and (= |v_cstrpbrk_#t~post0.base_1| v_cstrpbrk_~s1.base_2) (= |v_cstrpbrk_#t~post0.offset_1| v_cstrpbrk_~s1.offset_2)) InVars {cstrpbrk_~s1.base=v_cstrpbrk_~s1.base_2, cstrpbrk_~s1.offset=v_cstrpbrk_~s1.offset_2} OutVars{cstrpbrk_#t~post0.base=|v_cstrpbrk_#t~post0.base_1|, cstrpbrk_~s1.base=v_cstrpbrk_~s1.base_2, cstrpbrk_~s1.offset=v_cstrpbrk_~s1.offset_2, cstrpbrk_#t~post0.offset=|v_cstrpbrk_#t~post0.offset_1|} AuxVars[] AssignedVars[cstrpbrk_#t~post0.base, cstrpbrk_#t~post0.offset]
[2018-01-28 23:36:10,423 INFO L84 mationBacktranslator]: Skipped ATE [427] [427] L545'-->L545'': Formula: (and (= v_cstrpbrk_~s1.base_3 |v_cstrpbrk_#t~post0.base_2|) (= v_cstrpbrk_~s1.offset_3 (+ |v_cstrpbrk_#t~post0.offset_2| 1))) InVars {cstrpbrk_#t~post0.base=|v_cstrpbrk_#t~post0.base_2|, cstrpbrk_#t~post0.offset=|v_cstrpbrk_#t~post0.offset_2|} OutVars{cstrpbrk_~s1.base=v_cstrpbrk_~s1.base_3, cstrpbrk_#t~post0.base=|v_cstrpbrk_#t~post0.base_2|, cstrpbrk_~s1.offset=v_cstrpbrk_~s1.offset_3, cstrpbrk_#t~post0.offset=|v_cstrpbrk_#t~post0.offset_2|} AuxVars[] AssignedVars[cstrpbrk_~s1.base, cstrpbrk_~s1.offset]
[2018-01-28 23:36:10,423 INFO L84 mationBacktranslator]: Skipped ATE [431] [431] L545''-->L545''': Formula: (and (= 1 (select |v_#valid_3| |v_cstrpbrk_#t~post0.base_3|)) (<= 0 |v_cstrpbrk_#t~post0.offset_3|) (<= (+ |v_cstrpbrk_#t~post0.offset_3| 1) (select |v_#length_1| |v_cstrpbrk_#t~post0.base_3|)) (= (select (select |v_#memory_int_part_locs_0_locs_0_5| |v_cstrpbrk_#t~post0.base_3|) |v_cstrpbrk_#t~post0.offset_3|) |v_cstrpbrk_#t~mem1_1|)) InVars {#memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_5|, #length=|v_#length_1|, cstrpbrk_#t~post0.base=|v_cstrpbrk_#t~post0.base_3|, cstrpbrk_#t~post0.offset=|v_cstrpbrk_#t~post0.offset_3|, #valid=|v_#valid_3|} OutVars{#memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_5|, cstrpbrk_#t~post0.base=|v_cstrpbrk_#t~post0.base_3|, cstrpbrk_#t~post0.offset=|v_cstrpbrk_#t~post0.offset_3|, #valid=|v_#valid_3|, cstrpbrk_#t~mem1=|v_cstrpbrk_#t~mem1_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[cstrpbrk_#t~mem1]
[2018-01-28 23:36:10,423 INFO L84 mationBacktranslator]: Skipped ATE [437] [437] L545'''-->L545'''': Formula: (= v_cstrpbrk_~c~2_2 |v_cstrpbrk_#t~mem1_2|) InVars {cstrpbrk_#t~mem1=|v_cstrpbrk_#t~mem1_2|} OutVars{cstrpbrk_#t~mem1=|v_cstrpbrk_#t~mem1_2|, cstrpbrk_~c~2=v_cstrpbrk_~c~2_2} AuxVars[] AssignedVars[cstrpbrk_~c~2]
[2018-01-28 23:36:10,423 INFO L84 mationBacktranslator]: Skipped ATE [441] [441] L545''''-->L545'''''''': Formula: (not (= 0 v_cstrpbrk_~c~2_4)) InVars {cstrpbrk_~c~2=v_cstrpbrk_~c~2_4} OutVars{cstrpbrk_~c~2=v_cstrpbrk_~c~2_4} AuxVars[] AssignedVars[]
[2018-01-28 23:36:10,424 INFO L84 mationBacktranslator]: Skipped ATE [445] [445] L545''''''''-->L545''''''''': Formula: true InVars {} OutVars{cstrpbrk_#t~post0.base=|v_cstrpbrk_#t~post0.base_7|, cstrpbrk_#t~post0.offset=|v_cstrpbrk_#t~post0.offset_6|} AuxVars[] AssignedVars[cstrpbrk_#t~post0.base, cstrpbrk_#t~post0.offset]
[2018-01-28 23:36:10,424 INFO L84 mationBacktranslator]: Skipped ATE [449] [449] L545'''''''''-->L546: Formula: true InVars {} OutVars{cstrpbrk_#t~mem1=|v_cstrpbrk_#t~mem1_4|} AuxVars[] AssignedVars[cstrpbrk_#t~mem1]
[2018-01-28 23:36:10,424 INFO L84 mationBacktranslator]: Skipped ATE [451] [451] L546-->L546''''''''''': Formula: (and (= v_cstrpbrk_~scanp~2.offset_2 v_cstrpbrk_~s2.offset_2) (= v_cstrpbrk_~scanp~2.base_2 v_cstrpbrk_~s2.base_2)) InVars {cstrpbrk_~s2.offset=v_cstrpbrk_~s2.offset_2, cstrpbrk_~s2.base=v_cstrpbrk_~s2.base_2} OutVars{cstrpbrk_~s2.offset=v_cstrpbrk_~s2.offset_2, cstrpbrk_~scanp~2.base=v_cstrpbrk_~scanp~2.base_2, cstrpbrk_~scanp~2.offset=v_cstrpbrk_~scanp~2.offset_2, cstrpbrk_~s2.base=v_cstrpbrk_~s2.base_2} AuxVars[] AssignedVars[cstrpbrk_~scanp~2.offset, cstrpbrk_~scanp~2.base]
[2018-01-28 23:36:10,424 INFO L84 mationBacktranslator]: Skipped ATE [453] [453] L546'''''''''''-->L546': Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]
[2018-01-28 23:36:10,424 INFO L84 mationBacktranslator]: Skipped ATE [457] [457] L546'-->L546'': Formula: (and (= |v_cstrpbrk_#t~post2.base_1| v_cstrpbrk_~scanp~2.base_3) (= |v_cstrpbrk_#t~post2.offset_1| v_cstrpbrk_~scanp~2.offset_3)) InVars {cstrpbrk_~scanp~2.offset=v_cstrpbrk_~scanp~2.offset_3, cstrpbrk_~scanp~2.base=v_cstrpbrk_~scanp~2.base_3} OutVars{cstrpbrk_~scanp~2.base=v_cstrpbrk_~scanp~2.base_3, cstrpbrk_#t~post2.base=|v_cstrpbrk_#t~post2.base_1|, cstrpbrk_#t~post2.offset=|v_cstrpbrk_#t~post2.offset_1|, cstrpbrk_~scanp~2.offset=v_cstrpbrk_~scanp~2.offset_3} AuxVars[] AssignedVars[cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset]
[2018-01-28 23:36:10,424 INFO L84 mationBacktranslator]: Skipped ATE [459] [459] L546''-->L546''': Formula: (and (= v_cstrpbrk_~scanp~2.offset_4 (+ |v_cstrpbrk_#t~post2.offset_2| 1)) (= v_cstrpbrk_~scanp~2.base_4 |v_cstrpbrk_#t~post2.base_2|)) InVars {cstrpbrk_#t~post2.offset=|v_cstrpbrk_#t~post2.offset_2|, cstrpbrk_#t~post2.base=|v_cstrpbrk_#t~post2.base_2|} OutVars{cstrpbrk_~scanp~2.base=v_cstrpbrk_~scanp~2.base_4, cstrpbrk_#t~post2.base=|v_cstrpbrk_#t~post2.base_2|, cstrpbrk_~scanp~2.offset=v_cstrpbrk_~scanp~2.offset_4, cstrpbrk_#t~post2.offset=|v_cstrpbrk_#t~post2.offset_2|} AuxVars[] AssignedVars[cstrpbrk_~scanp~2.offset, cstrpbrk_~scanp~2.base]
[2018-01-28 23:36:10,424 INFO L84 mationBacktranslator]: Skipped ATE [461] [461] L546'''-->L546'''': Formula: (and (<= (+ |v_cstrpbrk_#t~post2.offset_3| 1) (select |v_#length_3| |v_cstrpbrk_#t~post2.base_3|)) (= (select |v_#valid_5| |v_cstrpbrk_#t~post2.base_3|) 1) (= (select (select |v_#memory_int_part_locs_0_locs_0_6| |v_cstrpbrk_#t~post2.base_3|) |v_cstrpbrk_#t~post2.offset_3|) |v_cstrpbrk_#t~mem3_1|) (<= 0 |v_cstrpbrk_#t~post2.offset_3|)) InVars {#memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_6|, #length=|v_#length_3|, cstrpbrk_#t~post2.base=|v_cstrpbrk_#t~post2.base_3|, cstrpbrk_#t~post2.offset=|v_cstrpbrk_#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|, cstrpbrk_#t~post2.base=|v_cstrpbrk_#t~post2.base_3|, cstrpbrk_#t~post2.offset=|v_cstrpbrk_#t~post2.offset_3|, #valid=|v_#valid_5|, #length=|v_#length_3|, cstrpbrk_#t~mem3=|v_cstrpbrk_#t~mem3_1|} AuxVars[] AssignedVars[cstrpbrk_#t~mem3]
[2018-01-28 23:36:10,425 INFO L84 mationBacktranslator]: Skipped ATE [467] [467] L546''''-->L546''''': Formula: (= v_cstrpbrk_~sc~2_2 |v_cstrpbrk_#t~mem3_2|) InVars {cstrpbrk_#t~mem3=|v_cstrpbrk_#t~mem3_2|} OutVars{cstrpbrk_#t~mem3=|v_cstrpbrk_#t~mem3_2|, cstrpbrk_~sc~2=v_cstrpbrk_~sc~2_2} AuxVars[] AssignedVars[cstrpbrk_~sc~2]
[2018-01-28 23:36:10,425 INFO L84 mationBacktranslator]: Skipped ATE [469] [469] L546'''''-->L546'''''': Formula: (= 0 v_cstrpbrk_~sc~2_3) InVars {cstrpbrk_~sc~2=v_cstrpbrk_~sc~2_3} OutVars{cstrpbrk_~sc~2=v_cstrpbrk_~sc~2_3} AuxVars[] AssignedVars[]
[2018-01-28 23:36:10,425 INFO L84 mationBacktranslator]: Skipped ATE [473] [473] L546''''''-->L546''''''': Formula: true InVars {} OutVars{cstrpbrk_#t~post2.offset=|v_cstrpbrk_#t~post2.offset_5|, cstrpbrk_#t~post2.base=|v_cstrpbrk_#t~post2.base_6|} AuxVars[] AssignedVars[cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset]
[2018-01-28 23:36:10,425 INFO L84 mationBacktranslator]: Skipped ATE [477] [477] L546'''''''-->L546'''''''''''': Formula: true InVars {} OutVars{cstrpbrk_#t~mem3=|v_cstrpbrk_#t~mem3_3|} AuxVars[] AssignedVars[cstrpbrk_#t~mem3]
[2018-01-28 23:36:10,425 INFO L84 mationBacktranslator]: Skipped ATE [415] [415] L546''''''''''''-->L545: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]
[2018-01-28 23:36:10,425 INFO L84 mationBacktranslator]: Skipped ATE [423] [423] L545-->L545': Formula: (and (= |v_cstrpbrk_#t~post0.base_1| v_cstrpbrk_~s1.base_2) (= |v_cstrpbrk_#t~post0.offset_1| v_cstrpbrk_~s1.offset_2)) InVars {cstrpbrk_~s1.base=v_cstrpbrk_~s1.base_2, cstrpbrk_~s1.offset=v_cstrpbrk_~s1.offset_2} OutVars{cstrpbrk_#t~post0.base=|v_cstrpbrk_#t~post0.base_1|, cstrpbrk_~s1.base=v_cstrpbrk_~s1.base_2, cstrpbrk_~s1.offset=v_cstrpbrk_~s1.offset_2, cstrpbrk_#t~post0.offset=|v_cstrpbrk_#t~post0.offset_1|} AuxVars[] AssignedVars[cstrpbrk_#t~post0.base, cstrpbrk_#t~post0.offset]
[2018-01-28 23:36:10,425 INFO L84 mationBacktranslator]: Skipped ATE [427] [427] L545'-->L545'': Formula: (and (= v_cstrpbrk_~s1.base_3 |v_cstrpbrk_#t~post0.base_2|) (= v_cstrpbrk_~s1.offset_3 (+ |v_cstrpbrk_#t~post0.offset_2| 1))) InVars {cstrpbrk_#t~post0.base=|v_cstrpbrk_#t~post0.base_2|, cstrpbrk_#t~post0.offset=|v_cstrpbrk_#t~post0.offset_2|} OutVars{cstrpbrk_~s1.base=v_cstrpbrk_~s1.base_3, cstrpbrk_#t~post0.base=|v_cstrpbrk_#t~post0.base_2|, cstrpbrk_~s1.offset=v_cstrpbrk_~s1.offset_3, cstrpbrk_#t~post0.offset=|v_cstrpbrk_#t~post0.offset_2|} AuxVars[] AssignedVars[cstrpbrk_~s1.base, cstrpbrk_~s1.offset]
[2018-01-28 23:36:10,426 INFO L84 mationBacktranslator]: Skipped ATE [435] [435] L545''-->cstrpbrkErr1RequiresViolation: Formula: (or (not (<= 0 |v_cstrpbrk_#t~post0.offset_4|)) (not (<= (+ |v_cstrpbrk_#t~post0.offset_4| 1) (select |v_#length_2| |v_cstrpbrk_#t~post0.base_5|)))) InVars {#length=|v_#length_2|, cstrpbrk_#t~post0.base=|v_cstrpbrk_#t~post0.base_5|, cstrpbrk_#t~post0.offset=|v_cstrpbrk_#t~post0.offset_4|} OutVars{#length=|v_#length_2|, cstrpbrk_#t~post0.base=|v_cstrpbrk_#t~post0.base_5|, cstrpbrk_#t~post0.offset=|v_cstrpbrk_#t~post0.offset_4|} AuxVars[] AssignedVars[]
[2018-01-28 23:36:10,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 11:36:10 BasicIcfg
[2018-01-28 23:36:10,431 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2018-01-28 23:36:10,432 INFO L168 Benchmark]: Toolchain (without parser) took 24713.83 ms. Allocated memory was 304.6 MB in the beginning and 1.7 GB in the end (delta: 1.4 GB). Free memory was 264.5 MB in the beginning and 1.4 GB in the end (delta: -1.2 GB). Peak memory consumption was 269.3 MB. Max. memory is 5.3 GB.
[2018-01-28 23:36:10,433 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 304.6 MB. Free memory is still 270.5 MB. There was no memory consumed. Max. memory is 5.3 GB.
[2018-01-28 23:36:10,433 INFO L168 Benchmark]: CACSL2BoogieTranslator took 209.48 ms. Allocated memory is still 304.6 MB. Free memory was 263.5 MB in the beginning and 253.4 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB.
[2018-01-28 23:36:10,433 INFO L168 Benchmark]: Boogie Preprocessor took 31.58 ms. Allocated memory is still 304.6 MB. Free memory was 253.4 MB in the beginning and 251.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB.
[2018-01-28 23:36:10,433 INFO L168 Benchmark]: RCFGBuilder took 265.14 ms. Allocated memory is still 304.6 MB. Free memory was 251.4 MB in the beginning and 231.3 MB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 5.3 GB.
[2018-01-28 23:36:10,434 INFO L168 Benchmark]: IcfgTransformer took 21979.56 ms. Allocated memory was 304.6 MB in the beginning and 1.6 GB in the end (delta: 1.2 GB). Free memory was 231.3 MB in the beginning and 566.8 MB in the end (delta: -335.5 MB). Peak memory consumption was 912.8 MB. Max. memory is 5.3 GB.
[2018-01-28 23:36:10,434 INFO L168 Benchmark]: TraceAbstraction took 2218.35 ms. Allocated memory was 1.6 GB in the beginning and 1.7 GB in the end (delta: 191.9 MB). Free memory was 566.8 MB in the beginning and 1.4 GB in the end (delta: -868.6 MB). There was no memory consumed. Max. memory is 5.3 GB.
[2018-01-28 23:36:10,436 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.16 ms. Allocated memory is still 304.6 MB. Free memory is still 270.5 MB. There was no memory consumed. Max. memory is 5.3 GB.
* CACSL2BoogieTranslator took 209.48 ms. Allocated memory is still 304.6 MB. Free memory was 263.5 MB in the beginning and 253.4 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB.
* Boogie Preprocessor took 31.58 ms. Allocated memory is still 304.6 MB. Free memory was 253.4 MB in the beginning and 251.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB.
* RCFGBuilder took 265.14 ms. Allocated memory is still 304.6 MB. Free memory was 251.4 MB in the beginning and 231.3 MB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 5.3 GB.
* IcfgTransformer took 21979.56 ms. Allocated memory was 304.6 MB in the beginning and 1.6 GB in the end (delta: 1.2 GB). Free memory was 231.3 MB in the beginning and 566.8 MB in the end (delta: -335.5 MB). Peak memory consumption was 912.8 MB. Max. memory is 5.3 GB.
* TraceAbstraction took 2218.35 ms. Allocated memory was 1.6 GB in the beginning and 1.7 GB in the end (delta: 191.9 MB). Free memory was 566.8 MB in the beginning and 1.4 GB in the end (delta: -868.6 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 : 68
LocStat_MAX_WEQGRAPH_SIZE : 5
LocStat_MAX_SIZEOF_WEQEDGELABEL : 3
LocStat_NO_SUPPORTING_EQUALITIES : 1080
LocStat_NO_SUPPORTING_DISEQUALITIES : 476
LocStat_NO_DISJUNCTIONS : -136
LocStat_MAX_NO_DISJUNCTIONS : -1
#Transitions : 91
TransStat_MAX_WEQGRAPH_SIZE : 2
TransStat_MAX_SIZEOF_WEQEDGELABEL : 1
TransStat_NO_SUPPORTING_EQUALITIES : 109
TransStat_NO_SUPPORTING_DISEQUALITIES : 12
TransStat_NO_DISJUNCTIONS : 93
TransStat_MAX_NO_DISJUNCTIONS : 2
- StatisticsResult: EqConstraintFactoryStatistics
CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.760296
RENAME_VARIABLES(MILLISECONDS) : 0.128144
UNFREEZE(MILLISECONDS) : 0.000000
CONJOIN(MILLISECONDS) : 0.742537
PROJECTAWAY(MILLISECONDS) : 0.031350
ADD_WEAK_EQUALITY(MILLISECONDS) : 0.071902
DISJOIN(MILLISECONDS) : 0.121612
RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.148069
ADD_EQUALITY(MILLISECONDS) : 0.009712
DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000
ADD_DISEQUALITY(MILLISECONDS) : 0.005984
#CONJOIN_DISJUNCTIVE : 879
#RENAME_VARIABLES : 1844
#UNFREEZE : 0
#CONJOIN : 1111
#PROJECTAWAY : 1061
#ADD_WEAK_EQUALITY : 11
#DISJOIN : 173
#RENAME_VARIABLES_DISJUNCTIVE : 1838
#ADD_EQUALITY : 111
#DISJOIN_DISJUNCTIVE : 0
#ADD_DISEQUALITY : 10
* 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, 73 locations, 9 error locations. UNSAFE Result, 2.1s OverallTime, 10 OverallIterations, 2 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 517 SDtfs, 381 SDslu, 1150 SDs, 0 SdLazy, 561 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred 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, 13 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 251 NumberOfCodeBlocks, 251 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 199 ConstructedInterpolants, 0 QuantifiedInterpolants, 24282 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_cstrpbrk-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-Benchmark-0-2018-01-28_23-36-10-443.csv
Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-VPDomainBenchmark-0-2018-01-28_23-36-10-443.csv
Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-BenchmarkWithCounters-0-2018-01-28_23-36-10-443.csv
Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-HeapSeparatorBenchmark-0-2018-01-28_23-36-10-443.csv
Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-28_23-36-10-443.csv
Received shutdown request...