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_cstrcmp-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-30 01:12:38,404 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 01:12:38,406 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 01:12:38,418 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 01:12:38,419 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 01:12:38,420 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 01:12:38,421 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 01:12:38,422 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 01:12:38,424 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 01:12:38,424 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 01:12:38,425 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 01:12:38,425 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 01:12:38,426 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 01:12:38,427 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 01:12:38,427 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 01:12:38,430 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 01:12:38,432 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 01:12:38,434 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 01:12:38,435 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 01:12:38,436 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 01:12:38,439 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 01:12:38,439 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 01:12:38,439 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 01:12:38,440 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 01:12:38,441 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 01:12:38,442 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 01:12:38,442 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 01:12:38,443 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 01:12:38,443 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 01:12:38,443 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 01:12:38,444 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 01:12:38,444 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-30 01:12:38,454 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 01:12:38,454 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 01:12:38,455 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 01:12:38,455 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 01:12:38,455 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 01:12:38,455 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 01:12:38,456 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 01:12:38,456 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 01:12:38,456 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 01:12:38,457 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-30 01:12:38,457 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 01:12:38,457 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 01:12:38,457 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 01:12:38,457 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-30 01:12:38,457 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-30 01:12:38,458 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-30 01:12:38,458 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 01:12:38,458 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 01:12:38,458 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 01:12:38,458 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 01:12:38,459 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 01:12:38,459 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 01:12:38,459 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 01:12:38,459 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 01:12:38,459 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 01:12:38,459 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 01:12:38,460 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 01:12:38,460 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 01:12:38,460 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 01:12:38,460 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 01:12:38,460 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 01:12:38,461 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 01:12:38,461 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 01:12:38,462 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 01:12:38,493 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 01:12:38,502 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 01:12:38,505 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 01:12:38,506 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 01:12:38,506 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 01:12:38,507 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-01-30 01:12:38,676 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 01:12:38,682 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-01-30 01:12:38,683 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 01:12:38,683 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 01:12:38,690 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 01:12:38,691 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 01:12:38" (1/1) ... [2018-01-30 01:12:38,694 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50e730d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:12:38, skipping insertion in model container [2018-01-30 01:12:38,694 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 01:12:38" (1/1) ... [2018-01-30 01:12:38,712 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 01:12:38,750 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 01:12:38,865 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 01:12:38,886 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 01:12:38,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:12:38 WrapperNode [2018-01-30 01:12:38,894 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 01:12:38,895 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 01:12:38,895 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 01:12:38,896 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 01:12:38,907 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:12:38" (1/1) ... [2018-01-30 01:12:38,907 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:12:38" (1/1) ... [2018-01-30 01:12:38,915 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:12:38" (1/1) ... [2018-01-30 01:12:38,915 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:12:38" (1/1) ... [2018-01-30 01:12:38,918 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:12:38" (1/1) ... [2018-01-30 01:12:38,921 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:12:38" (1/1) ... [2018-01-30 01:12:38,922 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:12:38" (1/1) ... [2018-01-30 01:12:38,923 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 01:12:38,923 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 01:12:38,923 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 01:12:38,923 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 01:12:38,924 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:12:38" (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-30 01:12:38,967 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 01:12:38,968 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 01:12:38,968 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcmp [2018-01-30 01:12:38,968 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 01:12:38,968 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-30 01:12:38,968 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-30 01:12:38,968 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-30 01:12:38,968 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-30 01:12:38,968 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-30 01:12:38,968 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 01:12:38,969 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcmp [2018-01-30 01:12:38,969 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 01:12:38,969 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 01:12:38,969 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 01:12:39,197 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 01:12:39,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 01:12:39 BoogieIcfgContainer [2018-01-30 01:12:39,198 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 01:12:39,199 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-01-30 01:12:39,199 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-01-30 01:12:39,199 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-01-30 01:12:39,202 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 01:12:39" (1/1) ... [2018-01-30 01:12:39,211 INFO L103 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-01-30 01:12:39,211 INFO L104 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-01-30 01:12:39,211 INFO L150 apSepIcfgTransformer]: starting freeze-var-style preprocessing [2018-01-30 01:12:39,262 INFO L162 apSepIcfgTransformer]: finished StoreIndexFreezer, created 9 freeze vars and freeze var literals (each corresponds to one heap write) [2018-01-30 01:12:39,291 INFO L221 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-01-30 01:12:39,356 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-30 01:13:32,376 INFO L311 AbstractInterpreter]: Visited 89 different actions 500 times. Merged at 60 different actions 225 times. Never widened. Found 20 fixpoints after 5 different actions. Largest state had 57 variables. [2018-01-30 01:13:32,378 INFO L229 apSepIcfgTransformer]: finished equality analysis [2018-01-30 01:13:32,386 INFO L244 HeapSepPreAnalysis]: Number of read from array group [#memory_int] : 7 [2018-01-30 01:13:32,387 INFO L241 apSepIcfgTransformer]: Finished pre analysis before partitioning [2018-01-30 01:13:32,387 INFO L242 apSepIcfgTransformer]: array groups: Set: [#memory_int] [2018-01-30 01:13:32,387 INFO L244 apSepIcfgTransformer]: select infos: Set: ((select (select |v_#memory_int_2| |v_cstrcmp_#t~post0.base_3|) |v_cstrcmp_#t~post0.offset_3|), at (SUMMARY for call #t~mem2 := read~int(#t~post0.base, #t~post0.offset, 1); srcloc: L543''')) ((select (select |v_#memory_int_5| |v_cstrcmp_#t~pre5.base_2|) |v_cstrcmp_#t~pre5.offset_2|), at (SUMMARY for call #t~mem7 := read~int(#t~pre5.base, #t~pre5.offset, 1); srcloc: L546'')) ((select |v_#memory_int_9| v_main_~nondetString1~3.base_2), at (SUMMARY for call write~int(0, ~nondetString1~3.base, ~nondetString1~3.offset + (~length1~3 - 1) * 1, 1); srcloc: L559)) ((select (select |v_#memory_int_3| |v_cstrcmp_#t~post3.base_3|) |v_cstrcmp_#t~post3.offset_3|), at (SUMMARY for call #t~mem4 := read~int(#t~post3.base, #t~post3.offset, 1); srcloc: L544'')) ((select (select |v_#memory_int_1| v_cstrcmp_~s1.base_2) v_cstrcmp_~s1.offset_2), at (SUMMARY for call #t~mem1 := read~int(~s1.base, ~s1.offset, 1); srcloc: L543)) ((select (select |v_#memory_int_4| v_cstrcmp_~s1.base_7) v_cstrcmp_~s1.offset_6), at (SUMMARY for call #t~mem6 := read~int(~s1.base, ~s1.offset, 1); srcloc: L543''''''''''''')) ((select |v_#memory_int_11| v_main_~nondetString2~3.base_2), at (SUMMARY for call write~int(0, ~nondetString2~3.base, ~nondetString2~3.offset + (~length2~3 - 1) * 1, 1); srcloc: L559')) [2018-01-30 01:13:32,427 INFO L547 PartitionManager]: partitioning result: [2018-01-30 01:13:32,428 INFO L552 PartitionManager]: location blocks for array group [#memory_int] [2018-01-30 01:13:32,428 INFO L561 PartitionManager]: at dimension 0 [2018-01-30 01:13:32,428 INFO L562 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 3 [2018-01-30 01:13:32,428 INFO L563 PartitionManager]: # location blocks :3 [2018-01-30 01:13:32,428 INFO L561 PartitionManager]: at dimension 1 [2018-01-30 01:13:32,428 INFO L562 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 2 [2018-01-30 01:13:32,428 INFO L563 PartitionManager]: # location blocks :1 [2018-01-30 01:13:32,429 INFO L86 ransitionTransformer]: executing heap partitioning transformation [2018-01-30 01:13:32,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 01:13:32 BasicIcfg [2018-01-30 01:13:32,447 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-01-30 01:13:32,448 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 01:13:32,449 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 01:13:32,517 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 01:13:32,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 01:12:38" (1/4) ... [2018-01-30 01:13:32,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d7bb9fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 01:13:32, skipping insertion in model container [2018-01-30 01:13:32,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:12:38" (2/4) ... [2018-01-30 01:13:32,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d7bb9fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 01:13:32, skipping insertion in model container [2018-01-30 01:13:32,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 01:12:39" (3/4) ... [2018-01-30 01:13:32,519 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d7bb9fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 01:13:32, skipping insertion in model container [2018-01-30 01:13:32,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 01:13:32" (4/4) ... [2018-01-30 01:13:32,520 INFO L107 eAbstractionObserver]: Analyzing ICFG HeapSeparatedIcfg [2018-01-30 01:13:32,526 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 01:13:32,532 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-30 01:13:32,560 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 01:13:32,560 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 01:13:32,561 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 01:13:32,561 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 01:13:32,561 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 01:13:32,561 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 01:13:32,561 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 01:13:32,561 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 01:13:32,562 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 01:13:32,573 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2018-01-30 01:13:32,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-30 01:13:32,580 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:13:32,581 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:13:32,581 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-30 01:13:32,586 INFO L82 PathProgramCache]: Analyzing trace with hash 624907710, now seen corresponding path program 1 times [2018-01-30 01:13:32,588 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:13:32,588 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:13:32,632 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:13:32,632 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:13:32,632 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:13:32,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:13:32,679 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:13:32,762 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-30 01:13:32,764 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:13:32,764 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:13:32,766 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 01:13:32,773 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 01:13:32,773 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 01:13:32,775 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 4 states. [2018-01-30 01:13:32,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:13:32,895 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2018-01-30 01:13:32,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 01:13:32,897 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-30 01:13:32,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:13:32,911 INFO L225 Difference]: With dead ends: 108 [2018-01-30 01:13:32,918 INFO L226 Difference]: Without dead ends: 78 [2018-01-30 01:13:32,922 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 01:13:32,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-30 01:13:32,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-01-30 01:13:32,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-30 01:13:32,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2018-01-30 01:13:32,961 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 15 [2018-01-30 01:13:32,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:13:32,962 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2018-01-30 01:13:32,962 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 01:13:32,962 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2018-01-30 01:13:32,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-30 01:13:32,962 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:13:32,963 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:13:32,963 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-30 01:13:32,963 INFO L82 PathProgramCache]: Analyzing trace with hash 624907712, now seen corresponding path program 1 times [2018-01-30 01:13:32,963 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:13:32,963 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:13:32,964 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:13:32,964 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:13:32,964 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:13:32,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:13:32,976 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:13:33,117 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-30 01:13:33,117 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:13:33,117 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 01:13:33,118 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 01:13:33,118 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 01:13:33,118 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-30 01:13:33,119 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 6 states. [2018-01-30 01:13:33,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:13:33,179 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2018-01-30 01:13:33,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 01:13:33,180 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-01-30 01:13:33,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:13:33,181 INFO L225 Difference]: With dead ends: 78 [2018-01-30 01:13:33,182 INFO L226 Difference]: Without dead ends: 77 [2018-01-30 01:13:33,183 INFO L553 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-30 01:13:33,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-30 01:13:33,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-01-30 01:13:33,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-30 01:13:33,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2018-01-30 01:13:33,191 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 15 [2018-01-30 01:13:33,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:13:33,191 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2018-01-30 01:13:33,191 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 01:13:33,192 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2018-01-30 01:13:33,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-30 01:13:33,192 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:13:33,193 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:13:33,193 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-30 01:13:33,193 INFO L82 PathProgramCache]: Analyzing trace with hash -2102697119, now seen corresponding path program 1 times [2018-01-30 01:13:33,193 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:13:33,193 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:13:33,194 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:13:33,195 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:13:33,195 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:13:33,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:13:33,207 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:13:33,232 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-30 01:13:33,232 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:13:33,232 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:13:33,233 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 01:13:33,233 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 01:13:33,233 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 01:13:33,233 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 4 states. [2018-01-30 01:13:33,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:13:33,321 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2018-01-30 01:13:33,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 01:13:33,322 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-30 01:13:33,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:13:33,323 INFO L225 Difference]: With dead ends: 77 [2018-01-30 01:13:33,323 INFO L226 Difference]: Without dead ends: 76 [2018-01-30 01:13:33,324 INFO L553 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-30 01:13:33,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-30 01:13:33,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-01-30 01:13:33,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-30 01:13:33,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2018-01-30 01:13:33,331 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 16 [2018-01-30 01:13:33,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:13:33,331 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2018-01-30 01:13:33,331 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 01:13:33,331 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2018-01-30 01:13:33,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-30 01:13:33,332 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:13:33,332 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:13:33,332 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-30 01:13:33,332 INFO L82 PathProgramCache]: Analyzing trace with hash -2102697117, now seen corresponding path program 1 times [2018-01-30 01:13:33,332 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:13:33,333 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:13:33,333 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:13:33,334 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:13:33,334 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:13:33,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:13:33,342 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:13:33,406 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-30 01:13:33,407 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:13:33,407 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 01:13:33,407 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 01:13:33,407 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 01:13:33,407 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 01:13:33,408 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand 5 states. [2018-01-30 01:13:33,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:13:33,470 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2018-01-30 01:13:33,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 01:13:33,471 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-01-30 01:13:33,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:13:33,471 INFO L225 Difference]: With dead ends: 76 [2018-01-30 01:13:33,471 INFO L226 Difference]: Without dead ends: 75 [2018-01-30 01:13:33,472 INFO L553 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-30 01:13:33,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-30 01:13:33,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-01-30 01:13:33,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-30 01:13:33,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2018-01-30 01:13:33,477 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 16 [2018-01-30 01:13:33,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:13:33,478 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2018-01-30 01:13:33,478 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 01:13:33,478 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2018-01-30 01:13:33,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-30 01:13:33,478 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:13:33,479 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:13:33,479 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-30 01:13:33,479 INFO L82 PathProgramCache]: Analyzing trace with hash 435034608, now seen corresponding path program 1 times [2018-01-30 01:13:33,479 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:13:33,479 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:13:33,480 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:13:33,480 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:13:33,480 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:13:33,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:13:33,493 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:13:33,536 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-30 01:13:33,537 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:13:33,537 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 01:13:33,537 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 01:13:33,537 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 01:13:33,537 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 01:13:33,538 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 5 states. [2018-01-30 01:13:33,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:13:33,659 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2018-01-30 01:13:33,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 01:13:33,659 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-01-30 01:13:33,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:13:33,663 INFO L225 Difference]: With dead ends: 81 [2018-01-30 01:13:33,664 INFO L226 Difference]: Without dead ends: 79 [2018-01-30 01:13:33,664 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-30 01:13:33,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-30 01:13:33,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2018-01-30 01:13:33,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-30 01:13:33,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2018-01-30 01:13:33,670 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 21 [2018-01-30 01:13:33,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:13:33,670 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2018-01-30 01:13:33,671 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 01:13:33,671 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2018-01-30 01:13:33,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-30 01:13:33,671 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:13:33,671 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:13:33,671 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-30 01:13:33,671 INFO L82 PathProgramCache]: Analyzing trace with hash 435034610, now seen corresponding path program 1 times [2018-01-30 01:13:33,672 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:13:33,672 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:13:33,672 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:13:33,672 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:13:33,673 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:13:33,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:13:33,685 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:13:33,833 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-30 01:13:33,834 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:13:33,834 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-30 01:13:33,834 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 01:13:33,834 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 01:13:33,834 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-30 01:13:33,835 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 8 states. [2018-01-30 01:13:34,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:13:34,184 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2018-01-30 01:13:34,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 01:13:34,185 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-01-30 01:13:34,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:13:34,186 INFO L225 Difference]: With dead ends: 104 [2018-01-30 01:13:34,186 INFO L226 Difference]: Without dead ends: 102 [2018-01-30 01:13:34,187 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-01-30 01:13:34,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-01-30 01:13:34,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 84. [2018-01-30 01:13:34,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-30 01:13:34,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2018-01-30 01:13:34,206 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 21 [2018-01-30 01:13:34,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:13:34,211 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2018-01-30 01:13:34,211 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-30 01:13:34,212 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2018-01-30 01:13:34,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-30 01:13:34,213 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:13:34,213 INFO L350 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-30 01:13:34,213 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-30 01:13:34,213 INFO L82 PathProgramCache]: Analyzing trace with hash -2094903939, now seen corresponding path program 1 times [2018-01-30 01:13:34,213 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:13:34,213 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:13:34,214 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:13:34,214 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:13:34,214 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:13:34,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:13:34,237 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:13:34,291 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-30 01:13:34,292 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:13:34,292 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 01:13:34,292 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 01:13:34,292 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 01:13:34,292 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 01:13:34,293 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand 6 states. [2018-01-30 01:13:34,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:13:34,380 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2018-01-30 01:13:34,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 01:13:34,380 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-30 01:13:34,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:13:34,381 INFO L225 Difference]: With dead ends: 84 [2018-01-30 01:13:34,381 INFO L226 Difference]: Without dead ends: 83 [2018-01-30 01:13:34,381 INFO L553 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-30 01:13:34,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-30 01:13:34,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-01-30 01:13:34,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-30 01:13:34,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2018-01-30 01:13:34,386 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 24 [2018-01-30 01:13:34,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:13:34,387 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2018-01-30 01:13:34,387 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 01:13:34,387 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2018-01-30 01:13:34,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-30 01:13:34,387 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:13:34,387 INFO L350 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-30 01:13:34,387 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-30 01:13:34,387 INFO L82 PathProgramCache]: Analyzing trace with hash -2094903937, now seen corresponding path program 1 times [2018-01-30 01:13:34,388 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:13:34,388 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:13:34,388 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:13:34,388 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:13:34,388 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:13:34,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:13:34,401 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:13:34,519 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-30 01:13:34,519 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:13:34,519 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-30 01:13:34,520 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 01:13:34,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 01:13:34,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-30 01:13:34,520 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand 9 states. [2018-01-30 01:13:34,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:13:34,654 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2018-01-30 01:13:34,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-30 01:13:34,655 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-01-30 01:13:34,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:13:34,656 INFO L225 Difference]: With dead ends: 86 [2018-01-30 01:13:34,656 INFO L226 Difference]: Without dead ends: 85 [2018-01-30 01:13:34,656 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-01-30 01:13:34,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-30 01:13:34,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2018-01-30 01:13:34,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-30 01:13:34,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2018-01-30 01:13:34,663 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 24 [2018-01-30 01:13:34,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:13:34,664 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2018-01-30 01:13:34,664 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 01:13:34,664 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2018-01-30 01:13:34,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-30 01:13:34,665 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:13:34,665 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:13:34,665 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-30 01:13:34,665 INFO L82 PathProgramCache]: Analyzing trace with hash 2072569026, now seen corresponding path program 1 times [2018-01-30 01:13:34,665 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:13:34,665 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:13:34,666 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:13:34,666 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:13:34,666 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:13:34,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:13:34,678 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:13:34,756 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-30 01:13:34,756 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:13:34,756 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 01:13:34,756 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 01:13:34,756 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 01:13:34,756 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 01:13:34,757 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand 6 states. [2018-01-30 01:13:34,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:13:34,900 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2018-01-30 01:13:34,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 01:13:34,900 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-30 01:13:34,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:13:34,901 INFO L225 Difference]: With dead ends: 83 [2018-01-30 01:13:34,901 INFO L226 Difference]: Without dead ends: 65 [2018-01-30 01:13:34,901 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-30 01:13:34,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-30 01:13:34,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-01-30 01:13:34,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-01-30 01:13:34,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2018-01-30 01:13:34,906 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 25 [2018-01-30 01:13:34,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:13:34,906 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-01-30 01:13:34,906 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 01:13:34,906 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-01-30 01:13:34,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-30 01:13:34,907 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:13:34,907 INFO L350 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] [2018-01-30 01:13:34,907 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-30 01:13:34,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1979237878, now seen corresponding path program 1 times [2018-01-30 01:13:34,907 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:13:34,907 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:13:34,908 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:13:34,908 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:13:34,908 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:13:34,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:13:34,920 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:13:35,011 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-30 01:13:35,011 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:13:35,011 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-30 01:13:35,012 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 01:13:35,012 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 01:13:35,012 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-30 01:13:35,012 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 8 states. [2018-01-30 01:13:35,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:13:35,102 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2018-01-30 01:13:35,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 01:13:35,102 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-01-30 01:13:35,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:13:35,103 INFO L225 Difference]: With dead ends: 80 [2018-01-30 01:13:35,103 INFO L226 Difference]: Without dead ends: 79 [2018-01-30 01:13:35,104 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-01-30 01:13:35,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-30 01:13:35,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 71. [2018-01-30 01:13:35,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-30 01:13:35,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2018-01-30 01:13:35,109 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 31 [2018-01-30 01:13:35,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:13:35,109 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2018-01-30 01:13:35,109 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-30 01:13:35,109 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2018-01-30 01:13:35,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-30 01:13:35,110 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:13:35,110 INFO L350 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] [2018-01-30 01:13:35,110 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-30 01:13:35,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1979237876, now seen corresponding path program 1 times [2018-01-30 01:13:35,111 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:13:35,111 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:13:35,112 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:13:35,112 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:13:35,112 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:13:35,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:13:35,122 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:13:35,164 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-30 01:13:35,164 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:13:35,164 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 01:13:35,165 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 01:13:35,165 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 01:13:35,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 01:13:35,165 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand 6 states. [2018-01-30 01:13:35,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:13:35,219 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2018-01-30 01:13:35,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 01:13:35,220 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-01-30 01:13:35,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:13:35,221 INFO L225 Difference]: With dead ends: 71 [2018-01-30 01:13:35,221 INFO L226 Difference]: Without dead ends: 69 [2018-01-30 01:13:35,221 INFO L553 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-30 01:13:35,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-30 01:13:35,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-01-30 01:13:35,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-01-30 01:13:35,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2018-01-30 01:13:35,226 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 31 [2018-01-30 01:13:35,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:13:35,226 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2018-01-30 01:13:35,226 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 01:13:35,226 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-01-30 01:13:35,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-30 01:13:35,227 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:13:35,228 INFO L350 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] [2018-01-30 01:13:35,228 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-30 01:13:35,228 INFO L82 PathProgramCache]: Analyzing trace with hash 200225437, now seen corresponding path program 1 times [2018-01-30 01:13:35,228 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:13:35,228 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:13:35,229 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:13:35,229 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:13:35,229 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:13:35,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:13:35,238 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:13:35,294 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-30 01:13:35,295 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:13:35,295 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 01:13:35,295 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 01:13:35,295 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 01:13:35,295 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-30 01:13:35,295 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 7 states. [2018-01-30 01:13:35,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:13:35,391 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-01-30 01:13:35,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 01:13:35,392 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2018-01-30 01:13:35,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:13:35,392 INFO L225 Difference]: With dead ends: 69 [2018-01-30 01:13:35,393 INFO L226 Difference]: Without dead ends: 68 [2018-01-30 01:13:35,393 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-01-30 01:13:35,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-30 01:13:35,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-01-30 01:13:35,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-01-30 01:13:35,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2018-01-30 01:13:35,397 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 32 [2018-01-30 01:13:35,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:13:35,398 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2018-01-30 01:13:35,398 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 01:13:35,398 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-01-30 01:13:35,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-30 01:13:35,399 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:13:35,399 INFO L350 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] [2018-01-30 01:13:35,399 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-30 01:13:35,399 INFO L82 PathProgramCache]: Analyzing trace with hash 200225439, now seen corresponding path program 1 times [2018-01-30 01:13:35,399 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:13:35,399 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:13:35,400 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:13:35,400 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:13:35,400 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:13:35,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:13:35,412 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:13:35,494 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-30 01:13:35,494 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:13:35,494 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-30 01:13:35,495 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-30 01:13:35,495 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-30 01:13:35,495 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-01-30 01:13:35,495 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 10 states. [2018-01-30 01:13:35,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:13:35,650 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2018-01-30 01:13:35,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-30 01:13:35,651 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-01-30 01:13:35,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:13:35,651 INFO L225 Difference]: With dead ends: 80 [2018-01-30 01:13:35,651 INFO L226 Difference]: Without dead ends: 72 [2018-01-30 01:13:35,652 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2018-01-30 01:13:35,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-01-30 01:13:35,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 64. [2018-01-30 01:13:35,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-30 01:13:35,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2018-01-30 01:13:35,655 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 32 [2018-01-30 01:13:35,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:13:35,655 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2018-01-30 01:13:35,655 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-30 01:13:35,655 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2018-01-30 01:13:35,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-30 01:13:35,657 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:13:35,657 INFO L350 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:13:35,657 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-30 01:13:35,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1780045537, now seen corresponding path program 1 times [2018-01-30 01:13:35,657 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:13:35,657 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:13:35,658 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:13:35,658 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:13:35,658 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:13:35,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:13:35,671 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:13:35,870 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:13:35,870 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:13:35,870 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:13:35,876 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:13:35,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:13:35,915 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:13:35,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-30 01:13:35,965 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:13:35,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 01:13:35,976 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:24 [2018-01-30 01:13:36,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-30 01:13:36,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-30 01:13:36,037 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 01:13:36,049 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:13:36,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 01:13:36,086 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2018-01-30 01:13:36,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-30 01:13:36,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-01-30 01:13:36,737 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-30 01:13:36,741 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 01:13:36,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-30 01:13:36,753 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-01-30 01:13:36,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:13:36,836 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:13:36,918 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2018-01-30 01:13:36,918 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-30 01:13:36,918 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-30 01:13:36,919 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=297, Unknown=3, NotChecked=0, Total=342 [2018-01-30 01:13:36,919 INFO L87 Difference]: Start difference. First operand 64 states and 67 transitions. Second operand 19 states. [2018-01-30 01:13:37,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:13:37,745 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2018-01-30 01:13:37,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-30 01:13:37,745 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2018-01-30 01:13:37,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:13:37,746 INFO L225 Difference]: With dead ends: 89 [2018-01-30 01:13:37,746 INFO L226 Difference]: Without dead ends: 87 [2018-01-30 01:13:37,747 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=121, Invalid=632, Unknown=3, NotChecked=0, Total=756 [2018-01-30 01:13:37,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-30 01:13:37,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 77. [2018-01-30 01:13:37,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-30 01:13:37,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2018-01-30 01:13:37,752 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 36 [2018-01-30 01:13:37,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:13:37,752 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2018-01-30 01:13:37,752 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-30 01:13:37,753 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2018-01-30 01:13:37,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-30 01:13:37,753 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:13:37,754 INFO L350 BasicCegarLoop]: trace histogram [2, 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] [2018-01-30 01:13:37,754 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-30 01:13:37,754 INFO L82 PathProgramCache]: Analyzing trace with hash -624282064, now seen corresponding path program 1 times [2018-01-30 01:13:37,754 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:13:37,754 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:13:37,755 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:13:37,755 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:13:37,755 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:13:37,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:13:37,770 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:13:38,110 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:13:38,110 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:13:38,110 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:13:38,115 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:13:38,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:13:38,134 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:13:38,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-30 01:13:38,139 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:13:38,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-30 01:13:38,143 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:18, output treesize:17 [2018-01-30 01:13:38,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-30 01:13:38,179 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:13:38,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2018-01-30 01:13:38,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-01-30 01:13:38,207 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 01:13:38,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-01-30 01:13:38,228 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 01:13:38,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-01-30 01:13:38,246 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-30 01:13:38,253 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:13:38,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-30 01:13:38,260 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:38, output treesize:31 [2018-01-30 01:13:38,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-30 01:13:38,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-01-30 01:13:38,752 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-30 01:13:38,758 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 01:13:38,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-01-30 01:13:38,792 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:55, output treesize:63 [2018-01-30 01:13:40,377 WARN L143 SmtUtils]: Spent 1350ms on a formula simplification that was a NOOP. DAG size: 32 [2018-01-30 01:13:42,460 WARN L143 SmtUtils]: Spent 2035ms on a formula simplification that was a NOOP. DAG size: 32 [2018-01-30 01:13:42,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-01-30 01:13:42,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-01-30 01:13:42,481 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-30 01:13:42,491 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 01:13:42,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-01-30 01:13:42,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2018-01-30 01:13:42,519 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 01:13:42,524 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:13:42,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-30 01:13:42,541 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:62, output treesize:24 [2018-01-30 01:13:42,617 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:13:42,654 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:13:42,654 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 28 [2018-01-30 01:13:42,654 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-30 01:13:42,654 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-30 01:13:42,655 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=738, Unknown=3, NotChecked=0, Total=812 [2018-01-30 01:13:42,655 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 29 states. [2018-01-30 01:13:44,142 WARN L146 SmtUtils]: Spent 218ms on a formula simplification. DAG size of input: 86 DAG size of output 64 [2018-01-30 01:13:44,317 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 90 DAG size of output 66 [2018-01-30 01:13:46,455 WARN L146 SmtUtils]: Spent 2017ms on a formula simplification. DAG size of input: 74 DAG size of output 66 [2018-01-30 01:13:50,596 WARN L146 SmtUtils]: Spent 4090ms on a formula simplification. DAG size of input: 65 DAG size of output 60 [2018-01-30 01:13:52,512 WARN L146 SmtUtils]: Spent 1875ms on a formula simplification. DAG size of input: 70 DAG size of output 65 [2018-01-30 01:13:53,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:13:53,044 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2018-01-30 01:13:53,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-30 01:13:53,044 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 39 [2018-01-30 01:13:53,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:13:53,045 INFO L225 Difference]: With dead ends: 87 [2018-01-30 01:13:53,045 INFO L226 Difference]: Without dead ends: 86 [2018-01-30 01:13:53,046 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=305, Invalid=2042, Unknown=5, NotChecked=0, Total=2352 [2018-01-30 01:13:53,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-30 01:13:53,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 77. [2018-01-30 01:13:53,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-30 01:13:53,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2018-01-30 01:13:53,053 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 39 [2018-01-30 01:13:53,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:13:53,053 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-01-30 01:13:53,053 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-30 01:13:53,053 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-01-30 01:13:53,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-30 01:13:53,054 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:13:53,054 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-01-30 01:13:53,054 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-30 01:13:53,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1741415461, now seen corresponding path program 1 times [2018-01-30 01:13:53,054 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:13:53,054 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:13:53,055 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:13:53,055 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:13:53,055 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:13:53,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:13:53,066 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:13:53,274 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:13:53,275 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:13:53,275 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:13:53,282 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:13:53,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:13:53,304 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:13:53,321 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:13:53,342 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:13:53,342 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 11 [2018-01-30 01:13:53,342 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-30 01:13:53,342 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-30 01:13:53,342 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-01-30 01:13:53,343 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 12 states. [2018-01-30 01:13:53,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:13:53,517 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-01-30 01:13:53,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-30 01:13:53,517 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 46 [2018-01-30 01:13:53,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:13:53,518 INFO L225 Difference]: With dead ends: 77 [2018-01-30 01:13:53,518 INFO L226 Difference]: Without dead ends: 75 [2018-01-30 01:13:53,519 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2018-01-30 01:13:53,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-30 01:13:53,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 70. [2018-01-30 01:13:53,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-30 01:13:53,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2018-01-30 01:13:53,526 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 46 [2018-01-30 01:13:53,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:13:53,526 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2018-01-30 01:13:53,526 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-30 01:13:53,526 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2018-01-30 01:13:53,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-30 01:13:53,527 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:13:53,527 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 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-30 01:13:53,527 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-30 01:13:53,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1417665104, now seen corresponding path program 1 times [2018-01-30 01:13:53,528 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:13:53,528 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:13:53,528 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:13:53,528 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:13:53,529 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:13:53,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:13:53,538 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:13:53,679 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:13:53,680 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:13:53,680 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:13:53,689 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:13:53,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:13:53,708 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:13:53,752 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:13:53,774 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 01:13:53,774 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 14 [2018-01-30 01:13:53,774 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-30 01:13:53,775 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-30 01:13:53,775 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-01-30 01:13:53,775 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 15 states. [2018-01-30 01:13:53,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:13:53,995 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2018-01-30 01:13:53,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-30 01:13:53,995 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2018-01-30 01:13:53,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:13:53,996 INFO L225 Difference]: With dead ends: 70 [2018-01-30 01:13:53,996 INFO L226 Difference]: Without dead ends: 62 [2018-01-30 01:13:53,996 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2018-01-30 01:13:53,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-30 01:13:54,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-01-30 01:13:54,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-30 01:13:54,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2018-01-30 01:13:54,003 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 47 [2018-01-30 01:13:54,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:13:54,003 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2018-01-30 01:13:54,003 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-30 01:13:54,003 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2018-01-30 01:13:54,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-30 01:13:54,003 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:13:54,003 INFO L350 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:13:54,003 INFO L371 AbstractCegarLoop]: === Iteration 18 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-30 01:13:54,004 INFO L82 PathProgramCache]: Analyzing trace with hash 633126418, now seen corresponding path program 2 times [2018-01-30 01:13:54,004 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:13:54,004 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:13:54,004 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:13:54,004 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:13:54,004 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:13:54,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:13:54,017 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:13:54,369 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:13:54,369 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:13:54,369 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:13:54,374 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 01:13:54,384 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:13:54,390 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:13:54,393 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:13:54,396 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:13:54,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-30 01:13:54,419 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:13:54,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 01:13:54,425 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:24 [2018-01-30 01:13:54,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-30 01:13:54,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-30 01:13:54,459 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 01:13:54,460 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:13:54,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 01:13:54,466 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2018-01-30 01:13:55,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-01-30 01:13:55,022 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:13:55,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 35 [2018-01-30 01:13:55,039 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-30 01:13:55,069 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 01:13:55,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-30 01:13:55,130 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:43 [2018-01-30 01:13:55,224 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:13:55,246 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:13:55,246 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 28 [2018-01-30 01:13:55,247 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-30 01:13:55,247 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-30 01:13:55,247 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=726, Unknown=7, NotChecked=0, Total=812 [2018-01-30 01:13:55,248 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand 29 states. [2018-01-30 01:13:56,318 WARN L146 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 73 DAG size of output 56 [2018-01-30 01:13:57,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:13:57,448 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2018-01-30 01:13:57,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-30 01:13:57,449 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 51 [2018-01-30 01:13:57,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:13:57,449 INFO L225 Difference]: With dead ends: 68 [2018-01-30 01:13:57,449 INFO L226 Difference]: Without dead ends: 67 [2018-01-30 01:13:57,450 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=299, Invalid=1856, Unknown=7, NotChecked=0, Total=2162 [2018-01-30 01:13:57,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-30 01:13:57,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 61. [2018-01-30 01:13:57,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-30 01:13:57,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2018-01-30 01:13:57,455 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 51 [2018-01-30 01:13:57,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:13:57,455 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2018-01-30 01:13:57,455 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-30 01:13:57,456 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2018-01-30 01:13:57,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-30 01:13:57,456 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:13:57,456 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:13:57,456 INFO L371 AbstractCegarLoop]: === Iteration 19 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-30 01:13:57,457 INFO L82 PathProgramCache]: Analyzing trace with hash -2026916513, now seen corresponding path program 2 times [2018-01-30 01:13:57,457 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:13:57,457 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:13:57,457 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:13:57,457 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:13:57,458 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:13:57,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:13:57,470 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:13:58,087 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:13:58,087 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:13:58,087 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:13:58,097 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 01:13:58,111 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:13:58,119 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:13:58,122 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:13:58,126 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:13:58,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 01:13:58,130 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:13:58,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:13:58,134 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-30 01:13:58,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-01-30 01:13:58,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-01-30 01:13:58,191 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_arrayElimArr_1 term size 6 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:270) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:243) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:445) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:283) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:237) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:185) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackTraceAbstractionRefinementStrategy.getTraceCheck(MultiTrackTraceAbstractionRefinementStrategy.java:218) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:396) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-01-30 01:13:58,194 INFO L168 Benchmark]: Toolchain (without parser) took 79517.89 ms. Allocated memory was 292.6 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 250.4 MB in the beginning and 1.9 GB in the end (delta: -1.6 GB). Peak memory consumption was 361.5 MB. Max. memory is 5.3 GB. [2018-01-30 01:13:58,195 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 292.6 MB. Free memory is still 256.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 01:13:58,195 INFO L168 Benchmark]: CACSL2BoogieTranslator took 212.16 ms. Allocated memory is still 292.6 MB. Free memory was 249.4 MB in the beginning and 239.3 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-30 01:13:58,195 INFO L168 Benchmark]: Boogie Preprocessor took 27.64 ms. Allocated memory is still 292.6 MB. Free memory was 239.3 MB in the beginning and 237.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-30 01:13:58,195 INFO L168 Benchmark]: RCFGBuilder took 275.14 ms. Allocated memory is still 292.6 MB. Free memory was 237.3 MB in the beginning and 216.3 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 5.3 GB. [2018-01-30 01:13:58,195 INFO L168 Benchmark]: IcfgTransformer took 53248.94 ms. Allocated memory was 292.6 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 216.3 MB in the beginning and 147.9 MB in the end (delta: 68.4 MB). Peak memory consumption was 1.9 GB. Max. memory is 5.3 GB. [2018-01-30 01:13:58,196 INFO L168 Benchmark]: TraceAbstraction took 25745.13 ms. Allocated memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: 99.1 MB). Free memory was 147.9 MB in the beginning and 1.9 GB in the end (delta: -1.7 GB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 01:13:58,197 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.12 ms. Allocated memory is still 292.6 MB. Free memory is still 256.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 212.16 ms. Allocated memory is still 292.6 MB. Free memory was 249.4 MB in the beginning and 239.3 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 27.64 ms. Allocated memory is still 292.6 MB. Free memory was 239.3 MB in the beginning and 237.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 275.14 ms. Allocated memory is still 292.6 MB. Free memory was 237.3 MB in the beginning and 216.3 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 5.3 GB. * IcfgTransformer took 53248.94 ms. Allocated memory was 292.6 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 216.3 MB in the beginning and 147.9 MB in the end (delta: 68.4 MB). Peak memory consumption was 1.9 GB. Max. memory is 5.3 GB. * TraceAbstraction took 25745.13 ms. Allocated memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: 99.1 MB). Free memory was 147.9 MB in the beginning and 1.9 GB in the end (delta: -1.7 GB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 74 LocStat_MAX_WEQGRAPH_SIZE : 5 LocStat_MAX_SIZEOF_WEQEDGELABEL : 3 LocStat_NO_SUPPORTING_EQUALITIES : 2098 LocStat_NO_SUPPORTING_DISEQUALITIES : 1175 LocStat_NO_DISJUNCTIONS : -148 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 98 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 159 TransStat_NO_SUPPORTING_DISEQUALITIES : 14 TransStat_NO_DISJUNCTIONS : 104 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 2.467852 RENAME_VARIABLES(MILLISECONDS) : 0.008779 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.539136 PROJECTAWAY(MILLISECONDS) : 1.085149 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.053826 DISJOIN(MILLISECONDS) : 0.308878 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.018224 ADD_EQUALITY(MILLISECONDS) : 0.011154 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.009160 #CONJOIN_DISJUNCTIVE : 792 #RENAME_VARIABLES : 1708 #UNFREEZE : 0 #CONJOIN : 1108 #PROJECTAWAY : 992 #ADD_WEAK_EQUALITY : 11 #DISJOIN : 318 #RENAME_VARIABLES_DISJUNCTIVE : 1646 #ADD_EQUALITY : 161 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 12 * Results from de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: - StatisticsResult: HeapSeparatorStatistics #COUNT_NEW_ARRAY_VARS_[#memory_int] : 3 COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_0 : 3 COUNT_BLOCKS_for_[#memory_int]_at_dim_0 : 3 COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_1 : 2 COUNT_BLOCKS_for_[#memory_int]_at_dim_1 : 1 COUNT_ARRAY_READS for [#memory_int] : 7 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimArr_1 term size 6 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimArr_1 term size 6: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-Benchmark-0-2018-01-30_01-13-58-204.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-VPDomainBenchmark-0-2018-01-30_01-13-58-204.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-BenchmarkWithCounters-0-2018-01-30_01-13-58-204.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-HeapSeparatorBenchmark-0-2018-01-30_01-13-58-204.csv Received shutdown request...