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-2f49842 [2018-01-20 22:23:14,587 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-20 22:23:14,589 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-20 22:23:14,603 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-20 22:23:14,604 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-20 22:23:14,605 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-20 22:23:14,606 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-20 22:23:14,607 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-20 22:23:14,609 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-20 22:23:14,610 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-20 22:23:14,611 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-20 22:23:14,611 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-20 22:23:14,612 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-20 22:23:14,613 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-20 22:23:14,614 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-20 22:23:14,617 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-20 22:23:14,619 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-20 22:23:14,621 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-20 22:23:14,622 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-20 22:23:14,624 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-20 22:23:14,626 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-20 22:23:14,626 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-20 22:23:14,627 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-20 22:23:14,628 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-20 22:23:14,628 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-20 22:23:14,630 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-20 22:23:14,630 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-20 22:23:14,631 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-20 22:23:14,631 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-20 22:23:14,631 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-20 22:23:14,632 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-20 22:23:14,632 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-20 22:23:14,640 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-20 22:23:14,640 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-20 22:23:14,641 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-20 22:23:14,641 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-20 22:23:14,641 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-20 22:23:14,641 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-20 22:23:14,641 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-20 22:23:14,642 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-20 22:23:14,642 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-20 22:23:14,642 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-20 22:23:14,642 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-20 22:23:14,642 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-20 22:23:14,643 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-20 22:23:14,643 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-20 22:23:14,643 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-20 22:23:14,643 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-20 22:23:14,643 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-20 22:23:14,643 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-20 22:23:14,643 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-20 22:23:14,644 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-20 22:23:14,644 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-20 22:23:14,644 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-20 22:23:14,644 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-20 22:23:14,644 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-20 22:23:14,645 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-20 22:23:14,645 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-20 22:23:14,645 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-20 22:23:14,645 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-20 22:23:14,645 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-20 22:23:14,645 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-20 22:23:14,645 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-20 22:23:14,646 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-20 22:23:14,646 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-20 22:23:14,646 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-20 22:23:14,646 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-20 22:23:14,647 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-20 22:23:14,647 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-20 22:23:14,680 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-20 22:23:14,691 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-20 22:23:14,695 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-20 22:23:14,696 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-20 22:23:14,696 INFO L276 PluginConnector]: CDTParser initialized [2018-01-20 22:23:14,697 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-20 22:23:14,875 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-20 22:23:14,879 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-20 22:23:14,880 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-20 22:23:14,880 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-20 22:23:14,886 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-20 22:23:14,887 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 10:23:14" (1/1) ... [2018-01-20 22:23:14,890 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65dec646 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:23:14, skipping insertion in model container [2018-01-20 22:23:14,890 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 10:23:14" (1/1) ... [2018-01-20 22:23:14,904 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 22:23:14,944 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 22:23:15,079 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 22:23:15,106 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 22:23:15,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:23:15 WrapperNode [2018-01-20 22:23:15,121 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-20 22:23:15,122 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-20 22:23:15,122 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-20 22:23:15,122 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-20 22:23:15,138 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:23:15" (1/1) ... [2018-01-20 22:23:15,138 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:23:15" (1/1) ... [2018-01-20 22:23:15,151 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:23:15" (1/1) ... [2018-01-20 22:23:15,151 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:23:15" (1/1) ... [2018-01-20 22:23:15,162 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:23:15" (1/1) ... [2018-01-20 22:23:15,168 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:23:15" (1/1) ... [2018-01-20 22:23:15,170 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:23:15" (1/1) ... [2018-01-20 22:23:15,173 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-20 22:23:15,174 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-20 22:23:15,174 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-20 22:23:15,174 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-20 22:23:15,175 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:23:15" (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-20 22:23:15,222 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-20 22:23:15,223 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-20 22:23:15,223 INFO L136 BoogieDeclarations]: Found implementation of procedure fail [2018-01-20 22:23:15,223 INFO L136 BoogieDeclarations]: Found implementation of procedure merge_single_node [2018-01-20 22:23:15,223 INFO L136 BoogieDeclarations]: Found implementation of procedure merge_pair [2018-01-20 22:23:15,223 INFO L136 BoogieDeclarations]: Found implementation of procedure seq_sort_core [2018-01-20 22:23:15,223 INFO L136 BoogieDeclarations]: Found implementation of procedure inspect_before [2018-01-20 22:23:15,223 INFO L136 BoogieDeclarations]: Found implementation of procedure inspect_after [2018-01-20 22:23:15,224 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-20 22:23:15,224 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-20 22:23:15,224 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-20 22:23:15,224 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-20 22:23:15,224 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-20 22:23:15,224 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-20 22:23:15,225 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-20 22:23:15,225 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-20 22:23:15,225 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-20 22:23:15,225 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-20 22:23:15,225 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-01-20 22:23:15,225 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-20 22:23:15,226 INFO L128 BoogieDeclarations]: Found specification of procedure fail [2018-01-20 22:23:15,226 INFO L128 BoogieDeclarations]: Found specification of procedure merge_single_node [2018-01-20 22:23:15,226 INFO L128 BoogieDeclarations]: Found specification of procedure merge_pair [2018-01-20 22:23:15,226 INFO L128 BoogieDeclarations]: Found specification of procedure seq_sort_core [2018-01-20 22:23:15,226 INFO L128 BoogieDeclarations]: Found specification of procedure inspect_before [2018-01-20 22:23:15,227 INFO L128 BoogieDeclarations]: Found specification of procedure inspect_after [2018-01-20 22:23:15,227 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-20 22:23:15,227 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-20 22:23:15,227 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-20 22:23:15,873 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-20 22:23:15,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:23:15 BoogieIcfgContainer [2018-01-20 22:23:15,874 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-20 22:23:15,875 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-20 22:23:15,875 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-20 22:23:15,878 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-20 22:23:15,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.01 10:23:14" (1/3) ... [2018-01-20 22:23:15,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f53e7c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:23:15, skipping insertion in model container [2018-01-20 22:23:15,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:23:15" (2/3) ... [2018-01-20 22:23:15,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f53e7c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:23:15, skipping insertion in model container [2018-01-20 22:23:15,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:23:15" (3/3) ... [2018-01-20 22:23:15,882 INFO L105 eAbstractionObserver]: Analyzing ICFG merge_sort_true-unreach-call_true-valid-memsafety.i [2018-01-20 22:23:15,891 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-20 22:23:15,898 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-20 22:23:15,948 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:23:15,949 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:23:15,949 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:23:15,949 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:23:15,949 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:23:15,949 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:23:15,949 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:23:15,949 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == failErr0EnsuresViolation======== [2018-01-20 22:23:15,950 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:23:15,970 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states. [2018-01-20 22:23:15,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-20 22:23:15,975 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:23:15,976 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:23:15,976 INFO L371 AbstractCegarLoop]: === Iteration 1 === [failErr0EnsuresViolation]=== [2018-01-20 22:23:15,980 INFO L82 PathProgramCache]: Analyzing trace with hash -101851905, now seen corresponding path program 1 times [2018-01-20 22:23:15,981 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:23:15,982 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:23:16,019 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:23:16,019 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:23:16,020 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:23:16,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:23:16,076 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:23:16,103 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-20 22:23:16,105 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:23:16,105 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:23:16,107 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 22:23:16,117 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 22:23:16,118 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:23:16,193 INFO L87 Difference]: Start difference. First operand 215 states. Second operand 2 states. [2018-01-20 22:23:16,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:23:16,245 INFO L93 Difference]: Finished difference Result 417 states and 571 transitions. [2018-01-20 22:23:16,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 22:23:16,246 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-01-20 22:23:16,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:23:16,253 INFO L225 Difference]: With dead ends: 417 [2018-01-20 22:23:16,254 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 22:23:16,261 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-20 22:23:16,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 22:23:16,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 22:23:16,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 22:23:16,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 22:23:16,285 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2018-01-20 22:23:16,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:23:16,285 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 22:23:16,285 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 22:23:16,285 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 22:23:16,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 22:23:16,290 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-20 22:23:16,417 INFO L404 ceAbstractionStarter]: At program point failENTRY(lines 553 555) the Hoare annotation is: true [2018-01-20 22:23:16,417 INFO L401 ceAbstractionStarter]: For program point failFINAL(lines 553 555) no Hoare annotation was computed. [2018-01-20 22:23:16,417 INFO L401 ceAbstractionStarter]: For program point failErr0EnsuresViolation(lines 553 555) no Hoare annotation was computed. [2018-01-20 22:23:16,418 INFO L401 ceAbstractionStarter]: For program point failEXIT(lines 553 555) no Hoare annotation was computed. [2018-01-20 22:23:16,418 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 655) no Hoare annotation was computed. [2018-01-20 22:23:16,418 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 655) no Hoare annotation was computed. [2018-01-20 22:23:16,418 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 655) the Hoare annotation is: true [2018-01-20 22:23:16,418 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 655) no Hoare annotation was computed. [2018-01-20 22:23:16,418 INFO L404 ceAbstractionStarter]: At program point L581(line 581) the Hoare annotation is: true [2018-01-20 22:23:16,418 INFO L404 ceAbstractionStarter]: At program point L581'(line 581) the Hoare annotation is: true [2018-01-20 22:23:16,418 INFO L401 ceAbstractionStarter]: For program point L573'(lines 573 583) no Hoare annotation was computed. [2018-01-20 22:23:16,418 INFO L401 ceAbstractionStarter]: For program point merge_pairFINAL(lines 573 583) no Hoare annotation was computed. [2018-01-20 22:23:16,418 INFO L401 ceAbstractionStarter]: For program point L577'''''(line 577) no Hoare annotation was computed. [2018-01-20 22:23:16,418 INFO L401 ceAbstractionStarter]: For program point L578''''''''''(line 578) no Hoare annotation was computed. [2018-01-20 22:23:16,419 INFO L401 ceAbstractionStarter]: For program point L573'''''''''''(lines 573 583) no Hoare annotation was computed. [2018-01-20 22:23:16,419 INFO L401 ceAbstractionStarter]: For program point L578''''''''''''''(line 578) no Hoare annotation was computed. [2018-01-20 22:23:16,419 INFO L401 ceAbstractionStarter]: For program point L573''(lines 573 583) no Hoare annotation was computed. [2018-01-20 22:23:16,419 INFO L404 ceAbstractionStarter]: At program point merge_pairENTRY(lines 573 583) the Hoare annotation is: true [2018-01-20 22:23:16,419 INFO L401 ceAbstractionStarter]: For program point L573''''''''''''''(lines 573 583) no Hoare annotation was computed. [2018-01-20 22:23:16,419 INFO L401 ceAbstractionStarter]: For program point L573''''''''''''''''(lines 573 583) no Hoare annotation was computed. [2018-01-20 22:23:16,419 INFO L401 ceAbstractionStarter]: For program point L578'(line 578) no Hoare annotation was computed. [2018-01-20 22:23:16,419 INFO L401 ceAbstractionStarter]: For program point L573''''''''''''''''''(lines 573 583) no Hoare annotation was computed. [2018-01-20 22:23:16,419 INFO L401 ceAbstractionStarter]: For program point L577''(line 577) no Hoare annotation was computed. [2018-01-20 22:23:16,419 INFO L401 ceAbstractionStarter]: For program point L573''''''(lines 573 583) no Hoare annotation was computed. [2018-01-20 22:23:16,419 INFO L401 ceAbstractionStarter]: For program point L573''''''''(lines 573 583) no Hoare annotation was computed. [2018-01-20 22:23:16,420 INFO L401 ceAbstractionStarter]: For program point L573(lines 573 583) no Hoare annotation was computed. [2018-01-20 22:23:16,420 INFO L401 ceAbstractionStarter]: For program point L573'''''(lines 573 583) no Hoare annotation was computed. [2018-01-20 22:23:16,420 INFO L404 ceAbstractionStarter]: At program point L579(line 579) the Hoare annotation is: true [2018-01-20 22:23:16,420 INFO L401 ceAbstractionStarter]: For program point L578(line 578) no Hoare annotation was computed. [2018-01-20 22:23:16,420 INFO L401 ceAbstractionStarter]: For program point L577(lines 577 582) no Hoare annotation was computed. [2018-01-20 22:23:16,420 INFO L401 ceAbstractionStarter]: For program point L578'''''''''(line 578) no Hoare annotation was computed. [2018-01-20 22:23:16,420 INFO L401 ceAbstractionStarter]: For program point L578'''''(line 578) no Hoare annotation was computed. [2018-01-20 22:23:16,420 INFO L401 ceAbstractionStarter]: For program point L577''''(line 577) no Hoare annotation was computed. [2018-01-20 22:23:16,421 INFO L401 ceAbstractionStarter]: For program point L577''''''''(lines 577 582) no Hoare annotation was computed. [2018-01-20 22:23:16,421 INFO L401 ceAbstractionStarter]: For program point L573'''''''''(lines 573 583) no Hoare annotation was computed. [2018-01-20 22:23:16,421 INFO L401 ceAbstractionStarter]: For program point L573'''''''''''''''''(lines 573 583) no Hoare annotation was computed. [2018-01-20 22:23:16,421 INFO L401 ceAbstractionStarter]: For program point merge_pairErr0EnsuresViolation(lines 573 583) no Hoare annotation was computed. [2018-01-20 22:23:16,421 INFO L401 ceAbstractionStarter]: For program point L573'''(lines 573 583) no Hoare annotation was computed. [2018-01-20 22:23:16,421 INFO L401 ceAbstractionStarter]: For program point L578''''(line 578) no Hoare annotation was computed. [2018-01-20 22:23:16,421 INFO L401 ceAbstractionStarter]: For program point L573'''''''''''''''(lines 573 583) no Hoare annotation was computed. [2018-01-20 22:23:16,421 INFO L401 ceAbstractionStarter]: For program point L573''''''''''(lines 573 583) no Hoare annotation was computed. [2018-01-20 22:23:16,421 INFO L401 ceAbstractionStarter]: For program point L578''''''(line 578) no Hoare annotation was computed. [2018-01-20 22:23:16,421 INFO L401 ceAbstractionStarter]: For program point L578'''''''''''(line 578) no Hoare annotation was computed. [2018-01-20 22:23:16,421 INFO L401 ceAbstractionStarter]: For program point L578'''''''(line 578) no Hoare annotation was computed. [2018-01-20 22:23:16,422 INFO L401 ceAbstractionStarter]: For program point L578''(line 578) no Hoare annotation was computed. [2018-01-20 22:23:16,422 INFO L401 ceAbstractionStarter]: For program point L573''''''''''''(lines 573 583) no Hoare annotation was computed. [2018-01-20 22:23:16,422 INFO L401 ceAbstractionStarter]: For program point L573'''''''(lines 573 583) no Hoare annotation was computed. [2018-01-20 22:23:16,422 INFO L401 ceAbstractionStarter]: For program point merge_pairEXIT(lines 573 583) no Hoare annotation was computed. [2018-01-20 22:23:16,422 INFO L401 ceAbstractionStarter]: For program point L578''''''''(line 578) no Hoare annotation was computed. [2018-01-20 22:23:16,422 INFO L401 ceAbstractionStarter]: For program point L578'''''''''''''(line 578) no Hoare annotation was computed. [2018-01-20 22:23:16,422 INFO L401 ceAbstractionStarter]: For program point L577'(line 577) no Hoare annotation was computed. [2018-01-20 22:23:16,422 INFO L401 ceAbstractionStarter]: For program point L573''''(lines 573 583) no Hoare annotation was computed. [2018-01-20 22:23:16,422 INFO L401 ceAbstractionStarter]: For program point L577''''''(line 577) no Hoare annotation was computed. [2018-01-20 22:23:16,422 INFO L401 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-01-20 22:23:16,422 INFO L401 ceAbstractionStarter]: For program point L570(line 570) no Hoare annotation was computed. [2018-01-20 22:23:16,422 INFO L401 ceAbstractionStarter]: For program point L570'(line 570) no Hoare annotation was computed. [2018-01-20 22:23:16,423 INFO L401 ceAbstractionStarter]: For program point merge_single_nodeFINAL(lines 564 572) no Hoare annotation was computed. [2018-01-20 22:23:16,423 INFO L401 ceAbstractionStarter]: For program point merge_single_nodeErr0EnsuresViolation(lines 564 572) no Hoare annotation was computed. [2018-01-20 22:23:16,423 INFO L401 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-01-20 22:23:16,423 INFO L401 ceAbstractionStarter]: For program point L567(line 567) no Hoare annotation was computed. [2018-01-20 22:23:16,423 INFO L401 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-01-20 22:23:16,423 INFO L401 ceAbstractionStarter]: For program point merge_single_nodeEXIT(lines 564 572) no Hoare annotation was computed. [2018-01-20 22:23:16,423 INFO L404 ceAbstractionStarter]: At program point merge_single_nodeENTRY(lines 564 572) the Hoare annotation is: true [2018-01-20 22:23:16,423 INFO L401 ceAbstractionStarter]: For program point L567'(line 567) no Hoare annotation was computed. [2018-01-20 22:23:16,424 INFO L401 ceAbstractionStarter]: For program point L568'(line 568) no Hoare annotation was computed. [2018-01-20 22:23:16,424 INFO L401 ceAbstractionStarter]: For program point L569'(line 569) no Hoare annotation was computed. [2018-01-20 22:23:16,424 INFO L401 ceAbstractionStarter]: For program point L568''(line 568) no Hoare annotation was computed. [2018-01-20 22:23:16,424 INFO L401 ceAbstractionStarter]: For program point L595'(line 595) no Hoare annotation was computed. [2018-01-20 22:23:16,424 INFO L401 ceAbstractionStarter]: For program point L594'''(line 594) no Hoare annotation was computed. [2018-01-20 22:23:16,424 INFO L401 ceAbstractionStarter]: For program point L597'(line 597) no Hoare annotation was computed. [2018-01-20 22:23:16,424 INFO L401 ceAbstractionStarter]: For program point L589(lines 589 593) no Hoare annotation was computed. [2018-01-20 22:23:16,424 INFO L401 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-01-20 22:23:16,425 INFO L401 ceAbstractionStarter]: For program point seq_sort_coreErr0EnsuresViolation(lines 584 601) no Hoare annotation was computed. [2018-01-20 22:23:16,425 INFO L401 ceAbstractionStarter]: For program point L587(lines 587 599) no Hoare annotation was computed. [2018-01-20 22:23:16,425 INFO L404 ceAbstractionStarter]: At program point L594''(line 594) the Hoare annotation is: true [2018-01-20 22:23:16,425 INFO L401 ceAbstractionStarter]: For program point seq_sort_coreEXIT(lines 584 601) no Hoare annotation was computed. [2018-01-20 22:23:16,425 INFO L401 ceAbstractionStarter]: For program point seq_sort_coreFINAL(lines 584 601) no Hoare annotation was computed. [2018-01-20 22:23:16,425 INFO L404 ceAbstractionStarter]: At program point L598'(line 598) the Hoare annotation is: true [2018-01-20 22:23:16,425 INFO L401 ceAbstractionStarter]: For program point L588'(line 588) no Hoare annotation was computed. [2018-01-20 22:23:16,425 INFO L401 ceAbstractionStarter]: For program point L590'(line 590) no Hoare annotation was computed. [2018-01-20 22:23:16,426 INFO L401 ceAbstractionStarter]: For program point L590(line 590) no Hoare annotation was computed. [2018-01-20 22:23:16,426 INFO L401 ceAbstractionStarter]: For program point L594'(line 594) no Hoare annotation was computed. [2018-01-20 22:23:16,426 INFO L401 ceAbstractionStarter]: For program point L597(line 597) no Hoare annotation was computed. [2018-01-20 22:23:16,426 INFO L401 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-01-20 22:23:16,426 INFO L404 ceAbstractionStarter]: At program point seq_sort_coreENTRY(lines 584 601) the Hoare annotation is: true [2018-01-20 22:23:16,426 INFO L401 ceAbstractionStarter]: For program point L594(line 594) no Hoare annotation was computed. [2018-01-20 22:23:16,426 INFO L401 ceAbstractionStarter]: For program point L598(line 598) no Hoare annotation was computed. [2018-01-20 22:23:16,426 INFO L401 ceAbstractionStarter]: For program point L587''(lines 587 599) no Hoare annotation was computed. [2018-01-20 22:23:16,427 INFO L401 ceAbstractionStarter]: For program point L609'''''''(line 609) no Hoare annotation was computed. [2018-01-20 22:23:16,427 INFO L404 ceAbstractionStarter]: At program point inspect_beforeENTRY(lines 602 615) the Hoare annotation is: true [2018-01-20 22:23:16,427 INFO L404 ceAbstractionStarter]: At program point L611'(line 611) the Hoare annotation is: true [2018-01-20 22:23:16,427 INFO L401 ceAbstractionStarter]: For program point L607'(line 607) no Hoare annotation was computed. [2018-01-20 22:23:16,427 INFO L401 ceAbstractionStarter]: For program point L609'''''(line 609) no Hoare annotation was computed. [2018-01-20 22:23:16,427 INFO L401 ceAbstractionStarter]: For program point L613''''(line 613) no Hoare annotation was computed. [2018-01-20 22:23:16,427 INFO L401 ceAbstractionStarter]: For program point L612(line 612) no Hoare annotation was computed. [2018-01-20 22:23:16,428 INFO L401 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-01-20 22:23:16,428 INFO L401 ceAbstractionStarter]: For program point L611'''''(line 611) no Hoare annotation was computed. [2018-01-20 22:23:16,428 INFO L404 ceAbstractionStarter]: At program point L613''(line 613) the Hoare annotation is: true [2018-01-20 22:23:16,428 INFO L404 ceAbstractionStarter]: At program point L606'''''(line 606) the Hoare annotation is: true [2018-01-20 22:23:16,428 INFO L404 ceAbstractionStarter]: At program point L607''(line 607) the Hoare annotation is: true [2018-01-20 22:23:16,428 INFO L401 ceAbstractionStarter]: For program point L614(line 614) no Hoare annotation was computed. [2018-01-20 22:23:16,428 INFO L401 ceAbstractionStarter]: For program point L613(line 613) no Hoare annotation was computed. [2018-01-20 22:23:16,428 INFO L401 ceAbstractionStarter]: For program point L612'(line 612) no Hoare annotation was computed. [2018-01-20 22:23:16,429 INFO L401 ceAbstractionStarter]: For program point L608'(line 608) no Hoare annotation was computed. [2018-01-20 22:23:16,429 INFO L404 ceAbstractionStarter]: At program point L609'''(line 609) the Hoare annotation is: true [2018-01-20 22:23:16,429 INFO L401 ceAbstractionStarter]: For program point L605'(line 605) no Hoare annotation was computed. [2018-01-20 22:23:16,429 INFO L404 ceAbstractionStarter]: At program point L614'''(line 614) the Hoare annotation is: true [2018-01-20 22:23:16,429 INFO L401 ceAbstractionStarter]: For program point L613''''''(line 613) no Hoare annotation was computed. [2018-01-20 22:23:16,429 INFO L401 ceAbstractionStarter]: For program point L607''''(line 607) no Hoare annotation was computed. [2018-01-20 22:23:16,429 INFO L401 ceAbstractionStarter]: For program point L607''''''(line 607) no Hoare annotation was computed. [2018-01-20 22:23:16,429 INFO L401 ceAbstractionStarter]: For program point L605''''(line 605) no Hoare annotation was computed. [2018-01-20 22:23:16,429 INFO L401 ceAbstractionStarter]: For program point L606'''(line 606) no Hoare annotation was computed. [2018-01-20 22:23:16,429 INFO L401 ceAbstractionStarter]: For program point L614''(line 614) no Hoare annotation was computed. [2018-01-20 22:23:16,429 INFO L401 ceAbstractionStarter]: For program point L612''''''(line 612) no Hoare annotation was computed. [2018-01-20 22:23:16,429 INFO L401 ceAbstractionStarter]: For program point L605'''''(lines 605 610) no Hoare annotation was computed. [2018-01-20 22:23:16,430 INFO L404 ceAbstractionStarter]: At program point L606'(line 606) the Hoare annotation is: true [2018-01-20 22:23:16,430 INFO L401 ceAbstractionStarter]: For program point inspect_beforeErr0EnsuresViolation(lines 602 615) no Hoare annotation was computed. [2018-01-20 22:23:16,430 INFO L401 ceAbstractionStarter]: For program point L608''''''(line 608) no Hoare annotation was computed. [2018-01-20 22:23:16,430 INFO L401 ceAbstractionStarter]: For program point L612''''(line 612) no Hoare annotation was computed. [2018-01-20 22:23:16,430 INFO L401 ceAbstractionStarter]: For program point L614''''''''(line 614) no Hoare annotation was computed. [2018-01-20 22:23:16,430 INFO L401 ceAbstractionStarter]: For program point L604'''(line 604) no Hoare annotation was computed. [2018-01-20 22:23:16,430 INFO L401 ceAbstractionStarter]: For program point L609''(line 609) no Hoare annotation was computed. [2018-01-20 22:23:16,430 INFO L401 ceAbstractionStarter]: For program point L614'''''(line 614) no Hoare annotation was computed. [2018-01-20 22:23:16,430 INFO L404 ceAbstractionStarter]: At program point L604'(line 604) the Hoare annotation is: true [2018-01-20 22:23:16,430 INFO L401 ceAbstractionStarter]: For program point L611'''(line 611) no Hoare annotation was computed. [2018-01-20 22:23:16,430 INFO L401 ceAbstractionStarter]: For program point L605'''(lines 605 610) no Hoare annotation was computed. [2018-01-20 22:23:16,430 INFO L401 ceAbstractionStarter]: For program point L608''''(line 608) no Hoare annotation was computed. [2018-01-20 22:23:16,431 INFO L401 ceAbstractionStarter]: For program point L614'''''''(line 614) no Hoare annotation was computed. [2018-01-20 22:23:16,431 INFO L401 ceAbstractionStarter]: For program point L605(line 605) no Hoare annotation was computed. [2018-01-20 22:23:16,431 INFO L401 ceAbstractionStarter]: For program point L604(line 604) no Hoare annotation was computed. [2018-01-20 22:23:16,431 INFO L401 ceAbstractionStarter]: For program point L609(line 609) no Hoare annotation was computed. [2018-01-20 22:23:16,431 INFO L401 ceAbstractionStarter]: For program point L608(line 608) no Hoare annotation was computed. [2018-01-20 22:23:16,431 INFO L401 ceAbstractionStarter]: For program point L607(line 607) no Hoare annotation was computed. [2018-01-20 22:23:16,431 INFO L401 ceAbstractionStarter]: For program point L606(line 606) no Hoare annotation was computed. [2018-01-20 22:23:16,431 INFO L401 ceAbstractionStarter]: For program point L613'(line 613) no Hoare annotation was computed. [2018-01-20 22:23:16,431 INFO L404 ceAbstractionStarter]: At program point L604'''''(line 604) the Hoare annotation is: true [2018-01-20 22:23:16,432 INFO L401 ceAbstractionStarter]: For program point L609'(line 609) no Hoare annotation was computed. [2018-01-20 22:23:16,432 INFO L401 ceAbstractionStarter]: For program point inspect_beforeEXIT(lines 602 615) no Hoare annotation was computed. [2018-01-20 22:23:16,432 INFO L404 ceAbstractionStarter]: At program point L612''(line 612) the Hoare annotation is: true [2018-01-20 22:23:16,432 INFO L404 ceAbstractionStarter]: At program point L608''(line 608) the Hoare annotation is: true [2018-01-20 22:23:16,432 INFO L401 ceAbstractionStarter]: For program point L614'(line 614) no Hoare annotation was computed. [2018-01-20 22:23:16,432 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 655) the Hoare annotation is: true [2018-01-20 22:23:16,432 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 655) no Hoare annotation was computed. [2018-01-20 22:23:16,433 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 655) the Hoare annotation is: true [2018-01-20 22:23:16,433 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 655) no Hoare annotation was computed. [2018-01-20 22:23:16,433 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 655) no Hoare annotation was computed. [2018-01-20 22:23:16,433 INFO L401 ceAbstractionStarter]: For program point L650'(line 650) no Hoare annotation was computed. [2018-01-20 22:23:16,433 INFO L401 ceAbstractionStarter]: For program point L649'''(lines 649 653) no Hoare annotation was computed. [2018-01-20 22:23:16,433 INFO L401 ceAbstractionStarter]: For program point L629(line 629) no Hoare annotation was computed. [2018-01-20 22:23:16,433 INFO L401 ceAbstractionStarter]: For program point L628(lines 628 640) no Hoare annotation was computed. [2018-01-20 22:23:16,433 INFO L401 ceAbstractionStarter]: For program point L628''''(lines 628 640) no Hoare annotation was computed. [2018-01-20 22:23:16,433 INFO L401 ceAbstractionStarter]: For program point L651(line 651) no Hoare annotation was computed. [2018-01-20 22:23:16,433 INFO L401 ceAbstractionStarter]: For program point L630''(lines 630 631) no Hoare annotation was computed. [2018-01-20 22:23:16,433 INFO L401 ceAbstractionStarter]: For program point L650(line 650) no Hoare annotation was computed. [2018-01-20 22:23:16,433 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 625 655) no Hoare annotation was computed. [2018-01-20 22:23:16,433 INFO L401 ceAbstractionStarter]: For program point L651'(line 651) no Hoare annotation was computed. [2018-01-20 22:23:16,434 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 625 655) no Hoare annotation was computed. [2018-01-20 22:23:16,434 INFO L404 ceAbstractionStarter]: At program point mainENTRY(lines 625 655) the Hoare annotation is: true [2018-01-20 22:23:16,434 INFO L401 ceAbstractionStarter]: For program point L644'(line 644) no Hoare annotation was computed. [2018-01-20 22:23:16,434 INFO L404 ceAbstractionStarter]: At program point L644''''(lines 644 645) the Hoare annotation is: true [2018-01-20 22:23:16,434 INFO L401 ceAbstractionStarter]: For program point L628'(lines 628 640) no Hoare annotation was computed. [2018-01-20 22:23:16,434 INFO L404 ceAbstractionStarter]: At program point L645(line 645) the Hoare annotation is: true [2018-01-20 22:23:16,434 INFO L401 ceAbstractionStarter]: For program point L644(lines 644 645) no Hoare annotation was computed. [2018-01-20 22:23:16,434 INFO L404 ceAbstractionStarter]: At program point L643(line 643) the Hoare annotation is: true [2018-01-20 22:23:16,434 INFO L401 ceAbstractionStarter]: For program point L649(lines 649 653) no Hoare annotation was computed. [2018-01-20 22:23:16,434 INFO L401 ceAbstractionStarter]: For program point L648(line 648) no Hoare annotation was computed. [2018-01-20 22:23:16,434 INFO L404 ceAbstractionStarter]: At program point L628'''(lines 628 640) the Hoare annotation is: true [2018-01-20 22:23:16,434 INFO L401 ceAbstractionStarter]: For program point L647(line 647) no Hoare annotation was computed. [2018-01-20 22:23:16,434 INFO L404 ceAbstractionStarter]: At program point L649''(lines 649 653) the Hoare annotation is: true [2018-01-20 22:23:16,435 INFO L401 ceAbstractionStarter]: For program point L646(line 646) no Hoare annotation was computed. [2018-01-20 22:23:16,435 INFO L401 ceAbstractionStarter]: For program point L645'(line 645) no Hoare annotation was computed. [2018-01-20 22:23:16,435 INFO L401 ceAbstractionStarter]: For program point L633'(line 633) no Hoare annotation was computed. [2018-01-20 22:23:16,435 INFO L401 ceAbstractionStarter]: For program point L629'(line 629) no Hoare annotation was computed. [2018-01-20 22:23:16,435 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 625 655) no Hoare annotation was computed. [2018-01-20 22:23:16,435 INFO L401 ceAbstractionStarter]: For program point L630(lines 630 631) no Hoare annotation was computed. [2018-01-20 22:23:16,435 INFO L401 ceAbstractionStarter]: For program point L634(line 634) no Hoare annotation was computed. [2018-01-20 22:23:16,435 INFO L401 ceAbstractionStarter]: For program point L633(line 633) no Hoare annotation was computed. [2018-01-20 22:23:16,435 INFO L404 ceAbstractionStarter]: At program point L644'''(lines 644 645) the Hoare annotation is: true [2018-01-20 22:23:16,435 INFO L401 ceAbstractionStarter]: For program point L632(line 632) no Hoare annotation was computed. [2018-01-20 22:23:16,435 INFO L401 ceAbstractionStarter]: For program point L638(line 638) no Hoare annotation was computed. [2018-01-20 22:23:16,435 INFO L401 ceAbstractionStarter]: For program point L635''(lines 635 636) no Hoare annotation was computed. [2018-01-20 22:23:16,435 INFO L401 ceAbstractionStarter]: For program point L637(line 637) no Hoare annotation was computed. [2018-01-20 22:23:16,435 INFO L401 ceAbstractionStarter]: For program point L635(lines 635 636) no Hoare annotation was computed. [2018-01-20 22:23:16,436 INFO L401 ceAbstractionStarter]: For program point L634'(line 634) no Hoare annotation was computed. [2018-01-20 22:23:16,436 INFO L401 ceAbstractionStarter]: For program point L623(line 623) no Hoare annotation was computed. [2018-01-20 22:23:16,436 INFO L401 ceAbstractionStarter]: For program point L623'''''''(line 623) no Hoare annotation was computed. [2018-01-20 22:23:16,436 INFO L401 ceAbstractionStarter]: For program point L622(line 622) no Hoare annotation was computed. [2018-01-20 22:23:16,436 INFO L401 ceAbstractionStarter]: For program point L622'''(line 622) no Hoare annotation was computed. [2018-01-20 22:23:16,436 INFO L401 ceAbstractionStarter]: For program point L620(line 620) no Hoare annotation was computed. [2018-01-20 22:23:16,436 INFO L404 ceAbstractionStarter]: At program point L623''(line 623) the Hoare annotation is: true [2018-01-20 22:23:16,436 INFO L404 ceAbstractionStarter]: At program point L622'''''''(line 622) the Hoare annotation is: true [2018-01-20 22:23:16,437 INFO L401 ceAbstractionStarter]: For program point L620'''''''(line 620) no Hoare annotation was computed. [2018-01-20 22:23:16,437 INFO L401 ceAbstractionStarter]: For program point L623'(line 623) no Hoare annotation was computed. [2018-01-20 22:23:16,437 INFO L401 ceAbstractionStarter]: For program point L620''''(line 620) no Hoare annotation was computed. [2018-01-20 22:23:16,437 INFO L401 ceAbstractionStarter]: For program point L619'(line 619) no Hoare annotation was computed. [2018-01-20 22:23:16,437 INFO L401 ceAbstractionStarter]: For program point L622'''''(line 622) no Hoare annotation was computed. [2018-01-20 22:23:16,437 INFO L401 ceAbstractionStarter]: For program point L619(line 619) no Hoare annotation was computed. [2018-01-20 22:23:16,437 INFO L401 ceAbstractionStarter]: For program point L618(line 618) no Hoare annotation was computed. [2018-01-20 22:23:16,437 INFO L404 ceAbstractionStarter]: At program point L619''(line 619) the Hoare annotation is: true [2018-01-20 22:23:16,437 INFO L401 ceAbstractionStarter]: For program point L620'(line 620) no Hoare annotation was computed. [2018-01-20 22:23:16,438 INFO L401 ceAbstractionStarter]: For program point L622''''''(line 622) no Hoare annotation was computed. [2018-01-20 22:23:16,438 INFO L404 ceAbstractionStarter]: At program point L620''(line 620) the Hoare annotation is: true [2018-01-20 22:23:16,438 INFO L401 ceAbstractionStarter]: For program point L622''(line 622) no Hoare annotation was computed. [2018-01-20 22:23:16,438 INFO L404 ceAbstractionStarter]: At program point inspect_afterENTRY(lines 616 624) the Hoare annotation is: true [2018-01-20 22:23:16,438 INFO L401 ceAbstractionStarter]: For program point L623''''''(line 623) no Hoare annotation was computed. [2018-01-20 22:23:16,438 INFO L401 ceAbstractionStarter]: For program point inspect_afterErr0EnsuresViolation(lines 616 624) no Hoare annotation was computed. [2018-01-20 22:23:16,438 INFO L401 ceAbstractionStarter]: For program point L618'''(line 618) no Hoare annotation was computed. [2018-01-20 22:23:16,438 INFO L404 ceAbstractionStarter]: At program point L618'''''(line 618) the Hoare annotation is: true [2018-01-20 22:23:16,439 INFO L401 ceAbstractionStarter]: For program point L619''''''(line 619) no Hoare annotation was computed. [2018-01-20 22:23:16,439 INFO L401 ceAbstractionStarter]: For program point L619''''(line 619) no Hoare annotation was computed. [2018-01-20 22:23:16,439 INFO L401 ceAbstractionStarter]: For program point L620''''''(line 620) no Hoare annotation was computed. [2018-01-20 22:23:16,439 INFO L401 ceAbstractionStarter]: For program point L622'(line 622) no Hoare annotation was computed. [2018-01-20 22:23:16,439 INFO L401 ceAbstractionStarter]: For program point L623''''(line 623) no Hoare annotation was computed. [2018-01-20 22:23:16,439 INFO L401 ceAbstractionStarter]: For program point inspect_afterEXIT(lines 616 624) no Hoare annotation was computed. [2018-01-20 22:23:16,439 INFO L404 ceAbstractionStarter]: At program point L618'(line 618) the Hoare annotation is: true [2018-01-20 22:23:16,445 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:23:16,445 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:23:16,445 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:23:16,445 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:23:16,445 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:23:16,446 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:23:16,446 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:23:16,446 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-20 22:23:16,446 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:23:16,450 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states. [2018-01-20 22:23:16,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-20 22:23:16,451 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:23:16,451 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-20 22:23:16,451 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-20 22:23:16,451 INFO L82 PathProgramCache]: Analyzing trace with hash 563166, now seen corresponding path program 1 times [2018-01-20 22:23:16,451 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:23:16,452 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:23:16,453 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:23:16,453 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:23:16,453 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:23:16,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:23:16,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:23:16,481 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 22:23:16,485 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:23:16,489 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:23:16,489 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:23:16,489 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:23:16,490 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:23:16,490 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:23:16,490 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:23:16,490 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:23:16,490 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == merge_pairErr0EnsuresViolation======== [2018-01-20 22:23:16,490 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:23:16,493 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states. [2018-01-20 22:23:16,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-01-20 22:23:16,497 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:23:16,497 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-20 22:23:16,498 INFO L371 AbstractCegarLoop]: === Iteration 1 === [merge_pairErr0EnsuresViolation]=== [2018-01-20 22:23:16,498 INFO L82 PathProgramCache]: Analyzing trace with hash -2032860850, now seen corresponding path program 1 times [2018-01-20 22:23:16,498 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:23:16,498 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:23:16,499 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:23:16,499 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:23:16,499 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:23:16,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:23:16,514 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:23:16,538 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-20 22:23:16,539 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:23:16,539 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:23:16,539 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 22:23:16,539 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 22:23:16,540 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:23:16,540 INFO L87 Difference]: Start difference. First operand 215 states. Second operand 2 states. [2018-01-20 22:23:16,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:23:16,556 INFO L93 Difference]: Finished difference Result 417 states and 571 transitions. [2018-01-20 22:23:16,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 22:23:16,557 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 53 [2018-01-20 22:23:16,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:23:16,562 INFO L225 Difference]: With dead ends: 417 [2018-01-20 22:23:16,562 INFO L226 Difference]: Without dead ends: 150 [2018-01-20 22:23:16,563 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-20 22:23:16,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-01-20 22:23:16,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-01-20 22:23:16,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-01-20 22:23:16,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 160 transitions. [2018-01-20 22:23:16,581 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 160 transitions. Word has length 53 [2018-01-20 22:23:16,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:23:16,581 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 160 transitions. [2018-01-20 22:23:16,582 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 22:23:16,582 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 160 transitions. [2018-01-20 22:23:16,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-01-20 22:23:16,583 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:23:16,584 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-20 22:23:16,584 INFO L371 AbstractCegarLoop]: === Iteration 2 === [merge_pairErr0EnsuresViolation]=== [2018-01-20 22:23:16,584 INFO L82 PathProgramCache]: Analyzing trace with hash -493560614, now seen corresponding path program 1 times [2018-01-20 22:23:16,584 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:23:16,584 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:23:16,585 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:23:16,585 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:23:16,585 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:23:16,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:23:16,603 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:23:16,671 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-20 22:23:16,671 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:23:16,671 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-20 22:23:16,672 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 22:23:16,673 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 22:23:16,673 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 22:23:16,673 INFO L87 Difference]: Start difference. First operand 150 states and 160 transitions. Second operand 3 states. [2018-01-20 22:23:16,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:23:16,712 INFO L93 Difference]: Finished difference Result 294 states and 314 transitions. [2018-01-20 22:23:16,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 22:23:16,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2018-01-20 22:23:16,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:23:16,715 INFO L225 Difference]: With dead ends: 294 [2018-01-20 22:23:16,716 INFO L226 Difference]: Without dead ends: 166 [2018-01-20 22:23:16,717 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-20 22:23:16,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-01-20 22:23:16,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 153. [2018-01-20 22:23:16,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-01-20 22:23:16,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 163 transitions. [2018-01-20 22:23:16,729 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 163 transitions. Word has length 75 [2018-01-20 22:23:16,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:23:16,730 INFO L432 AbstractCegarLoop]: Abstraction has 153 states and 163 transitions. [2018-01-20 22:23:16,730 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 22:23:16,730 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 163 transitions. [2018-01-20 22:23:16,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-01-20 22:23:16,733 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:23:16,733 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-20 22:23:16,733 INFO L371 AbstractCegarLoop]: === Iteration 3 === [merge_pairErr0EnsuresViolation]=== [2018-01-20 22:23:16,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1476607212, now seen corresponding path program 1 times [2018-01-20 22:23:16,733 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:23:16,733 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:23:16,734 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:23:16,734 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:23:16,734 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:23:16,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:23:16,793 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:23:16,865 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-20 22:23:16,865 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:23:16,865 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-20 22:23:16,866 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 22:23:16,866 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 22:23:16,866 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 22:23:16,867 INFO L87 Difference]: Start difference. First operand 153 states and 163 transitions. Second operand 3 states. [2018-01-20 22:23:16,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:23:16,885 INFO L93 Difference]: Finished difference Result 237 states and 258 transitions. [2018-01-20 22:23:16,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 22:23:16,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2018-01-20 22:23:16,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:23:16,888 INFO L225 Difference]: With dead ends: 237 [2018-01-20 22:23:16,888 INFO L226 Difference]: Without dead ends: 154 [2018-01-20 22:23:16,889 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-20 22:23:16,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-01-20 22:23:16,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-01-20 22:23:16,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-01-20 22:23:16,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 164 transitions. [2018-01-20 22:23:16,900 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 164 transitions. Word has length 91 [2018-01-20 22:23:16,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:23:16,900 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 164 transitions. [2018-01-20 22:23:16,900 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 22:23:16,900 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 164 transitions. [2018-01-20 22:23:16,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-01-20 22:23:16,903 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:23:16,903 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-20 22:23:16,903 INFO L371 AbstractCegarLoop]: === Iteration 4 === [merge_pairErr0EnsuresViolation]=== [2018-01-20 22:23:16,904 INFO L82 PathProgramCache]: Analyzing trace with hash 754057391, now seen corresponding path program 1 times [2018-01-20 22:23:16,904 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:23:16,904 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:23:16,905 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:23:16,905 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:23:16,905 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:23:16,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:23:16,955 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:23:17,821 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-20 22:23:17,822 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:23:17,822 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-01-20 22:23:17,822 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-20 22:23:17,822 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-20 22:23:17,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-01-20 22:23:17,823 INFO L87 Difference]: Start difference. First operand 154 states and 164 transitions. Second operand 17 states. [2018-01-20 22:23:18,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:23:18,684 INFO L93 Difference]: Finished difference Result 370 states and 407 transitions. [2018-01-20 22:23:18,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-20 22:23:18,684 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 93 [2018-01-20 22:23:18,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:23:18,688 INFO L225 Difference]: With dead ends: 370 [2018-01-20 22:23:18,688 INFO L226 Difference]: Without dead ends: 286 [2018-01-20 22:23:18,689 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=125, Invalid=687, Unknown=0, NotChecked=0, Total=812 [2018-01-20 22:23:18,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-01-20 22:23:18,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 221. [2018-01-20 22:23:18,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-01-20 22:23:18,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 242 transitions. [2018-01-20 22:23:18,708 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 242 transitions. Word has length 93 [2018-01-20 22:23:18,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:23:18,709 INFO L432 AbstractCegarLoop]: Abstraction has 221 states and 242 transitions. [2018-01-20 22:23:18,709 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-20 22:23:18,709 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 242 transitions. [2018-01-20 22:23:18,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-01-20 22:23:18,710 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:23:18,710 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-20 22:23:18,710 INFO L371 AbstractCegarLoop]: === Iteration 5 === [merge_pairErr0EnsuresViolation]=== [2018-01-20 22:23:18,711 INFO L82 PathProgramCache]: Analyzing trace with hash -514708738, now seen corresponding path program 1 times [2018-01-20 22:23:18,711 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:23:18,711 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:23:18,712 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:23:18,712 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:23:18,712 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:23:18,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:23:18,738 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:23:18,827 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-20 22:23:18,828 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:23:18,828 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-20 22:23:18,828 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-20 22:23:18,829 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-20 22:23:18,829 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-20 22:23:18,829 INFO L87 Difference]: Start difference. First operand 221 states and 242 transitions. Second operand 7 states. [2018-01-20 22:23:19,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:23:19,130 INFO L93 Difference]: Finished difference Result 343 states and 375 transitions. [2018-01-20 22:23:19,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-20 22:23:19,131 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 104 [2018-01-20 22:23:19,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:23:19,133 INFO L225 Difference]: With dead ends: 343 [2018-01-20 22:23:19,133 INFO L226 Difference]: Without dead ends: 256 [2018-01-20 22:23:19,134 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-20 22:23:19,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-01-20 22:23:19,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 231. [2018-01-20 22:23:19,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-01-20 22:23:19,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 253 transitions. [2018-01-20 22:23:19,150 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 253 transitions. Word has length 104 [2018-01-20 22:23:19,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:23:19,150 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 253 transitions. [2018-01-20 22:23:19,150 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-20 22:23:19,151 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 253 transitions. [2018-01-20 22:23:19,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-01-20 22:23:19,152 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:23:19,152 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-20 22:23:19,152 INFO L371 AbstractCegarLoop]: === Iteration 6 === [merge_pairErr0EnsuresViolation]=== [2018-01-20 22:23:19,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1958389758, now seen corresponding path program 1 times [2018-01-20 22:23:19,152 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:23:19,152 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:23:19,153 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:23:19,153 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:23:19,153 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:23:19,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:23:19,185 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:23:19,864 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-20 22:23:19,865 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:23:19,865 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-20 22:23:19,871 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:23:19,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:23:19,964 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:23:20,150 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-20 22:23:20,156 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-20 22:23:20,156 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:23:20,171 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:23:20,182 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-20 22:23:20,185 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-20 22:23:20,186 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:23:20,188 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:23:20,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:23:20,196 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2018-01-20 22:23:20,440 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-20 22:23:20,444 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-20 22:23:20,444 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:23:20,446 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:23:20,450 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-20 22:23:20,452 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-20 22:23:20,452 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:23:20,453 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:23:20,466 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-20 22:23:20,466 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-01-20 22:23:20,549 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-20 22:23:20,579 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:23:20,579 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 9] total 34 [2018-01-20 22:23:20,579 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-20 22:23:20,579 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-20 22:23:20,580 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1043, Unknown=0, NotChecked=0, Total=1122 [2018-01-20 22:23:20,580 INFO L87 Difference]: Start difference. First operand 231 states and 253 transitions. Second operand 34 states. [2018-01-20 22:23:23,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:23:23,582 INFO L93 Difference]: Finished difference Result 649 states and 719 transitions. [2018-01-20 22:23:23,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-01-20 22:23:23,583 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 109 [2018-01-20 22:23:23,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:23:23,586 INFO L225 Difference]: With dead ends: 649 [2018-01-20 22:23:23,586 INFO L226 Difference]: Without dead ends: 404 [2018-01-20 22:23:23,589 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-20 22:23:23,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2018-01-20 22:23:23,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 263. [2018-01-20 22:23:23,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-01-20 22:23:23,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 288 transitions. [2018-01-20 22:23:23,611 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 288 transitions. Word has length 109 [2018-01-20 22:23:23,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:23:23,611 INFO L432 AbstractCegarLoop]: Abstraction has 263 states and 288 transitions. [2018-01-20 22:23:23,611 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-01-20 22:23:23,611 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 288 transitions. [2018-01-20 22:23:23,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-01-20 22:23:23,613 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:23:23,613 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-20 22:23:23,613 INFO L371 AbstractCegarLoop]: === Iteration 7 === [merge_pairErr0EnsuresViolation]=== [2018-01-20 22:23:23,614 INFO L82 PathProgramCache]: Analyzing trace with hash 654400179, now seen corresponding path program 1 times [2018-01-20 22:23:23,614 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:23:23,614 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:23:23,615 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:23:23,615 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:23:23,615 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:23:23,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:23:23,821 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:23:24,344 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-20 22:23:24,344 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:23:24,344 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-20 22:23:24,350 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:23:24,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:23:24,407 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:23:24,447 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-20 22:23:24,451 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-20 22:23:24,452 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:23:24,454 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:23:24,458 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-20 22:23:24,458 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2018-01-20 22:23:24,588 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-20 22:23:24,609 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:23:24,609 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 23 [2018-01-20 22:23:24,610 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-20 22:23:24,610 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-20 22:23:24,610 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-01-20 22:23:24,610 INFO L87 Difference]: Start difference. First operand 263 states and 288 transitions. Second operand 23 states. [2018-01-20 22:24:05,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:24:05,324 INFO L93 Difference]: Finished difference Result 491 states and 541 transitions. [2018-01-20 22:24:05,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-20 22:24:05,325 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 132 [2018-01-20 22:24:05,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:24:05,327 INFO L225 Difference]: With dead ends: 491 [2018-01-20 22:24:05,327 INFO L226 Difference]: Without dead ends: 296 [2018-01-20 22:24:05,328 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 124 SyntacticMatches, 8 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=154, Invalid=776, Unknown=0, NotChecked=0, Total=930 [2018-01-20 22:24:05,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-01-20 22:24:05,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 266. [2018-01-20 22:24:05,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-01-20 22:24:05,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 291 transitions. [2018-01-20 22:24:05,342 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 291 transitions. Word has length 132 [2018-01-20 22:24:05,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:24:05,342 INFO L432 AbstractCegarLoop]: Abstraction has 266 states and 291 transitions. [2018-01-20 22:24:05,343 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-20 22:24:05,343 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 291 transitions. [2018-01-20 22:24:05,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-01-20 22:24:05,344 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:24:05,344 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-20 22:24:05,345 INFO L371 AbstractCegarLoop]: === Iteration 8 === [merge_pairErr0EnsuresViolation]=== [2018-01-20 22:24:05,345 INFO L82 PathProgramCache]: Analyzing trace with hash 222294500, now seen corresponding path program 1 times [2018-01-20 22:24:05,345 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:24:05,345 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:24:05,345 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:24:05,346 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:24:05,346 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:24:05,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:24:05,432 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:24:06,910 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-20 22:24:06,910 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:24:06,910 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-20 22:24:06,915 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:24:06,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:24:06,987 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:24:07,019 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-20 22:24:07,021 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-20 22:24:07,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:24:07,033 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:24:07,040 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-20 22:24:07,042 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-20 22:24:07,043 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:24:07,044 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:24:07,047 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-20 22:24:07,048 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:30, output treesize:3 [2018-01-20 22:24:07,400 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-20 22:24:07,404 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-20 22:24:07,405 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-20 22:24:07,448 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-20 22:24:07,449 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:24:07,470 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-20 22:24:07,471 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-20 22:24:07,498 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-20 22:24:07,516 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-20 22:24:07,518 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-20 22:24:07,518 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-20 22:24:07,523 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-20 22:24:07,523 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-20 22:24:07,526 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:24:07,536 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-20 22:24:07,539 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-20 22:24:07,539 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-20 22:24:07,553 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-20 22:24:07,553 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-20 22:24:07,570 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-20 22:24:07,571 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-20 22:24:07,574 INFO L267 ElimStorePlain]: Start of recursive call 9: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:24:07,580 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-20 22:24:07,583 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-20 22:24:07,584 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-20 22:24:07,599 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-20 22:24:07,600 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-01-20 22:24:07,610 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-20 22:24:07,610 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-01-20 22:24:07,613 INFO L267 ElimStorePlain]: Start of recursive call 13: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:24:07,624 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-20 22:24:07,626 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-20 22:24:07,627 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-20 22:24:07,637 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-20 22:24:07,637 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-01-20 22:24:07,649 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-20 22:24:07,650 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-20 22:24:07,661 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-20 22:24:07,684 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-20 22:24:07,686 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-20 22:24:07,687 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-20 22:24:07,696 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-20 22:24:07,697 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-01-20 22:24:07,708 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-20 22:24:07,709 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-01-20 22:24:07,712 INFO L267 ElimStorePlain]: Start of recursive call 21: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:24:07,717 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-20 22:24:07,719 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-20 22:24:07,720 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-20 22:24:07,731 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-20 22:24:07,731 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-01-20 22:24:07,742 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-20 22:24:07,742 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-01-20 22:24:07,746 INFO L267 ElimStorePlain]: Start of recursive call 25: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:24:07,748 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-20 22:24:07,750 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-20 22:24:07,750 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-01-20 22:24:07,755 INFO L267 ElimStorePlain]: Start of recursive call 29: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:24:07,759 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-20 22:24:07,759 INFO L202 ElimStorePlain]: Needed 30 recursive calls to eliminate 6 variables, input treesize:95, output treesize:9 [2018-01-20 22:24:07,804 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-20 22:24:07,805 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-20 22:24:07,805 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:24:07,809 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:24:07,822 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-20 22:24:07,824 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-20 22:24:07,824 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:24:07,828 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:24:07,839 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-20 22:24:07,840 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-20 22:24:07,840 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-20 22:24:07,844 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:24:07,853 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-20 22:24:07,855 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-20 22:24:07,855 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-20 22:24:07,858 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:24:07,865 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-20 22:24:07,866 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:55, output treesize:17 [2018-01-20 22:24:07,886 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-20 22:24:07,888 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-20 22:24:07,888 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:24:07,891 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:24:07,898 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-20 22:24:07,900 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-20 22:24:07,900 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:24:07,901 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:24:07,906 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-20 22:24:07,908 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-20 22:24:07,908 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-20 22:24:07,911 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:24:07,915 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-20 22:24:07,916 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-20 22:24:07,916 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-20 22:24:07,917 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:24:07,919 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-20 22:24:07,919 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:47, output treesize:9 [2018-01-20 22:24:07,969 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-20 22:24:07,989 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:24:07,989 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 20] total 39 [2018-01-20 22:24:07,989 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-01-20 22:24:07,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-01-20 22:24:07,990 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1380, Unknown=0, NotChecked=0, Total=1482 [2018-01-20 22:24:07,990 INFO L87 Difference]: Start difference. First operand 266 states and 291 transitions. Second operand 39 states. [2018-01-20 22:24:09,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:24:09,636 INFO L93 Difference]: Finished difference Result 530 states and 590 transitions. [2018-01-20 22:24:09,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-01-20 22:24:09,637 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 153 [2018-01-20 22:24:09,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:24:09,640 INFO L225 Difference]: With dead ends: 530 [2018-01-20 22:24:09,640 INFO L226 Difference]: Without dead ends: 405 [2018-01-20 22:24:09,641 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 141 SyntacticMatches, 12 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 972 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=279, Invalid=3143, Unknown=0, NotChecked=0, Total=3422 [2018-01-20 22:24:09,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2018-01-20 22:24:09,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 371. [2018-01-20 22:24:09,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-01-20 22:24:09,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 408 transitions. [2018-01-20 22:24:09,659 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 408 transitions. Word has length 153 [2018-01-20 22:24:09,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:24:09,659 INFO L432 AbstractCegarLoop]: Abstraction has 371 states and 408 transitions. [2018-01-20 22:24:09,659 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-01-20 22:24:09,659 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 408 transitions. [2018-01-20 22:24:09,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-01-20 22:24:09,661 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:24:09,661 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-20 22:24:09,661 INFO L371 AbstractCegarLoop]: === Iteration 9 === [merge_pairErr0EnsuresViolation]=== [2018-01-20 22:24:09,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1920057942, now seen corresponding path program 1 times [2018-01-20 22:24:09,661 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:24:09,661 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:24:09,662 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:24:09,662 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:24:09,662 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:24:09,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:24:09,678 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:24:09,964 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-20 22:24:09,964 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:24:09,964 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-20 22:24:09,970 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:24:10,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:24:10,040 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:24:10,253 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-20 22:24:10,274 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:24:10,274 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 12 [2018-01-20 22:24:10,274 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-20 22:24:10,275 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-20 22:24:10,275 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-01-20 22:24:10,275 INFO L87 Difference]: Start difference. First operand 371 states and 408 transitions. Second operand 12 states. [2018-01-20 22:24:10,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:24:10,557 INFO L93 Difference]: Finished difference Result 502 states and 560 transitions. [2018-01-20 22:24:10,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-20 22:24:10,578 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 157 [2018-01-20 22:24:10,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:24:10,581 INFO L225 Difference]: With dead ends: 502 [2018-01-20 22:24:10,581 INFO L226 Difference]: Without dead ends: 405 [2018-01-20 22:24:10,582 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 153 SyntacticMatches, 7 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2018-01-20 22:24:10,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2018-01-20 22:24:10,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 393. [2018-01-20 22:24:10,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-01-20 22:24:10,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 437 transitions. [2018-01-20 22:24:10,613 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 437 transitions. Word has length 157 [2018-01-20 22:24:10,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:24:10,613 INFO L432 AbstractCegarLoop]: Abstraction has 393 states and 437 transitions. [2018-01-20 22:24:10,613 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-20 22:24:10,613 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 437 transitions. [2018-01-20 22:24:10,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-01-20 22:24:10,617 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:24:10,618 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-20 22:24:10,618 INFO L371 AbstractCegarLoop]: === Iteration 10 === [merge_pairErr0EnsuresViolation]=== [2018-01-20 22:24:10,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1963414559, now seen corresponding path program 1 times [2018-01-20 22:24:10,618 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:24:10,618 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:24:10,619 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:24:10,619 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:24:10,619 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:24:10,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:24:10,649 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:24:10,761 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-20 22:24:10,761 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:24:10,761 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-20 22:24:10,762 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 22:24:10,762 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 22:24:10,762 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-20 22:24:10,762 INFO L87 Difference]: Start difference. First operand 393 states and 437 transitions. Second operand 4 states. [2018-01-20 22:24:10,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:24:10,800 INFO L93 Difference]: Finished difference Result 577 states and 667 transitions. [2018-01-20 22:24:10,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-20 22:24:10,800 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2018-01-20 22:24:10,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:24:10,803 INFO L225 Difference]: With dead ends: 577 [2018-01-20 22:24:10,803 INFO L226 Difference]: Without dead ends: 399 [2018-01-20 22:24:10,804 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-20 22:24:10,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-01-20 22:24:10,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2018-01-20 22:24:10,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-01-20 22:24:10,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 443 transitions. [2018-01-20 22:24:10,830 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 443 transitions. Word has length 157 [2018-01-20 22:24:10,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:24:10,830 INFO L432 AbstractCegarLoop]: Abstraction has 399 states and 443 transitions. [2018-01-20 22:24:10,830 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 22:24:10,830 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 443 transitions. [2018-01-20 22:24:10,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-01-20 22:24:10,833 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:24:10,833 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-20 22:24:10,833 INFO L371 AbstractCegarLoop]: === Iteration 11 === [merge_pairErr0EnsuresViolation]=== [2018-01-20 22:24:10,833 INFO L82 PathProgramCache]: Analyzing trace with hash -2041584414, now seen corresponding path program 1 times [2018-01-20 22:24:10,833 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:24:10,834 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:24:10,834 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:24:10,835 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:24:10,835 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:24:10,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:24:10,861 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:24:10,986 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-20 22:24:10,986 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:24:10,986 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-20 22:24:10,987 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-20 22:24:10,987 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-20 22:24:10,987 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-20 22:24:10,987 INFO L87 Difference]: Start difference. First operand 399 states and 443 transitions. Second operand 7 states. [2018-01-20 22:24:11,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:24:11,213 INFO L93 Difference]: Finished difference Result 631 states and 736 transitions. [2018-01-20 22:24:11,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-20 22:24:11,214 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 157 [2018-01-20 22:24:11,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:24:11,216 INFO L225 Difference]: With dead ends: 631 [2018-01-20 22:24:11,217 INFO L226 Difference]: Without dead ends: 447 [2018-01-20 22:24:11,218 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-20 22:24:11,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-01-20 22:24:11,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 417. [2018-01-20 22:24:11,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-01-20 22:24:11,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 464 transitions. [2018-01-20 22:24:11,244 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 464 transitions. Word has length 157 [2018-01-20 22:24:11,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:24:11,245 INFO L432 AbstractCegarLoop]: Abstraction has 417 states and 464 transitions. [2018-01-20 22:24:11,245 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-20 22:24:11,245 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 464 transitions. [2018-01-20 22:24:11,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-01-20 22:24:11,247 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:24:11,247 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-20 22:24:11,247 INFO L371 AbstractCegarLoop]: === Iteration 12 === [merge_pairErr0EnsuresViolation]=== [2018-01-20 22:24:11,247 INFO L82 PathProgramCache]: Analyzing trace with hash 21369046, now seen corresponding path program 1 times [2018-01-20 22:24:11,247 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:24:11,248 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:24:11,248 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:24:11,248 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:24:11,249 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:24:11,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:24:11,276 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:24:12,336 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-20 22:24:12,336 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:24:12,336 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-20 22:24:12,341 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:24:12,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:24:12,400 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:24:12,530 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-20 22:24:12,532 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-20 22:24:12,532 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:24:12,533 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:24:12,537 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-20 22:24:12,537 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 Received shutdown request... [2018-01-20 22:24:16,712 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-20 22:24:16,712 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-20 22:24:16,714 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:24:16,714 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:24:16,714 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:24:16,714 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:24:16,714 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:24:16,714 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:24:16,714 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:24:16,715 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == merge_single_nodeErr0EnsuresViolation======== [2018-01-20 22:24:16,715 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:24:16,716 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states. [2018-01-20 22:24:16,716 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-20 22:24:16,717 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:24:16,717 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:24:16,717 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:24:16,717 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:24:16,717 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:24:16,717 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:24:16,717 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:24:16,717 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == seq_sort_coreErr0EnsuresViolation======== [2018-01-20 22:24:16,717 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:24:16,719 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states. [2018-01-20 22:24:16,719 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-20 22:24:16,720 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:24:16,720 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:24:16,720 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:24:16,720 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:24:16,720 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:24:16,720 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:24:16,720 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:24:16,720 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == inspect_beforeErr0EnsuresViolation======== [2018-01-20 22:24:16,720 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:24:16,721 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states. [2018-01-20 22:24:16,721 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-20 22:24:16,722 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:24:16,722 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:24:16,722 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:24:16,722 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:24:16,722 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:24:16,723 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:24:16,723 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:24:16,723 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-20 22:24:16,723 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:24:16,724 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states. [2018-01-20 22:24:16,724 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-20 22:24:16,725 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:24:16,725 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:24:16,725 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:24:16,725 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:24:16,725 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:24:16,725 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:24:16,725 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:24:16,725 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-20 22:24:16,725 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:24:16,726 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states. [2018-01-20 22:24:16,727 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-20 22:24:16,727 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:24:16,727 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:24:16,727 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:24:16,728 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:24:16,728 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:24:16,728 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:24:16,728 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:24:16,728 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == inspect_afterErr0EnsuresViolation======== [2018-01-20 22:24:16,728 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:24:16,729 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states. [2018-01-20 22:24:16,729 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-20 22:24:16,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.01 10:24:16 BoogieIcfgContainer [2018-01-20 22:24:16,730 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-20 22:24:16,731 INFO L168 Benchmark]: Toolchain (without parser) took 61855.58 ms. Allocated memory was 306.2 MB in the beginning and 789.1 MB in the end (delta: 482.9 MB). Free memory was 264.5 MB in the beginning and 354.1 MB in the end (delta: -89.6 MB). Peak memory consumption was 393.3 MB. Max. memory is 5.3 GB. [2018-01-20 22:24:16,732 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 306.2 MB. Free memory is still 270.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-20 22:24:16,732 INFO L168 Benchmark]: CACSL2BoogieTranslator took 241.54 ms. Allocated memory is still 306.2 MB. Free memory was 263.5 MB in the beginning and 251.3 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 5.3 GB. [2018-01-20 22:24:16,732 INFO L168 Benchmark]: Boogie Preprocessor took 51.30 ms. Allocated memory is still 306.2 MB. Free memory was 251.3 MB in the beginning and 249.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-20 22:24:16,733 INFO L168 Benchmark]: RCFGBuilder took 700.76 ms. Allocated memory is still 306.2 MB. Free memory was 249.3 MB in the beginning and 199.0 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 5.3 GB. [2018-01-20 22:24:16,733 INFO L168 Benchmark]: TraceAbstraction took 60854.73 ms. Allocated memory was 306.2 MB in the beginning and 789.1 MB in the end (delta: 482.9 MB). Free memory was 199.0 MB in the beginning and 354.1 MB in the end (delta: -155.1 MB). Peak memory consumption was 327.8 MB. Max. memory is 5.3 GB. [2018-01-20 22:24:16,735 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 306.2 MB. Free memory is still 270.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 241.54 ms. Allocated memory is still 306.2 MB. Free memory was 263.5 MB in the beginning and 251.3 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 51.30 ms. Allocated memory is still 306.2 MB. Free memory was 251.3 MB in the beginning and 249.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 700.76 ms. Allocated memory is still 306.2 MB. Free memory was 249.3 MB in the beginning and 199.0 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 60854.73 ms. Allocated memory was 306.2 MB in the beginning and 789.1 MB in the end (delta: 482.9 MB). Free memory was 199.0 MB in the beginning and 354.1 MB in the end (delta: -155.1 MB). Peak memory consumption was 327.8 MB. 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, 60.2s OverallTime, 12 OverallIterations, 3 TraceHistogramMax, 47.2s 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.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 802 GetRequests, 544 SyntacticMatches, 36 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2339 ImplicationChecksByTransitivity, 5.9s 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.1s 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-20_22-24-16-743.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-20_22-24-16-743.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-20_22-24-16-743.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-20_22-24-16-743.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-20_22-24-16-743.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-20_22-24-16-743.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-20_22-24-16-743.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-20_22-24-16-743.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-20_22-24-16-743.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-20_22-24-16-743.csv Completed graceful shutdown