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/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/heap-manipulation/merge_sort_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-47db877 [2018-01-23 14:49:01,602 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-23 14:49:01,604 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-23 14:49:01,616 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-23 14:49:01,617 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-23 14:49:01,618 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-23 14:49:01,619 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-23 14:49:01,620 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-23 14:49:01,622 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-23 14:49:01,622 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-23 14:49:01,623 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-23 14:49:01,623 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-23 14:49:01,624 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-23 14:49:01,625 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-23 14:49:01,626 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-23 14:49:01,629 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-23 14:49:01,631 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-23 14:49:01,633 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-23 14:49:01,634 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-23 14:49:01,635 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-23 14:49:01,638 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-23 14:49:01,638 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-23 14:49:01,638 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-23 14:49:01,639 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-23 14:49:01,640 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-23 14:49:01,641 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-23 14:49:01,641 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-23 14:49:01,642 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-23 14:49:01,642 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-23 14:49:01,642 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-23 14:49:01,643 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-23 14:49:01,643 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Camel+AI_EQ.epf [2018-01-23 14:49:01,653 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-23 14:49:01,654 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-23 14:49:01,655 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-23 14:49:01,655 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-23 14:49:01,655 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-23 14:49:01,655 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-23 14:49:01,655 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-23 14:49:01,656 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-23 14:49:01,656 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-23 14:49:01,657 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-23 14:49:01,657 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-23 14:49:01,657 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-23 14:49:01,657 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-23 14:49:01,657 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-23 14:49:01,658 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-23 14:49:01,658 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-23 14:49:01,658 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-23 14:49:01,658 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-23 14:49:01,658 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-23 14:49:01,659 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-23 14:49:01,659 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-23 14:49:01,659 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-23 14:49:01,659 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-23 14:49:01,659 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-23 14:49:01,660 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-23 14:49:01,660 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-23 14:49:01,660 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-23 14:49:01,660 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-23 14:49:01,660 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-23 14:49:01,661 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-23 14:49:01,661 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-23 14:49:01,661 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-23 14:49:01,661 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-23 14:49:01,662 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-23 14:49:01,662 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-23 14:49:01,663 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-23 14:49:01,663 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-23 14:49:01,698 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-23 14:49:01,710 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-23 14:49:01,714 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-23 14:49:01,716 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-23 14:49:01,716 INFO L276 PluginConnector]: CDTParser initialized [2018-01-23 14:49:01,717 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-manipulation/merge_sort_true-unreach-call_true-valid-memsafety.i [2018-01-23 14:49:01,903 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-23 14:49:01,909 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-23 14:49:01,909 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-23 14:49:01,910 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-23 14:49:01,915 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-23 14:49:01,916 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 02:49:01" (1/1) ... [2018-01-23 14:49:01,920 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24adc032 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:49:01, skipping insertion in model container [2018-01-23 14:49:01,921 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 02:49:01" (1/1) ... [2018-01-23 14:49:01,940 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-23 14:49:01,985 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-23 14:49:02,104 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-23 14:49:02,132 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-23 14:49:02,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:49:02 WrapperNode [2018-01-23 14:49:02,147 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-23 14:49:02,148 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-23 14:49:02,148 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-23 14:49:02,148 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-23 14:49:02,161 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:49:02" (1/1) ... [2018-01-23 14:49:02,162 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:49:02" (1/1) ... [2018-01-23 14:49:02,174 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:49:02" (1/1) ... [2018-01-23 14:49:02,175 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:49:02" (1/1) ... [2018-01-23 14:49:02,187 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:49:02" (1/1) ... [2018-01-23 14:49:02,195 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:49:02" (1/1) ... [2018-01-23 14:49:02,198 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:49:02" (1/1) ... [2018-01-23 14:49:02,202 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-23 14:49:02,203 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-23 14:49:02,203 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-23 14:49:02,203 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-23 14:49:02,204 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:49:02" (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-23 14:49:02,252 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-23 14:49:02,253 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-23 14:49:02,253 INFO L136 BoogieDeclarations]: Found implementation of procedure fail [2018-01-23 14:49:02,253 INFO L136 BoogieDeclarations]: Found implementation of procedure merge_single_node [2018-01-23 14:49:02,253 INFO L136 BoogieDeclarations]: Found implementation of procedure merge_pair [2018-01-23 14:49:02,253 INFO L136 BoogieDeclarations]: Found implementation of procedure seq_sort_core [2018-01-23 14:49:02,253 INFO L136 BoogieDeclarations]: Found implementation of procedure inspect_before [2018-01-23 14:49:02,253 INFO L136 BoogieDeclarations]: Found implementation of procedure inspect_after [2018-01-23 14:49:02,253 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-23 14:49:02,253 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-23 14:49:02,254 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-23 14:49:02,254 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-23 14:49:02,254 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-23 14:49:02,254 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-23 14:49:02,254 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-23 14:49:02,254 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-23 14:49:02,254 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-23 14:49:02,254 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-23 14:49:02,254 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-01-23 14:49:02,255 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-23 14:49:02,255 INFO L128 BoogieDeclarations]: Found specification of procedure fail [2018-01-23 14:49:02,255 INFO L128 BoogieDeclarations]: Found specification of procedure merge_single_node [2018-01-23 14:49:02,255 INFO L128 BoogieDeclarations]: Found specification of procedure merge_pair [2018-01-23 14:49:02,255 INFO L128 BoogieDeclarations]: Found specification of procedure seq_sort_core [2018-01-23 14:49:02,255 INFO L128 BoogieDeclarations]: Found specification of procedure inspect_before [2018-01-23 14:49:02,255 INFO L128 BoogieDeclarations]: Found specification of procedure inspect_after [2018-01-23 14:49:02,256 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-23 14:49:02,256 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-23 14:49:02,256 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-23 14:49:02,895 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-23 14:49:02,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 02:49:02 BoogieIcfgContainer [2018-01-23 14:49:02,896 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-23 14:49:02,897 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-23 14:49:02,897 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-23 14:49:02,899 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-23 14:49:02,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.01 02:49:01" (1/3) ... [2018-01-23 14:49:02,901 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b34a369 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 02:49:02, skipping insertion in model container [2018-01-23 14:49:02,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:49:02" (2/3) ... [2018-01-23 14:49:02,902 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b34a369 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 02:49:02, skipping insertion in model container [2018-01-23 14:49:02,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 02:49:02" (3/3) ... [2018-01-23 14:49:02,904 INFO L105 eAbstractionObserver]: Analyzing ICFG merge_sort_true-unreach-call_true-valid-memsafety.i [2018-01-23 14:49:02,913 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-23 14:49:02,922 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-23 14:49:02,977 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:49:02,977 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:49:02,977 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:49:02,978 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:49:02,978 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:49:02,978 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:49:02,978 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:49:02,978 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == failErr0EnsuresViolation======== [2018-01-23 14:49:02,979 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:49:03,004 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states. [2018-01-23 14:49:03,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-23 14:49:03,012 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:49:03,013 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:49:03,013 INFO L371 AbstractCegarLoop]: === Iteration 1 === [failErr0EnsuresViolation]=== [2018-01-23 14:49:03,018 INFO L82 PathProgramCache]: Analyzing trace with hash -101851905, now seen corresponding path program 1 times [2018-01-23 14:49:03,020 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:49:03,021 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:49:03,067 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:49:03,067 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:49:03,068 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:49:03,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:49:03,125 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:49:03,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:49:03,153 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:49:03,153 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:49:03,155 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:49:03,248 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:49:03,249 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:49:03,251 INFO L87 Difference]: Start difference. First operand 215 states. Second operand 2 states. [2018-01-23 14:49:03,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:49:03,300 INFO L93 Difference]: Finished difference Result 417 states and 571 transitions. [2018-01-23 14:49:03,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:49:03,302 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-01-23 14:49:03,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:49:03,308 INFO L225 Difference]: With dead ends: 417 [2018-01-23 14:49:03,309 INFO L226 Difference]: Without dead ends: 0 [2018-01-23 14:49:03,314 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:49:03,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-23 14:49:03,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-23 14:49:03,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-23 14:49:03,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-23 14:49:03,333 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2018-01-23 14:49:03,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:49:03,333 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-23 14:49:03,334 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:49:03,334 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-23 14:49:03,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-23 14:49:03,337 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-23 14:49:03,462 INFO L404 ceAbstractionStarter]: At program point failENTRY(lines 553 555) the Hoare annotation is: true [2018-01-23 14:49:03,462 INFO L401 ceAbstractionStarter]: For program point failFINAL(lines 553 555) no Hoare annotation was computed. [2018-01-23 14:49:03,462 INFO L401 ceAbstractionStarter]: For program point failErr0EnsuresViolation(lines 553 555) no Hoare annotation was computed. [2018-01-23 14:49:03,462 INFO L401 ceAbstractionStarter]: For program point failEXIT(lines 553 555) no Hoare annotation was computed. [2018-01-23 14:49:03,462 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 655) no Hoare annotation was computed. [2018-01-23 14:49:03,462 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 655) no Hoare annotation was computed. [2018-01-23 14:49:03,462 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 655) the Hoare annotation is: true [2018-01-23 14:49:03,463 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 655) no Hoare annotation was computed. [2018-01-23 14:49:03,463 INFO L404 ceAbstractionStarter]: At program point L581(line 581) the Hoare annotation is: true [2018-01-23 14:49:03,463 INFO L404 ceAbstractionStarter]: At program point L581'(line 581) the Hoare annotation is: true [2018-01-23 14:49:03,463 INFO L401 ceAbstractionStarter]: For program point L573'(lines 573 583) no Hoare annotation was computed. [2018-01-23 14:49:03,463 INFO L401 ceAbstractionStarter]: For program point merge_pairFINAL(lines 573 583) no Hoare annotation was computed. [2018-01-23 14:49:03,463 INFO L401 ceAbstractionStarter]: For program point L577'''''(line 577) no Hoare annotation was computed. [2018-01-23 14:49:03,463 INFO L401 ceAbstractionStarter]: For program point L578''''''''''(line 578) no Hoare annotation was computed. [2018-01-23 14:49:03,463 INFO L401 ceAbstractionStarter]: For program point L573'''''''''''(lines 573 583) no Hoare annotation was computed. [2018-01-23 14:49:03,463 INFO L401 ceAbstractionStarter]: For program point L578''''''''''''''(line 578) no Hoare annotation was computed. [2018-01-23 14:49:03,463 INFO L401 ceAbstractionStarter]: For program point L573''(lines 573 583) no Hoare annotation was computed. [2018-01-23 14:49:03,463 INFO L404 ceAbstractionStarter]: At program point merge_pairENTRY(lines 573 583) the Hoare annotation is: true [2018-01-23 14:49:03,464 INFO L401 ceAbstractionStarter]: For program point L573''''''''''''''(lines 573 583) no Hoare annotation was computed. [2018-01-23 14:49:03,464 INFO L401 ceAbstractionStarter]: For program point L573''''''''''''''''(lines 573 583) no Hoare annotation was computed. [2018-01-23 14:49:03,464 INFO L401 ceAbstractionStarter]: For program point L578'(line 578) no Hoare annotation was computed. [2018-01-23 14:49:03,464 INFO L401 ceAbstractionStarter]: For program point L573''''''''''''''''''(lines 573 583) no Hoare annotation was computed. [2018-01-23 14:49:03,464 INFO L401 ceAbstractionStarter]: For program point L577''(line 577) no Hoare annotation was computed. [2018-01-23 14:49:03,464 INFO L401 ceAbstractionStarter]: For program point L573''''''(lines 573 583) no Hoare annotation was computed. [2018-01-23 14:49:03,464 INFO L401 ceAbstractionStarter]: For program point L573''''''''(lines 573 583) no Hoare annotation was computed. [2018-01-23 14:49:03,464 INFO L401 ceAbstractionStarter]: For program point L573(lines 573 583) no Hoare annotation was computed. [2018-01-23 14:49:03,464 INFO L401 ceAbstractionStarter]: For program point L573'''''(lines 573 583) no Hoare annotation was computed. [2018-01-23 14:49:03,464 INFO L404 ceAbstractionStarter]: At program point L579(line 579) the Hoare annotation is: true [2018-01-23 14:49:03,465 INFO L401 ceAbstractionStarter]: For program point L578(line 578) no Hoare annotation was computed. [2018-01-23 14:49:03,465 INFO L401 ceAbstractionStarter]: For program point L577(lines 577 582) no Hoare annotation was computed. [2018-01-23 14:49:03,465 INFO L401 ceAbstractionStarter]: For program point L578'''''''''(line 578) no Hoare annotation was computed. [2018-01-23 14:49:03,465 INFO L401 ceAbstractionStarter]: For program point L578'''''(line 578) no Hoare annotation was computed. [2018-01-23 14:49:03,465 INFO L401 ceAbstractionStarter]: For program point L577''''(line 577) no Hoare annotation was computed. [2018-01-23 14:49:03,465 INFO L401 ceAbstractionStarter]: For program point L577''''''''(lines 577 582) no Hoare annotation was computed. [2018-01-23 14:49:03,465 INFO L401 ceAbstractionStarter]: For program point L573'''''''''(lines 573 583) no Hoare annotation was computed. [2018-01-23 14:49:03,465 INFO L401 ceAbstractionStarter]: For program point L573'''''''''''''''''(lines 573 583) no Hoare annotation was computed. [2018-01-23 14:49:03,465 INFO L401 ceAbstractionStarter]: For program point merge_pairErr0EnsuresViolation(lines 573 583) no Hoare annotation was computed. [2018-01-23 14:49:03,465 INFO L401 ceAbstractionStarter]: For program point L573'''(lines 573 583) no Hoare annotation was computed. [2018-01-23 14:49:03,466 INFO L401 ceAbstractionStarter]: For program point L578''''(line 578) no Hoare annotation was computed. [2018-01-23 14:49:03,466 INFO L401 ceAbstractionStarter]: For program point L573'''''''''''''''(lines 573 583) no Hoare annotation was computed. [2018-01-23 14:49:03,466 INFO L401 ceAbstractionStarter]: For program point L573''''''''''(lines 573 583) no Hoare annotation was computed. [2018-01-23 14:49:03,466 INFO L401 ceAbstractionStarter]: For program point L578''''''(line 578) no Hoare annotation was computed. [2018-01-23 14:49:03,466 INFO L401 ceAbstractionStarter]: For program point L578'''''''''''(line 578) no Hoare annotation was computed. [2018-01-23 14:49:03,466 INFO L401 ceAbstractionStarter]: For program point L578'''''''(line 578) no Hoare annotation was computed. [2018-01-23 14:49:03,466 INFO L401 ceAbstractionStarter]: For program point L578''(line 578) no Hoare annotation was computed. [2018-01-23 14:49:03,466 INFO L401 ceAbstractionStarter]: For program point L573''''''''''''(lines 573 583) no Hoare annotation was computed. [2018-01-23 14:49:03,466 INFO L401 ceAbstractionStarter]: For program point L573'''''''(lines 573 583) no Hoare annotation was computed. [2018-01-23 14:49:03,466 INFO L401 ceAbstractionStarter]: For program point merge_pairEXIT(lines 573 583) no Hoare annotation was computed. [2018-01-23 14:49:03,466 INFO L401 ceAbstractionStarter]: For program point L578''''''''(line 578) no Hoare annotation was computed. [2018-01-23 14:49:03,467 INFO L401 ceAbstractionStarter]: For program point L578'''''''''''''(line 578) no Hoare annotation was computed. [2018-01-23 14:49:03,467 INFO L401 ceAbstractionStarter]: For program point L577'(line 577) no Hoare annotation was computed. [2018-01-23 14:49:03,467 INFO L401 ceAbstractionStarter]: For program point L573''''(lines 573 583) no Hoare annotation was computed. [2018-01-23 14:49:03,467 INFO L401 ceAbstractionStarter]: For program point L577''''''(line 577) no Hoare annotation was computed. [2018-01-23 14:49:03,467 INFO L401 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-01-23 14:49:03,467 INFO L401 ceAbstractionStarter]: For program point L570(line 570) no Hoare annotation was computed. [2018-01-23 14:49:03,467 INFO L401 ceAbstractionStarter]: For program point L570'(line 570) no Hoare annotation was computed. [2018-01-23 14:49:03,467 INFO L401 ceAbstractionStarter]: For program point merge_single_nodeFINAL(lines 564 572) no Hoare annotation was computed. [2018-01-23 14:49:03,467 INFO L401 ceAbstractionStarter]: For program point merge_single_nodeErr0EnsuresViolation(lines 564 572) no Hoare annotation was computed. [2018-01-23 14:49:03,467 INFO L401 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-01-23 14:49:03,468 INFO L401 ceAbstractionStarter]: For program point L567(line 567) no Hoare annotation was computed. [2018-01-23 14:49:03,468 INFO L401 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-01-23 14:49:03,468 INFO L401 ceAbstractionStarter]: For program point merge_single_nodeEXIT(lines 564 572) no Hoare annotation was computed. [2018-01-23 14:49:03,468 INFO L404 ceAbstractionStarter]: At program point merge_single_nodeENTRY(lines 564 572) the Hoare annotation is: true [2018-01-23 14:49:03,468 INFO L401 ceAbstractionStarter]: For program point L567'(line 567) no Hoare annotation was computed. [2018-01-23 14:49:03,468 INFO L401 ceAbstractionStarter]: For program point L568'(line 568) no Hoare annotation was computed. [2018-01-23 14:49:03,468 INFO L401 ceAbstractionStarter]: For program point L569'(line 569) no Hoare annotation was computed. [2018-01-23 14:49:03,469 INFO L401 ceAbstractionStarter]: For program point L568''(line 568) no Hoare annotation was computed. [2018-01-23 14:49:03,469 INFO L401 ceAbstractionStarter]: For program point L595'(line 595) no Hoare annotation was computed. [2018-01-23 14:49:03,469 INFO L401 ceAbstractionStarter]: For program point L594'''(line 594) no Hoare annotation was computed. [2018-01-23 14:49:03,469 INFO L401 ceAbstractionStarter]: For program point L597'(line 597) no Hoare annotation was computed. [2018-01-23 14:49:03,469 INFO L401 ceAbstractionStarter]: For program point L589(lines 589 593) no Hoare annotation was computed. [2018-01-23 14:49:03,469 INFO L401 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-01-23 14:49:03,469 INFO L401 ceAbstractionStarter]: For program point seq_sort_coreErr0EnsuresViolation(lines 584 601) no Hoare annotation was computed. [2018-01-23 14:49:03,469 INFO L401 ceAbstractionStarter]: For program point L587(lines 587 599) no Hoare annotation was computed. [2018-01-23 14:49:03,470 INFO L404 ceAbstractionStarter]: At program point L594''(line 594) the Hoare annotation is: true [2018-01-23 14:49:03,470 INFO L401 ceAbstractionStarter]: For program point seq_sort_coreEXIT(lines 584 601) no Hoare annotation was computed. [2018-01-23 14:49:03,470 INFO L401 ceAbstractionStarter]: For program point seq_sort_coreFINAL(lines 584 601) no Hoare annotation was computed. [2018-01-23 14:49:03,470 INFO L404 ceAbstractionStarter]: At program point L598'(line 598) the Hoare annotation is: true [2018-01-23 14:49:03,470 INFO L401 ceAbstractionStarter]: For program point L588'(line 588) no Hoare annotation was computed. [2018-01-23 14:49:03,470 INFO L401 ceAbstractionStarter]: For program point L590'(line 590) no Hoare annotation was computed. [2018-01-23 14:49:03,470 INFO L401 ceAbstractionStarter]: For program point L590(line 590) no Hoare annotation was computed. [2018-01-23 14:49:03,470 INFO L401 ceAbstractionStarter]: For program point L594'(line 594) no Hoare annotation was computed. [2018-01-23 14:49:03,471 INFO L401 ceAbstractionStarter]: For program point L597(line 597) no Hoare annotation was computed. [2018-01-23 14:49:03,471 INFO L401 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-01-23 14:49:03,471 INFO L404 ceAbstractionStarter]: At program point seq_sort_coreENTRY(lines 584 601) the Hoare annotation is: true [2018-01-23 14:49:03,471 INFO L401 ceAbstractionStarter]: For program point L594(line 594) no Hoare annotation was computed. [2018-01-23 14:49:03,471 INFO L401 ceAbstractionStarter]: For program point L598(line 598) no Hoare annotation was computed. [2018-01-23 14:49:03,471 INFO L401 ceAbstractionStarter]: For program point L587''(lines 587 599) no Hoare annotation was computed. [2018-01-23 14:49:03,471 INFO L401 ceAbstractionStarter]: For program point L609'''''''(line 609) no Hoare annotation was computed. [2018-01-23 14:49:03,472 INFO L404 ceAbstractionStarter]: At program point inspect_beforeENTRY(lines 602 615) the Hoare annotation is: true [2018-01-23 14:49:03,472 INFO L404 ceAbstractionStarter]: At program point L611'(line 611) the Hoare annotation is: true [2018-01-23 14:49:03,472 INFO L401 ceAbstractionStarter]: For program point L607'(line 607) no Hoare annotation was computed. [2018-01-23 14:49:03,472 INFO L401 ceAbstractionStarter]: For program point L609'''''(line 609) no Hoare annotation was computed. [2018-01-23 14:49:03,472 INFO L401 ceAbstractionStarter]: For program point L613''''(line 613) no Hoare annotation was computed. [2018-01-23 14:49:03,472 INFO L401 ceAbstractionStarter]: For program point L612(line 612) no Hoare annotation was computed. [2018-01-23 14:49:03,472 INFO L401 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-01-23 14:49:03,473 INFO L401 ceAbstractionStarter]: For program point L611'''''(line 611) no Hoare annotation was computed. [2018-01-23 14:49:03,473 INFO L404 ceAbstractionStarter]: At program point L613''(line 613) the Hoare annotation is: true [2018-01-23 14:49:03,473 INFO L404 ceAbstractionStarter]: At program point L606'''''(line 606) the Hoare annotation is: true [2018-01-23 14:49:03,473 INFO L404 ceAbstractionStarter]: At program point L607''(line 607) the Hoare annotation is: true [2018-01-23 14:49:03,473 INFO L401 ceAbstractionStarter]: For program point L614(line 614) no Hoare annotation was computed. [2018-01-23 14:49:03,473 INFO L401 ceAbstractionStarter]: For program point L613(line 613) no Hoare annotation was computed. [2018-01-23 14:49:03,473 INFO L401 ceAbstractionStarter]: For program point L612'(line 612) no Hoare annotation was computed. [2018-01-23 14:49:03,473 INFO L401 ceAbstractionStarter]: For program point L608'(line 608) no Hoare annotation was computed. [2018-01-23 14:49:03,473 INFO L404 ceAbstractionStarter]: At program point L609'''(line 609) the Hoare annotation is: true [2018-01-23 14:49:03,473 INFO L401 ceAbstractionStarter]: For program point L605'(line 605) no Hoare annotation was computed. [2018-01-23 14:49:03,474 INFO L404 ceAbstractionStarter]: At program point L614'''(line 614) the Hoare annotation is: true [2018-01-23 14:49:03,474 INFO L401 ceAbstractionStarter]: For program point L613''''''(line 613) no Hoare annotation was computed. [2018-01-23 14:49:03,474 INFO L401 ceAbstractionStarter]: For program point L607''''(line 607) no Hoare annotation was computed. [2018-01-23 14:49:03,474 INFO L401 ceAbstractionStarter]: For program point L607''''''(line 607) no Hoare annotation was computed. [2018-01-23 14:49:03,474 INFO L401 ceAbstractionStarter]: For program point L605''''(line 605) no Hoare annotation was computed. [2018-01-23 14:49:03,474 INFO L401 ceAbstractionStarter]: For program point L606'''(line 606) no Hoare annotation was computed. [2018-01-23 14:49:03,474 INFO L401 ceAbstractionStarter]: For program point L614''(line 614) no Hoare annotation was computed. [2018-01-23 14:49:03,474 INFO L401 ceAbstractionStarter]: For program point L612''''''(line 612) no Hoare annotation was computed. [2018-01-23 14:49:03,474 INFO L401 ceAbstractionStarter]: For program point L605'''''(lines 605 610) no Hoare annotation was computed. [2018-01-23 14:49:03,474 INFO L404 ceAbstractionStarter]: At program point L606'(line 606) the Hoare annotation is: true [2018-01-23 14:49:03,474 INFO L401 ceAbstractionStarter]: For program point inspect_beforeErr0EnsuresViolation(lines 602 615) no Hoare annotation was computed. [2018-01-23 14:49:03,474 INFO L401 ceAbstractionStarter]: For program point L608''''''(line 608) no Hoare annotation was computed. [2018-01-23 14:49:03,474 INFO L401 ceAbstractionStarter]: For program point L612''''(line 612) no Hoare annotation was computed. [2018-01-23 14:49:03,475 INFO L401 ceAbstractionStarter]: For program point L614''''''''(line 614) no Hoare annotation was computed. [2018-01-23 14:49:03,475 INFO L401 ceAbstractionStarter]: For program point L604'''(line 604) no Hoare annotation was computed. [2018-01-23 14:49:03,475 INFO L401 ceAbstractionStarter]: For program point L609''(line 609) no Hoare annotation was computed. [2018-01-23 14:49:03,475 INFO L401 ceAbstractionStarter]: For program point L614'''''(line 614) no Hoare annotation was computed. [2018-01-23 14:49:03,475 INFO L404 ceAbstractionStarter]: At program point L604'(line 604) the Hoare annotation is: true [2018-01-23 14:49:03,475 INFO L401 ceAbstractionStarter]: For program point L611'''(line 611) no Hoare annotation was computed. [2018-01-23 14:49:03,475 INFO L401 ceAbstractionStarter]: For program point L605'''(lines 605 610) no Hoare annotation was computed. [2018-01-23 14:49:03,475 INFO L401 ceAbstractionStarter]: For program point L608''''(line 608) no Hoare annotation was computed. [2018-01-23 14:49:03,475 INFO L401 ceAbstractionStarter]: For program point L614'''''''(line 614) no Hoare annotation was computed. [2018-01-23 14:49:03,475 INFO L401 ceAbstractionStarter]: For program point L605(line 605) no Hoare annotation was computed. [2018-01-23 14:49:03,475 INFO L401 ceAbstractionStarter]: For program point L604(line 604) no Hoare annotation was computed. [2018-01-23 14:49:03,476 INFO L401 ceAbstractionStarter]: For program point L609(line 609) no Hoare annotation was computed. [2018-01-23 14:49:03,476 INFO L401 ceAbstractionStarter]: For program point L608(line 608) no Hoare annotation was computed. [2018-01-23 14:49:03,476 INFO L401 ceAbstractionStarter]: For program point L607(line 607) no Hoare annotation was computed. [2018-01-23 14:49:03,476 INFO L401 ceAbstractionStarter]: For program point L606(line 606) no Hoare annotation was computed. [2018-01-23 14:49:03,476 INFO L401 ceAbstractionStarter]: For program point L613'(line 613) no Hoare annotation was computed. [2018-01-23 14:49:03,476 INFO L404 ceAbstractionStarter]: At program point L604'''''(line 604) the Hoare annotation is: true [2018-01-23 14:49:03,476 INFO L401 ceAbstractionStarter]: For program point L609'(line 609) no Hoare annotation was computed. [2018-01-23 14:49:03,476 INFO L401 ceAbstractionStarter]: For program point inspect_beforeEXIT(lines 602 615) no Hoare annotation was computed. [2018-01-23 14:49:03,477 INFO L404 ceAbstractionStarter]: At program point L612''(line 612) the Hoare annotation is: true [2018-01-23 14:49:03,477 INFO L404 ceAbstractionStarter]: At program point L608''(line 608) the Hoare annotation is: true [2018-01-23 14:49:03,477 INFO L401 ceAbstractionStarter]: For program point L614'(line 614) no Hoare annotation was computed. [2018-01-23 14:49:03,477 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 655) the Hoare annotation is: true [2018-01-23 14:49:03,477 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 655) no Hoare annotation was computed. [2018-01-23 14:49:03,477 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 655) the Hoare annotation is: true [2018-01-23 14:49:03,477 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 655) no Hoare annotation was computed. [2018-01-23 14:49:03,477 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 655) no Hoare annotation was computed. [2018-01-23 14:49:03,478 INFO L401 ceAbstractionStarter]: For program point L650'(line 650) no Hoare annotation was computed. [2018-01-23 14:49:03,478 INFO L401 ceAbstractionStarter]: For program point L649'''(lines 649 653) no Hoare annotation was computed. [2018-01-23 14:49:03,478 INFO L401 ceAbstractionStarter]: For program point L629(line 629) no Hoare annotation was computed. [2018-01-23 14:49:03,478 INFO L401 ceAbstractionStarter]: For program point L628(lines 628 640) no Hoare annotation was computed. [2018-01-23 14:49:03,478 INFO L401 ceAbstractionStarter]: For program point L628''''(lines 628 640) no Hoare annotation was computed. [2018-01-23 14:49:03,478 INFO L401 ceAbstractionStarter]: For program point L651(line 651) no Hoare annotation was computed. [2018-01-23 14:49:03,478 INFO L401 ceAbstractionStarter]: For program point L630''(lines 630 631) no Hoare annotation was computed. [2018-01-23 14:49:03,478 INFO L401 ceAbstractionStarter]: For program point L650(line 650) no Hoare annotation was computed. [2018-01-23 14:49:03,478 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 625 655) no Hoare annotation was computed. [2018-01-23 14:49:03,478 INFO L401 ceAbstractionStarter]: For program point L651'(line 651) no Hoare annotation was computed. [2018-01-23 14:49:03,478 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 625 655) no Hoare annotation was computed. [2018-01-23 14:49:03,478 INFO L404 ceAbstractionStarter]: At program point mainENTRY(lines 625 655) the Hoare annotation is: true [2018-01-23 14:49:03,478 INFO L401 ceAbstractionStarter]: For program point L644'(line 644) no Hoare annotation was computed. [2018-01-23 14:49:03,478 INFO L404 ceAbstractionStarter]: At program point L644''''(lines 644 645) the Hoare annotation is: true [2018-01-23 14:49:03,479 INFO L401 ceAbstractionStarter]: For program point L628'(lines 628 640) no Hoare annotation was computed. [2018-01-23 14:49:03,479 INFO L404 ceAbstractionStarter]: At program point L645(line 645) the Hoare annotation is: true [2018-01-23 14:49:03,479 INFO L401 ceAbstractionStarter]: For program point L644(lines 644 645) no Hoare annotation was computed. [2018-01-23 14:49:03,479 INFO L404 ceAbstractionStarter]: At program point L643(line 643) the Hoare annotation is: true [2018-01-23 14:49:03,479 INFO L401 ceAbstractionStarter]: For program point L649(lines 649 653) no Hoare annotation was computed. [2018-01-23 14:49:03,479 INFO L401 ceAbstractionStarter]: For program point L648(line 648) no Hoare annotation was computed. [2018-01-23 14:49:03,479 INFO L404 ceAbstractionStarter]: At program point L628'''(lines 628 640) the Hoare annotation is: true [2018-01-23 14:49:03,479 INFO L401 ceAbstractionStarter]: For program point L647(line 647) no Hoare annotation was computed. [2018-01-23 14:49:03,479 INFO L404 ceAbstractionStarter]: At program point L649''(lines 649 653) the Hoare annotation is: true [2018-01-23 14:49:03,479 INFO L401 ceAbstractionStarter]: For program point L646(line 646) no Hoare annotation was computed. [2018-01-23 14:49:03,479 INFO L401 ceAbstractionStarter]: For program point L645'(line 645) no Hoare annotation was computed. [2018-01-23 14:49:03,479 INFO L401 ceAbstractionStarter]: For program point L633'(line 633) no Hoare annotation was computed. [2018-01-23 14:49:03,479 INFO L401 ceAbstractionStarter]: For program point L629'(line 629) no Hoare annotation was computed. [2018-01-23 14:49:03,480 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 625 655) no Hoare annotation was computed. [2018-01-23 14:49:03,480 INFO L401 ceAbstractionStarter]: For program point L630(lines 630 631) no Hoare annotation was computed. [2018-01-23 14:49:03,480 INFO L401 ceAbstractionStarter]: For program point L634(line 634) no Hoare annotation was computed. [2018-01-23 14:49:03,480 INFO L401 ceAbstractionStarter]: For program point L633(line 633) no Hoare annotation was computed. [2018-01-23 14:49:03,480 INFO L404 ceAbstractionStarter]: At program point L644'''(lines 644 645) the Hoare annotation is: true [2018-01-23 14:49:03,480 INFO L401 ceAbstractionStarter]: For program point L632(line 632) no Hoare annotation was computed. [2018-01-23 14:49:03,480 INFO L401 ceAbstractionStarter]: For program point L638(line 638) no Hoare annotation was computed. [2018-01-23 14:49:03,480 INFO L401 ceAbstractionStarter]: For program point L635''(lines 635 636) no Hoare annotation was computed. [2018-01-23 14:49:03,480 INFO L401 ceAbstractionStarter]: For program point L637(line 637) no Hoare annotation was computed. [2018-01-23 14:49:03,480 INFO L401 ceAbstractionStarter]: For program point L635(lines 635 636) no Hoare annotation was computed. [2018-01-23 14:49:03,480 INFO L401 ceAbstractionStarter]: For program point L634'(line 634) no Hoare annotation was computed. [2018-01-23 14:49:03,480 INFO L401 ceAbstractionStarter]: For program point L623(line 623) no Hoare annotation was computed. [2018-01-23 14:49:03,480 INFO L401 ceAbstractionStarter]: For program point L623'''''''(line 623) no Hoare annotation was computed. [2018-01-23 14:49:03,481 INFO L401 ceAbstractionStarter]: For program point L622(line 622) no Hoare annotation was computed. [2018-01-23 14:49:03,481 INFO L401 ceAbstractionStarter]: For program point L622'''(line 622) no Hoare annotation was computed. [2018-01-23 14:49:03,481 INFO L401 ceAbstractionStarter]: For program point L620(line 620) no Hoare annotation was computed. [2018-01-23 14:49:03,481 INFO L404 ceAbstractionStarter]: At program point L623''(line 623) the Hoare annotation is: true [2018-01-23 14:49:03,481 INFO L404 ceAbstractionStarter]: At program point L622'''''''(line 622) the Hoare annotation is: true [2018-01-23 14:49:03,481 INFO L401 ceAbstractionStarter]: For program point L620'''''''(line 620) no Hoare annotation was computed. [2018-01-23 14:49:03,481 INFO L401 ceAbstractionStarter]: For program point L623'(line 623) no Hoare annotation was computed. [2018-01-23 14:49:03,481 INFO L401 ceAbstractionStarter]: For program point L620''''(line 620) no Hoare annotation was computed. [2018-01-23 14:49:03,482 INFO L401 ceAbstractionStarter]: For program point L619'(line 619) no Hoare annotation was computed. [2018-01-23 14:49:03,482 INFO L401 ceAbstractionStarter]: For program point L622'''''(line 622) no Hoare annotation was computed. [2018-01-23 14:49:03,482 INFO L401 ceAbstractionStarter]: For program point L619(line 619) no Hoare annotation was computed. [2018-01-23 14:49:03,482 INFO L401 ceAbstractionStarter]: For program point L618(line 618) no Hoare annotation was computed. [2018-01-23 14:49:03,482 INFO L404 ceAbstractionStarter]: At program point L619''(line 619) the Hoare annotation is: true [2018-01-23 14:49:03,482 INFO L401 ceAbstractionStarter]: For program point L620'(line 620) no Hoare annotation was computed. [2018-01-23 14:49:03,482 INFO L401 ceAbstractionStarter]: For program point L622''''''(line 622) no Hoare annotation was computed. [2018-01-23 14:49:03,482 INFO L404 ceAbstractionStarter]: At program point L620''(line 620) the Hoare annotation is: true [2018-01-23 14:49:03,483 INFO L401 ceAbstractionStarter]: For program point L622''(line 622) no Hoare annotation was computed. [2018-01-23 14:49:03,483 INFO L404 ceAbstractionStarter]: At program point inspect_afterENTRY(lines 616 624) the Hoare annotation is: true [2018-01-23 14:49:03,483 INFO L401 ceAbstractionStarter]: For program point L623''''''(line 623) no Hoare annotation was computed. [2018-01-23 14:49:03,483 INFO L401 ceAbstractionStarter]: For program point inspect_afterErr0EnsuresViolation(lines 616 624) no Hoare annotation was computed. [2018-01-23 14:49:03,483 INFO L401 ceAbstractionStarter]: For program point L618'''(line 618) no Hoare annotation was computed. [2018-01-23 14:49:03,483 INFO L404 ceAbstractionStarter]: At program point L618'''''(line 618) the Hoare annotation is: true [2018-01-23 14:49:03,483 INFO L401 ceAbstractionStarter]: For program point L619''''''(line 619) no Hoare annotation was computed. [2018-01-23 14:49:03,483 INFO L401 ceAbstractionStarter]: For program point L619''''(line 619) no Hoare annotation was computed. [2018-01-23 14:49:03,484 INFO L401 ceAbstractionStarter]: For program point L620''''''(line 620) no Hoare annotation was computed. [2018-01-23 14:49:03,484 INFO L401 ceAbstractionStarter]: For program point L622'(line 622) no Hoare annotation was computed. [2018-01-23 14:49:03,484 INFO L401 ceAbstractionStarter]: For program point L623''''(line 623) no Hoare annotation was computed. [2018-01-23 14:49:03,484 INFO L401 ceAbstractionStarter]: For program point inspect_afterEXIT(lines 616 624) no Hoare annotation was computed. [2018-01-23 14:49:03,484 INFO L404 ceAbstractionStarter]: At program point L618'(line 618) the Hoare annotation is: true [2018-01-23 14:49:03,490 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:49:03,490 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:49:03,490 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:49:03,490 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:49:03,490 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:49:03,490 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:49:03,491 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:49:03,491 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-23 14:49:03,491 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:49:03,495 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states. [2018-01-23 14:49:03,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-23 14:49:03,495 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:49:03,495 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-23 14:49:03,495 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-23 14:49:03,496 INFO L82 PathProgramCache]: Analyzing trace with hash 563166, now seen corresponding path program 1 times [2018-01-23 14:49:03,496 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:49:03,496 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:49:03,497 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:49:03,497 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:49:03,497 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:49:03,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:49:03,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:49:03,526 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-23 14:49:03,530 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:49:03,535 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:49:03,536 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:49:03,536 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:49:03,536 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:49:03,536 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:49:03,536 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:49:03,536 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:49:03,536 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == merge_pairErr0EnsuresViolation======== [2018-01-23 14:49:03,536 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:49:03,540 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states. [2018-01-23 14:49:03,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-01-23 14:49:03,544 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:49:03,545 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:49:03,545 INFO L371 AbstractCegarLoop]: === Iteration 1 === [merge_pairErr0EnsuresViolation]=== [2018-01-23 14:49:03,545 INFO L82 PathProgramCache]: Analyzing trace with hash -2032860850, now seen corresponding path program 1 times [2018-01-23 14:49:03,545 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:49:03,545 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:49:03,546 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:49:03,546 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:49:03,546 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:49:03,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:49:03,560 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:49:03,589 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-23 14:49:03,589 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:49:03,589 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:49:03,590 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:49:03,590 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:49:03,590 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:49:03,591 INFO L87 Difference]: Start difference. First operand 215 states. Second operand 2 states. [2018-01-23 14:49:03,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:49:03,613 INFO L93 Difference]: Finished difference Result 417 states and 571 transitions. [2018-01-23 14:49:03,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:49:03,613 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 53 [2018-01-23 14:49:03,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:49:03,619 INFO L225 Difference]: With dead ends: 417 [2018-01-23 14:49:03,620 INFO L226 Difference]: Without dead ends: 150 [2018-01-23 14:49:03,621 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:49:03,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-01-23 14:49:03,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-01-23 14:49:03,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-01-23 14:49:03,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 160 transitions. [2018-01-23 14:49:03,647 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 160 transitions. Word has length 53 [2018-01-23 14:49:03,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:49:03,648 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 160 transitions. [2018-01-23 14:49:03,648 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:49:03,648 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 160 transitions. [2018-01-23 14:49:03,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-01-23 14:49:03,651 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:49:03,651 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 14:49:03,651 INFO L371 AbstractCegarLoop]: === Iteration 2 === [merge_pairErr0EnsuresViolation]=== [2018-01-23 14:49:03,651 INFO L82 PathProgramCache]: Analyzing trace with hash -493560614, now seen corresponding path program 1 times [2018-01-23 14:49:03,651 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:49:03,652 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:49:03,653 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:49:03,653 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:49:03,653 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:49:03,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:49:03,670 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:49:03,740 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-23 14:49:03,741 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:49:03,741 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-23 14:49:03,742 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-23 14:49:03,743 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-23 14:49:03,743 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:49:03,743 INFO L87 Difference]: Start difference. First operand 150 states and 160 transitions. Second operand 3 states. [2018-01-23 14:49:03,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:49:03,776 INFO L93 Difference]: Finished difference Result 294 states and 314 transitions. [2018-01-23 14:49:03,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-23 14:49:03,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2018-01-23 14:49:03,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:49:03,779 INFO L225 Difference]: With dead ends: 294 [2018-01-23 14:49:03,779 INFO L226 Difference]: Without dead ends: 166 [2018-01-23 14:49:03,780 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:49:03,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-01-23 14:49:03,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 153. [2018-01-23 14:49:03,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-01-23 14:49:03,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 163 transitions. [2018-01-23 14:49:03,793 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 163 transitions. Word has length 75 [2018-01-23 14:49:03,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:49:03,793 INFO L432 AbstractCegarLoop]: Abstraction has 153 states and 163 transitions. [2018-01-23 14:49:03,793 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-23 14:49:03,793 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 163 transitions. [2018-01-23 14:49:03,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-01-23 14:49:03,797 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:49:03,797 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 14:49:03,797 INFO L371 AbstractCegarLoop]: === Iteration 3 === [merge_pairErr0EnsuresViolation]=== [2018-01-23 14:49:03,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1476607212, now seen corresponding path program 1 times [2018-01-23 14:49:03,797 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:49:03,798 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:49:03,799 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:49:03,799 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:49:03,799 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:49:03,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:49:03,859 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:49:03,929 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-23 14:49:03,929 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:49:03,929 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-23 14:49:03,929 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-23 14:49:03,930 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-23 14:49:03,930 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:49:03,930 INFO L87 Difference]: Start difference. First operand 153 states and 163 transitions. Second operand 3 states. [2018-01-23 14:49:03,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:49:03,953 INFO L93 Difference]: Finished difference Result 237 states and 258 transitions. [2018-01-23 14:49:03,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-23 14:49:03,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2018-01-23 14:49:03,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:49:03,956 INFO L225 Difference]: With dead ends: 237 [2018-01-23 14:49:03,956 INFO L226 Difference]: Without dead ends: 154 [2018-01-23 14:49:03,957 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:49:03,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-01-23 14:49:03,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-01-23 14:49:03,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-01-23 14:49:03,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 164 transitions. [2018-01-23 14:49:03,968 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 164 transitions. Word has length 91 [2018-01-23 14:49:03,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:49:03,968 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 164 transitions. [2018-01-23 14:49:03,968 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-23 14:49:03,968 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 164 transitions. [2018-01-23 14:49:03,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-01-23 14:49:03,971 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:49:03,972 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 14:49:03,972 INFO L371 AbstractCegarLoop]: === Iteration 4 === [merge_pairErr0EnsuresViolation]=== [2018-01-23 14:49:03,972 INFO L82 PathProgramCache]: Analyzing trace with hash 754057391, now seen corresponding path program 1 times [2018-01-23 14:49:03,972 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:49:03,972 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:49:03,973 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:49:03,974 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:49:03,974 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:49:04,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:49:04,023 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:49:04,576 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:49:04,577 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:49:04,577 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-01-23 14:49:04,577 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-23 14:49:04,577 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-23 14:49:04,578 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-01-23 14:49:04,578 INFO L87 Difference]: Start difference. First operand 154 states and 164 transitions. Second operand 17 states. [2018-01-23 14:49:05,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:49:05,413 INFO L93 Difference]: Finished difference Result 370 states and 407 transitions. [2018-01-23 14:49:05,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-23 14:49:05,413 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 93 [2018-01-23 14:49:05,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:49:05,416 INFO L225 Difference]: With dead ends: 370 [2018-01-23 14:49:05,416 INFO L226 Difference]: Without dead ends: 286 [2018-01-23 14:49:05,416 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=125, Invalid=687, Unknown=0, NotChecked=0, Total=812 [2018-01-23 14:49:05,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-01-23 14:49:05,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 221. [2018-01-23 14:49:05,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-01-23 14:49:05,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 242 transitions. [2018-01-23 14:49:05,437 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 242 transitions. Word has length 93 [2018-01-23 14:49:05,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:49:05,437 INFO L432 AbstractCegarLoop]: Abstraction has 221 states and 242 transitions. [2018-01-23 14:49:05,438 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-23 14:49:05,438 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 242 transitions. [2018-01-23 14:49:05,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-01-23 14:49:05,439 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:49:05,439 INFO L322 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 14:49:05,439 INFO L371 AbstractCegarLoop]: === Iteration 5 === [merge_pairErr0EnsuresViolation]=== [2018-01-23 14:49:05,439 INFO L82 PathProgramCache]: Analyzing trace with hash -514708738, now seen corresponding path program 1 times [2018-01-23 14:49:05,439 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:49:05,440 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:49:05,440 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:49:05,440 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:49:05,440 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:49:05,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:49:05,466 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:49:05,593 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:49:05,593 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:49:05,593 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-23 14:49:05,594 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-23 14:49:05,594 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-23 14:49:05,594 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-23 14:49:05,595 INFO L87 Difference]: Start difference. First operand 221 states and 242 transitions. Second operand 7 states. [2018-01-23 14:49:05,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:49:05,743 INFO L93 Difference]: Finished difference Result 343 states and 375 transitions. [2018-01-23 14:49:05,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-23 14:49:05,744 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 104 [2018-01-23 14:49:05,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:49:05,746 INFO L225 Difference]: With dead ends: 343 [2018-01-23 14:49:05,746 INFO L226 Difference]: Without dead ends: 256 [2018-01-23 14:49:05,747 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-01-23 14:49:05,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-01-23 14:49:05,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 231. [2018-01-23 14:49:05,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-01-23 14:49:05,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 253 transitions. [2018-01-23 14:49:05,763 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 253 transitions. Word has length 104 [2018-01-23 14:49:05,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:49:05,764 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 253 transitions. [2018-01-23 14:49:05,764 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-23 14:49:05,764 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 253 transitions. [2018-01-23 14:49:05,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-01-23 14:49:05,765 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:49:05,766 INFO L322 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 14:49:05,766 INFO L371 AbstractCegarLoop]: === Iteration 6 === [merge_pairErr0EnsuresViolation]=== [2018-01-23 14:49:05,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1958389758, now seen corresponding path program 1 times [2018-01-23 14:49:05,766 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:49:05,766 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:49:05,767 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:49:05,768 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:49:05,768 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:49:05,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:49:05,807 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:49:06,691 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:49:06,692 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:49:06,692 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-23 14:49:06,698 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:49:06,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:49:06,767 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:49:06,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 10 [2018-01-23 14:49:06,893 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 10 treesize of output 9 [2018-01-23 14:49:06,894 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:49:06,896 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:49:06,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 10 [2018-01-23 14:49:06,922 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 10 treesize of output 9 [2018-01-23 14:49:06,922 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:49:06,925 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:49:06,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:49:06,931 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2018-01-23 14:49:07,141 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 15 treesize of output 11 [2018-01-23 14:49:07,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 3 [2018-01-23 14:49:07,149 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:49:07,150 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:49:07,157 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 15 treesize of output 11 [2018-01-23 14:49:07,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 3 [2018-01-23 14:49:07,159 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:49:07,161 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:49:07,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:49:07,165 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-01-23 14:49:07,232 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-23 14:49:07,254 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:49:07,254 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 9] total 34 [2018-01-23 14:49:07,255 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-23 14:49:07,255 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-23 14:49:07,256 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1043, Unknown=0, NotChecked=0, Total=1122 [2018-01-23 14:49:07,256 INFO L87 Difference]: Start difference. First operand 231 states and 253 transitions. Second operand 34 states. [2018-01-23 14:49:10,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:49:10,289 INFO L93 Difference]: Finished difference Result 649 states and 719 transitions. [2018-01-23 14:49:10,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-01-23 14:49:10,289 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 109 [2018-01-23 14:49:10,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:49:10,292 INFO L225 Difference]: With dead ends: 649 [2018-01-23 14:49:10,292 INFO L226 Difference]: Without dead ends: 404 [2018-01-23 14:49:10,294 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 108 SyntacticMatches, 7 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1038 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=409, Invalid=4561, Unknown=0, NotChecked=0, Total=4970 [2018-01-23 14:49:10,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2018-01-23 14:49:10,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 263. [2018-01-23 14:49:10,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-01-23 14:49:10,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 288 transitions. [2018-01-23 14:49:10,314 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 288 transitions. Word has length 109 [2018-01-23 14:49:10,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:49:10,314 INFO L432 AbstractCegarLoop]: Abstraction has 263 states and 288 transitions. [2018-01-23 14:49:10,314 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-01-23 14:49:10,314 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 288 transitions. [2018-01-23 14:49:10,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-01-23 14:49:10,315 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:49:10,315 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 14:49:10,316 INFO L371 AbstractCegarLoop]: === Iteration 7 === [merge_pairErr0EnsuresViolation]=== [2018-01-23 14:49:10,316 INFO L82 PathProgramCache]: Analyzing trace with hash 654400179, now seen corresponding path program 1 times [2018-01-23 14:49:10,316 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:49:10,316 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:49:10,317 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:49:10,317 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:49:10,317 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:49:10,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:49:10,467 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:49:11,322 WARN L146 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 21 DAG size of output 20 [2018-01-23 14:49:11,425 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-23 14:49:11,425 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:49:11,425 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-23 14:49:11,431 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:49:11,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:49:11,501 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:49:11,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 10 [2018-01-23 14:49:11,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-23 14:49:11,566 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:49:11,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:49:11,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:49:11,571 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2018-01-23 14:49:11,714 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-23 14:49:11,736 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:49:11,736 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 23 [2018-01-23 14:49:11,736 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-23 14:49:11,736 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-23 14:49:11,737 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-01-23 14:49:11,737 INFO L87 Difference]: Start difference. First operand 263 states and 288 transitions. Second operand 23 states. [2018-01-23 14:49:52,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:49:52,487 INFO L93 Difference]: Finished difference Result 491 states and 541 transitions. [2018-01-23 14:49:52,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-23 14:49:52,487 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 132 [2018-01-23 14:49:52,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:49:52,489 INFO L225 Difference]: With dead ends: 491 [2018-01-23 14:49:52,489 INFO L226 Difference]: Without dead ends: 296 [2018-01-23 14:49:52,489 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 124 SyntacticMatches, 8 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=154, Invalid=776, Unknown=0, NotChecked=0, Total=930 [2018-01-23 14:49:52,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-01-23 14:49:52,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 266. [2018-01-23 14:49:52,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-01-23 14:49:52,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 291 transitions. [2018-01-23 14:49:52,504 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 291 transitions. Word has length 132 [2018-01-23 14:49:52,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:49:52,504 INFO L432 AbstractCegarLoop]: Abstraction has 266 states and 291 transitions. [2018-01-23 14:49:52,504 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-23 14:49:52,505 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 291 transitions. [2018-01-23 14:49:52,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-01-23 14:49:52,506 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:49:52,506 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 14:49:52,506 INFO L371 AbstractCegarLoop]: === Iteration 8 === [merge_pairErr0EnsuresViolation]=== [2018-01-23 14:49:52,507 INFO L82 PathProgramCache]: Analyzing trace with hash 222294500, now seen corresponding path program 1 times [2018-01-23 14:49:52,507 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:49:52,507 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:49:52,507 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:49:52,508 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:49:52,508 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:49:52,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:49:52,584 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:49:53,850 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 17 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:49:53,851 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:49:53,851 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-23 14:49:53,856 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:49:53,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:49:53,930 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:49:53,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 10 [2018-01-23 14:49:53,960 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 10 treesize of output 9 [2018-01-23 14:49:53,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:49:53,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:49:53,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 10 [2018-01-23 14:49:53,971 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 10 treesize of output 9 [2018-01-23 14:49:53,972 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:49:53,973 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:49:53,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:49:53,977 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:30, output treesize:3 [2018-01-23 14:49:54,338 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 46 [2018-01-23 14:49:54,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2018-01-23 14:49:54,355 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:49:54,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 20 [2018-01-23 14:49:54,387 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-23 14:49:54,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 28 [2018-01-23 14:49:54,403 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-23 14:49:54,416 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-23 14:49:54,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-23 14:49:54,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 7 treesize of output 5 [2018-01-23 14:49:54,436 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:49:54,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-01-23 14:49:54,443 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-23 14:49:54,446 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:49:54,459 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 24 treesize of output 26 [2018-01-23 14:49:54,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2018-01-23 14:49:54,461 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-23 14:49:54,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2018-01-23 14:49:54,493 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-23 14:49:54,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2018-01-23 14:49:54,502 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-23 14:49:54,505 INFO L267 ElimStorePlain]: Start of recursive call 9: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:49:54,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2018-01-23 14:49:54,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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-23 14:49:54,514 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:49:54,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 9 [2018-01-23 14:49:54,523 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-01-23 14:49:54,544 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 16 [2018-01-23 14:49:54,545 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-01-23 14:49:54,548 INFO L267 ElimStorePlain]: Start of recursive call 13: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:49:54,561 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 50 [2018-01-23 14:49:54,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-01-23 14:49:54,565 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:49:54,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 37 treesize of output 28 [2018-01-23 14:49:54,587 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-01-23 14:49:54,600 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 36 [2018-01-23 14:49:54,601 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-23 14:49:54,613 INFO L267 ElimStorePlain]: Start of recursive call 17: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-23 14:49:54,634 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 24 treesize of output 24 [2018-01-23 14:49:54,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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-23 14:49:54,637 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:49:54,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-01-23 14:49:54,648 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-01-23 14:49:54,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 16 [2018-01-23 14:49:54,661 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-01-23 14:49:54,664 INFO L267 ElimStorePlain]: Start of recursive call 21: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:49:54,670 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 32 treesize of output 30 [2018-01-23 14:49:54,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-01-23 14:49:54,674 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:49:54,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 13 [2018-01-23 14:49:54,685 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-01-23 14:49:54,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 12 [2018-01-23 14:49:54,697 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-01-23 14:49:54,700 INFO L267 ElimStorePlain]: Start of recursive call 25: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:49:54,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2018-01-23 14:49:54,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-01-23 14:49:54,705 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-01-23 14:49:54,710 INFO L267 ElimStorePlain]: Start of recursive call 29: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:49:54,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:49:54,714 INFO L202 ElimStorePlain]: Needed 30 recursive calls to eliminate 6 variables, input treesize:95, output treesize:9 [2018-01-23 14:49:54,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 27 treesize of output 24 [2018-01-23 14:49:54,777 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 8 treesize of output 7 [2018-01-23 14:49:54,777 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:49:54,781 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:49:54,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 27 treesize of output 24 [2018-01-23 14:49:54,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-23 14:49:54,796 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:49:54,800 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:49:54,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 23 treesize of output 20 [2018-01-23 14:49:54,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-23 14:49:54,813 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-23 14:49:54,816 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:49:54,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 23 treesize of output 20 [2018-01-23 14:49:54,827 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 8 treesize of output 7 [2018-01-23 14:49:54,828 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-23 14:49:54,831 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:49:54,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:49:54,839 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:55, output treesize:17 [2018-01-23 14:49:54,859 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 23 treesize of output 21 [2018-01-23 14:49:54,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-01-23 14:49:54,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:49:54,864 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:49:54,871 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 12 [2018-01-23 14:49:54,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-01-23 14:49:54,874 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:49:54,875 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:49:54,882 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 23 treesize of output 21 [2018-01-23 14:49:54,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-01-23 14:49:54,884 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-23 14:49:54,887 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:49:54,892 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 12 [2018-01-23 14:49:54,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-01-23 14:49:54,893 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-23 14:49:54,894 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:49:54,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:49:54,896 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:47, output treesize:9 [2018-01-23 14:49:54,948 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-01-23 14:49:54,968 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:49:54,968 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 20] total 39 [2018-01-23 14:49:54,968 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-01-23 14:49:54,969 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-01-23 14:49:54,969 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1380, Unknown=0, NotChecked=0, Total=1482 [2018-01-23 14:49:54,969 INFO L87 Difference]: Start difference. First operand 266 states and 291 transitions. Second operand 39 states. [2018-01-23 14:49:56,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:49:56,409 INFO L93 Difference]: Finished difference Result 530 states and 590 transitions. [2018-01-23 14:49:56,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-01-23 14:49:56,410 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 153 [2018-01-23 14:49:56,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:49:56,412 INFO L225 Difference]: With dead ends: 530 [2018-01-23 14:49:56,412 INFO L226 Difference]: Without dead ends: 405 [2018-01-23 14:49:56,414 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 141 SyntacticMatches, 12 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 972 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=279, Invalid=3143, Unknown=0, NotChecked=0, Total=3422 [2018-01-23 14:49:56,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2018-01-23 14:49:56,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 371. [2018-01-23 14:49:56,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-01-23 14:49:56,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 408 transitions. [2018-01-23 14:49:56,434 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 408 transitions. Word has length 153 [2018-01-23 14:49:56,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:49:56,434 INFO L432 AbstractCegarLoop]: Abstraction has 371 states and 408 transitions. [2018-01-23 14:49:56,435 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-01-23 14:49:56,435 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 408 transitions. [2018-01-23 14:49:56,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-01-23 14:49:56,437 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:49:56,437 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 14:49:56,437 INFO L371 AbstractCegarLoop]: === Iteration 9 === [merge_pairErr0EnsuresViolation]=== [2018-01-23 14:49:56,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1920057942, now seen corresponding path program 1 times [2018-01-23 14:49:56,438 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:49:56,438 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:49:56,439 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:49:56,439 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:49:56,439 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:49:56,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:49:56,461 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:49:56,647 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 29 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-01-23 14:49:56,648 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:49:56,648 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-23 14:49:56,653 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:49:56,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:49:56,707 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:49:56,799 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 29 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-01-23 14:49:56,820 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:49:56,820 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 12 [2018-01-23 14:49:56,820 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-23 14:49:56,821 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-23 14:49:56,821 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-01-23 14:49:56,821 INFO L87 Difference]: Start difference. First operand 371 states and 408 transitions. Second operand 12 states. [2018-01-23 14:49:57,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:49:57,123 INFO L93 Difference]: Finished difference Result 502 states and 560 transitions. [2018-01-23 14:49:57,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-23 14:49:57,124 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 157 [2018-01-23 14:49:57,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:49:57,127 INFO L225 Difference]: With dead ends: 502 [2018-01-23 14:49:57,127 INFO L226 Difference]: Without dead ends: 405 [2018-01-23 14:49:57,128 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 153 SyntacticMatches, 7 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2018-01-23 14:49:57,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2018-01-23 14:49:57,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 393. [2018-01-23 14:49:57,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-01-23 14:49:57,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 437 transitions. [2018-01-23 14:49:57,155 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 437 transitions. Word has length 157 [2018-01-23 14:49:57,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:49:57,156 INFO L432 AbstractCegarLoop]: Abstraction has 393 states and 437 transitions. [2018-01-23 14:49:57,156 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-23 14:49:57,156 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 437 transitions. [2018-01-23 14:49:57,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-01-23 14:49:57,158 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:49:57,158 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 14:49:57,159 INFO L371 AbstractCegarLoop]: === Iteration 10 === [merge_pairErr0EnsuresViolation]=== [2018-01-23 14:49:57,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1963414559, now seen corresponding path program 1 times [2018-01-23 14:49:57,159 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:49:57,159 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:49:57,160 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:49:57,160 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:49:57,160 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:49:57,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:49:57,189 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:49:57,252 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-01-23 14:49:57,252 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:49:57,252 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-23 14:49:57,253 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-23 14:49:57,253 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-23 14:49:57,253 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-23 14:49:57,254 INFO L87 Difference]: Start difference. First operand 393 states and 437 transitions. Second operand 4 states. [2018-01-23 14:49:57,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:49:57,286 INFO L93 Difference]: Finished difference Result 577 states and 667 transitions. [2018-01-23 14:49:57,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-23 14:49:57,287 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2018-01-23 14:49:57,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:49:57,289 INFO L225 Difference]: With dead ends: 577 [2018-01-23 14:49:57,290 INFO L226 Difference]: Without dead ends: 399 [2018-01-23 14:49:57,291 INFO L525 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-23 14:49:57,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-01-23 14:49:57,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2018-01-23 14:49:57,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-01-23 14:49:57,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 443 transitions. [2018-01-23 14:49:57,315 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 443 transitions. Word has length 157 [2018-01-23 14:49:57,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:49:57,315 INFO L432 AbstractCegarLoop]: Abstraction has 399 states and 443 transitions. [2018-01-23 14:49:57,315 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-23 14:49:57,315 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 443 transitions. [2018-01-23 14:49:57,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-01-23 14:49:57,317 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:49:57,318 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 14:49:57,318 INFO L371 AbstractCegarLoop]: === Iteration 11 === [merge_pairErr0EnsuresViolation]=== [2018-01-23 14:49:57,318 INFO L82 PathProgramCache]: Analyzing trace with hash -2041584414, now seen corresponding path program 1 times [2018-01-23 14:49:57,318 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:49:57,318 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:49:57,319 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:49:57,319 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:49:57,319 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:49:57,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:49:57,346 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:49:57,467 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-01-23 14:49:57,467 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:49:57,467 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-23 14:49:57,468 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-23 14:49:57,468 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-23 14:49:57,468 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-23 14:49:57,468 INFO L87 Difference]: Start difference. First operand 399 states and 443 transitions. Second operand 7 states. [2018-01-23 14:49:57,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:49:57,696 INFO L93 Difference]: Finished difference Result 631 states and 736 transitions. [2018-01-23 14:49:57,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-23 14:49:57,696 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 157 [2018-01-23 14:49:57,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:49:57,699 INFO L225 Difference]: With dead ends: 631 [2018-01-23 14:49:57,699 INFO L226 Difference]: Without dead ends: 447 [2018-01-23 14:49:57,701 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-01-23 14:49:57,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-01-23 14:49:57,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 417. [2018-01-23 14:49:57,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-01-23 14:49:57,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 464 transitions. [2018-01-23 14:49:57,729 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 464 transitions. Word has length 157 [2018-01-23 14:49:57,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:49:57,729 INFO L432 AbstractCegarLoop]: Abstraction has 417 states and 464 transitions. [2018-01-23 14:49:57,729 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-23 14:49:57,729 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 464 transitions. [2018-01-23 14:49:57,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-01-23 14:49:57,732 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:49:57,732 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 14:49:57,732 INFO L371 AbstractCegarLoop]: === Iteration 12 === [merge_pairErr0EnsuresViolation]=== [2018-01-23 14:49:57,733 INFO L82 PathProgramCache]: Analyzing trace with hash 21369046, now seen corresponding path program 1 times [2018-01-23 14:49:57,733 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:49:57,733 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:49:57,734 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:49:57,734 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:49:57,734 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:49:57,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:49:57,765 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:49:58,772 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 18 proven. 24 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-01-23 14:49:58,772 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:49:58,772 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-23 14:49:58,777 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:49:58,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:49:58,834 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:49:58,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 10 [2018-01-23 14:49:58,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-23 14:49:58,958 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:49:58,959 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:49:58,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:49:58,962 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 Received shutdown request... [2018-01-23 14:50:05,049 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-23 14:50:05,049 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-23 14:50:05,051 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:50:05,052 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:50:05,052 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:50:05,052 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:50:05,052 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:50:05,052 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:50:05,052 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:50:05,052 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == merge_single_nodeErr0EnsuresViolation======== [2018-01-23 14:50:05,052 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:50:05,053 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states. [2018-01-23 14:50:05,054 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-23 14:50:05,055 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:50:05,055 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:50:05,055 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:50:05,055 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:50:05,055 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:50:05,055 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:50:05,055 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:50:05,055 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == seq_sort_coreErr0EnsuresViolation======== [2018-01-23 14:50:05,055 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:50:05,056 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states. [2018-01-23 14:50:05,056 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-23 14:50:05,057 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:50:05,057 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:50:05,057 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:50:05,057 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:50:05,057 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:50:05,058 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:50:05,058 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:50:05,058 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == inspect_beforeErr0EnsuresViolation======== [2018-01-23 14:50:05,058 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:50:05,059 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states. [2018-01-23 14:50:05,059 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-23 14:50:05,060 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:50:05,060 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:50:05,060 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:50:05,060 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:50:05,060 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:50:05,060 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:50:05,060 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:50:05,060 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-23 14:50:05,060 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:50:05,062 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states. [2018-01-23 14:50:05,062 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-23 14:50:05,063 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:50:05,063 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:50:05,063 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:50:05,063 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:50:05,063 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:50:05,063 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:50:05,063 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:50:05,063 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-23 14:50:05,063 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:50:05,064 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states. [2018-01-23 14:50:05,064 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-23 14:50:05,065 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:50:05,065 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:50:05,065 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:50:05,065 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:50:05,066 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:50:05,066 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:50:05,066 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:50:05,066 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == inspect_afterErr0EnsuresViolation======== [2018-01-23 14:50:05,066 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:50:05,067 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states. [2018-01-23 14:50:05,067 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-23 14:50:05,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.01 02:50:05 BoogieIcfgContainer [2018-01-23 14:50:05,068 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-23 14:50:05,069 INFO L168 Benchmark]: Toolchain (without parser) took 63165.08 ms. Allocated memory was 304.6 MB in the beginning and 842.0 MB in the end (delta: 537.4 MB). Free memory was 261.9 MB in the beginning and 753.3 MB in the end (delta: -491.4 MB). Peak memory consumption was 46.0 MB. Max. memory is 5.3 GB. [2018-01-23 14:50:05,070 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 304.6 MB. Free memory is still 267.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-23 14:50:05,070 INFO L168 Benchmark]: CACSL2BoogieTranslator took 237.91 ms. Allocated memory is still 304.6 MB. Free memory was 261.9 MB in the beginning and 249.8 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. [2018-01-23 14:50:05,071 INFO L168 Benchmark]: Boogie Preprocessor took 54.74 ms. Allocated memory is still 304.6 MB. Free memory was 249.8 MB in the beginning and 247.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-23 14:50:05,071 INFO L168 Benchmark]: RCFGBuilder took 693.14 ms. Allocated memory is still 304.6 MB. Free memory was 247.8 MB in the beginning and 196.9 MB in the end (delta: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 5.3 GB. [2018-01-23 14:50:05,071 INFO L168 Benchmark]: TraceAbstraction took 62171.04 ms. Allocated memory was 304.6 MB in the beginning and 842.0 MB in the end (delta: 537.4 MB). Free memory was 196.9 MB in the beginning and 753.3 MB in the end (delta: -556.4 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-23 14:50:05,073 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 304.6 MB. Free memory is still 267.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 237.91 ms. Allocated memory is still 304.6 MB. Free memory was 261.9 MB in the beginning and 249.8 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 54.74 ms. Allocated memory is still 304.6 MB. Free memory was 249.8 MB in the beginning and 247.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 693.14 ms. Allocated memory is still 304.6 MB. Free memory was 247.8 MB in the beginning and 196.9 MB in the end (delta: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 62171.04 ms. Allocated memory was 304.6 MB in the beginning and 842.0 MB in the end (delta: 537.4 MB). Free memory was 196.9 MB in the beginning and 753.3 MB in the end (delta: -556.4 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 553]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: failErr0EnsuresViolation CFG has 9 procedures, 215 locations, 9 error locations. SAFE Result, 0.5s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 234 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=215occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 38 LocationsWithAnnotation, 92 PreInvPairs, 117 NumberOfFragments, 38 HoareAnnotationTreeSize, 92 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 38 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 15 NumberOfCodeBlocks, 15 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 14 ConstructedInterpolants, 0 QuantifiedInterpolants, 196 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 9 procedures, 215 locations, 9 error locations. UNSAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=215occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - TimeoutResultAtElement [Line: 573]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 573). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 37 known predicates. - StatisticsResult: Ultimate Automizer benchmark data for error location: merge_pairErr0EnsuresViolation CFG has 9 procedures, 215 locations, 9 error locations. TIMEOUT Result, 61.5s OverallTime, 12 OverallIterations, 3 TraceHistogramMax, 46.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1720 SDtfs, 2074 SDslu, 11292 SDs, 0 SdLazy, 6301 SolverSat, 445 SolverUnsat, 21 SolverUnknown, 0 SolverNotchecked, 43.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 802 GetRequests, 544 SyntacticMatches, 36 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2339 ImplicationChecksByTransitivity, 5.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=417occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 350 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 1832 NumberOfCodeBlocks, 1832 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1817 ConstructedInterpolants, 54 QuantifiedInterpolants, 1232910 SizeOfPredicates, 56 NumberOfNonLiveVariables, 1759 ConjunctsInSsa, 139 ConjunctsInUnsatCore, 15 InterpolantComputations, 7 PerfectInterpolantSequences, 266/322 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - TimeoutResultAtElement [Line: 564]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 564). Cancelled while IsEmpty was searching accepting run (input had 215 states). - StatisticsResult: Ultimate Automizer benchmark data for error location: merge_single_nodeErr0EnsuresViolation CFG has 9 procedures, 215 locations, 9 error locations. TIMEOUT Result, 0.0s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=215occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, REUSE_STATISTICS: No data available - TimeoutResultAtElement [Line: 584]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 584). Cancelled while IsEmpty was searching accepting run (input had 215 states). - StatisticsResult: Ultimate Automizer benchmark data for error location: seq_sort_coreErr0EnsuresViolation CFG has 9 procedures, 215 locations, 9 error locations. TIMEOUT Result, 0.0s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=215occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, REUSE_STATISTICS: No data available - TimeoutResultAtElement [Line: 602]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 602). Cancelled while IsEmpty was searching accepting run (input had 215 states). - StatisticsResult: Ultimate Automizer benchmark data for error location: inspect_beforeErr0EnsuresViolation CFG has 9 procedures, 215 locations, 9 error locations. TIMEOUT Result, 0.0s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=215occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, REUSE_STATISTICS: No data available - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1). Cancelled while IsEmpty was searching accepting run (input had 215 states). - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 9 procedures, 215 locations, 9 error locations. TIMEOUT Result, 0.0s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=215occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, REUSE_STATISTICS: No data available - TimeoutResultAtElement [Line: 625]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 625). Cancelled while IsEmpty was searching accepting run (input had 215 states). - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 9 procedures, 215 locations, 9 error locations. TIMEOUT Result, 0.0s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=215occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, REUSE_STATISTICS: No data available - TimeoutResultAtElement [Line: 616]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 616). Cancelled while IsEmpty was searching accepting run (input had 215 states). - StatisticsResult: Ultimate Automizer benchmark data for error location: inspect_afterErr0EnsuresViolation CFG has 9 procedures, 215 locations, 9 error locations. TIMEOUT Result, 0.0s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=215occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/merge_sort_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-23_14-50-05-081.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/merge_sort_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-23_14-50-05-081.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/merge_sort_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-23_14-50-05-081.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/merge_sort_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-23_14-50-05-081.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/merge_sort_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-23_14-50-05-081.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/merge_sort_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-4-2018-01-23_14-50-05-081.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/merge_sort_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-5-2018-01-23_14-50-05-081.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/merge_sort_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-6-2018-01-23_14-50-05-081.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/merge_sort_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-7-2018-01-23_14-50-05-081.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/merge_sort_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-8-2018-01-23_14-50-05-081.csv Completed graceful shutdown