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/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf -i ../../../trunk/examples/svcomp/array-memsafety/subseq-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 05:32:12,113 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 05:32:12,116 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 05:32:12,132 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 05:32:12,133 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 05:32:12,134 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 05:32:12,135 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 05:32:12,137 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 05:32:12,139 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 05:32:12,140 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 05:32:12,141 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 05:32:12,141 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 05:32:12,142 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 05:32:12,144 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 05:32:12,145 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 05:32:12,148 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 05:32:12,150 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 05:32:12,152 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 05:32:12,154 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 05:32:12,155 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 05:32:12,158 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 05:32:12,158 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 05:32:12,158 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 05:32:12,159 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 05:32:12,160 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 05:32:12,162 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 05:32:12,162 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 05:32:12,163 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 05:32:12,163 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 05:32:12,164 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 05:32:12,164 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 05:32:12,165 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf [2018-01-25 05:32:12,175 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 05:32:12,175 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 05:32:12,176 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 05:32:12,176 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 05:32:12,177 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 05:32:12,177 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 05:32:12,177 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 05:32:12,177 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 05:32:12,178 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 05:32:12,178 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 05:32:12,178 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 05:32:12,179 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 05:32:12,179 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 05:32:12,179 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 05:32:12,179 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 05:32:12,179 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 05:32:12,179 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 05:32:12,180 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 05:32:12,180 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 05:32:12,180 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 05:32:12,180 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 05:32:12,180 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 05:32:12,181 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 05:32:12,181 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 05:32:12,181 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 05:32:12,181 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 05:32:12,181 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 05:32:12,182 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 05:32:12,182 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 05:32:12,182 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 05:32:12,182 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 05:32:12,182 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 05:32:12,183 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 05:32:12,183 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 05:32:12,184 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 05:32:12,184 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 05:32:12,219 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 05:32:12,231 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 05:32:12,235 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 05:32:12,236 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 05:32:12,237 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 05:32:12,238 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/subseq-alloca_true-valid-memsafety_true-termination.i [2018-01-25 05:32:12,393 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 05:32:12,400 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 05:32:12,401 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 05:32:12,402 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 05:32:12,409 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 05:32:12,410 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:32:12" (1/1) ... [2018-01-25 05:32:12,413 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f7faa1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:32:12, skipping insertion in model container [2018-01-25 05:32:12,413 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:32:12" (1/1) ... [2018-01-25 05:32:12,431 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:32:12,472 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:32:12,582 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:32:12,598 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:32:12,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:32:12 WrapperNode [2018-01-25 05:32:12,605 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 05:32:12,605 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 05:32:12,605 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 05:32:12,606 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 05:32:12,619 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:32:12" (1/1) ... [2018-01-25 05:32:12,620 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:32:12" (1/1) ... [2018-01-25 05:32:12,628 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:32:12" (1/1) ... [2018-01-25 05:32:12,628 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:32:12" (1/1) ... [2018-01-25 05:32:12,631 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:32:12" (1/1) ... [2018-01-25 05:32:12,634 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:32:12" (1/1) ... [2018-01-25 05:32:12,635 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:32:12" (1/1) ... [2018-01-25 05:32:12,636 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 05:32:12,637 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 05:32:12,637 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 05:32:12,637 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 05:32:12,638 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:32:12" (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-25 05:32:12,686 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 05:32:12,686 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 05:32:12,686 INFO L136 BoogieDeclarations]: Found implementation of procedure subseq [2018-01-25 05:32:12,686 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 05:32:12,686 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 05:32:12,686 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 05:32:12,687 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 05:32:12,687 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 05:32:12,687 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 05:32:12,687 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 05:32:12,687 INFO L128 BoogieDeclarations]: Found specification of procedure subseq [2018-01-25 05:32:12,687 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 05:32:12,687 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 05:32:12,687 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 05:32:12,926 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 05:32:12,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:32:12 BoogieIcfgContainer [2018-01-25 05:32:12,927 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 05:32:12,928 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 05:32:12,928 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 05:32:12,930 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 05:32:12,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 05:32:12" (1/3) ... [2018-01-25 05:32:12,931 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c65b9d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:32:12, skipping insertion in model container [2018-01-25 05:32:12,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:32:12" (2/3) ... [2018-01-25 05:32:12,931 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c65b9d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:32:12, skipping insertion in model container [2018-01-25 05:32:12,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:32:12" (3/3) ... [2018-01-25 05:32:12,933 INFO L105 eAbstractionObserver]: Analyzing ICFG subseq-alloca_true-valid-memsafety_true-termination.i [2018-01-25 05:32:12,940 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 05:32:12,946 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-25 05:32:12,989 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 05:32:12,989 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 05:32:12,989 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 05:32:12,989 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 05:32:12,989 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 05:32:12,989 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 05:32:12,989 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 05:32:12,990 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 05:32:12,990 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 05:32:13,011 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-01-25 05:32:13,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 05:32:13,016 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:32:13,017 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:32:13,017 INFO L371 AbstractCegarLoop]: === Iteration 1 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 05:32:13,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1068442526, now seen corresponding path program 1 times [2018-01-25 05:32:13,023 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:32:13,066 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:13,066 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:32:13,067 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:13,067 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:32:13,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:32:13,124 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:32:13,239 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-25 05:32:13,241 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:32:13,241 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:32:13,242 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:32:13,244 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:32:13,258 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:32:13,259 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:32:13,261 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 4 states. [2018-01-25 05:32:13,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:32:13,472 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2018-01-25 05:32:13,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:32:13,474 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-25 05:32:13,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:32:13,481 INFO L225 Difference]: With dead ends: 71 [2018-01-25 05:32:13,481 INFO L226 Difference]: Without dead ends: 51 [2018-01-25 05:32:13,485 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:32:13,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-25 05:32:13,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-25 05:32:13,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-25 05:32:13,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-01-25 05:32:13,519 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 13 [2018-01-25 05:32:13,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:32:13,519 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-01-25 05:32:13,519 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:32:13,519 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-01-25 05:32:13,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 05:32:13,520 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:32:13,520 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:32:13,520 INFO L371 AbstractCegarLoop]: === Iteration 2 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 05:32:13,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1068442527, now seen corresponding path program 1 times [2018-01-25 05:32:13,521 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:32:13,522 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:13,522 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:32:13,522 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:13,523 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:32:13,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:32:13,542 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:32:13,715 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-25 05:32:13,715 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:32:13,715 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:32:13,716 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:32:13,717 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:32:13,718 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:32:13,718 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:32:13,718 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 6 states. [2018-01-25 05:32:13,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:32:13,798 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-01-25 05:32:13,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:32:13,798 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-01-25 05:32:13,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:32:13,799 INFO L225 Difference]: With dead ends: 51 [2018-01-25 05:32:13,800 INFO L226 Difference]: Without dead ends: 50 [2018-01-25 05:32:13,801 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:32:13,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-25 05:32:13,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-01-25 05:32:13,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-25 05:32:13,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-01-25 05:32:13,807 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 13 [2018-01-25 05:32:13,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:32:13,807 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-01-25 05:32:13,807 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:32:13,807 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-01-25 05:32:13,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 05:32:13,808 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:32:13,808 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:32:13,808 INFO L371 AbstractCegarLoop]: === Iteration 3 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 05:32:13,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1238020018, now seen corresponding path program 1 times [2018-01-25 05:32:13,808 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:32:13,809 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:13,809 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:32:13,809 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:13,809 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:32:13,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:32:13,820 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:32:13,850 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-25 05:32:13,850 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:32:13,850 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:32:13,850 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:32:13,850 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:32:13,850 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:32:13,851 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:32:13,851 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 4 states. [2018-01-25 05:32:13,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:32:13,903 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-01-25 05:32:13,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:32:13,904 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-25 05:32:13,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:32:13,905 INFO L225 Difference]: With dead ends: 50 [2018-01-25 05:32:13,905 INFO L226 Difference]: Without dead ends: 49 [2018-01-25 05:32:13,905 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:32:13,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-25 05:32:13,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-25 05:32:13,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-25 05:32:13,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-01-25 05:32:13,913 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 14 [2018-01-25 05:32:13,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:32:13,913 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-01-25 05:32:13,913 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:32:13,913 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-01-25 05:32:13,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 05:32:13,914 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:32:13,914 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:32:13,914 INFO L371 AbstractCegarLoop]: === Iteration 4 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 05:32:13,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1238020017, now seen corresponding path program 1 times [2018-01-25 05:32:13,915 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:32:13,916 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:13,916 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:32:13,916 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:13,916 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:32:13,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:32:13,930 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:32:13,988 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-25 05:32:13,988 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:32:13,989 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:32:13,989 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:32:13,989 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:32:13,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:32:13,990 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:32:13,990 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 5 states. [2018-01-25 05:32:14,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:32:14,028 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-01-25 05:32:14,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:32:14,028 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-25 05:32:14,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:32:14,029 INFO L225 Difference]: With dead ends: 49 [2018-01-25 05:32:14,029 INFO L226 Difference]: Without dead ends: 48 [2018-01-25 05:32:14,029 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:32:14,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-25 05:32:14,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-25 05:32:14,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-25 05:32:14,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2018-01-25 05:32:14,034 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 14 [2018-01-25 05:32:14,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:32:14,034 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2018-01-25 05:32:14,034 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:32:14,034 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-01-25 05:32:14,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 05:32:14,034 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:32:14,034 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:32:14,035 INFO L371 AbstractCegarLoop]: === Iteration 5 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 05:32:14,035 INFO L82 PathProgramCache]: Analyzing trace with hash -9248999, now seen corresponding path program 1 times [2018-01-25 05:32:14,035 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:32:14,035 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:14,036 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:32:14,036 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:14,036 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:32:14,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:32:14,046 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:32:14,077 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-25 05:32:14,077 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:32:14,077 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:32:14,077 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:32:14,078 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:32:14,078 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:32:14,078 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:32:14,078 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 5 states. [2018-01-25 05:32:14,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:32:14,139 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-01-25 05:32:14,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:32:14,140 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-25 05:32:14,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:32:14,141 INFO L225 Difference]: With dead ends: 48 [2018-01-25 05:32:14,141 INFO L226 Difference]: Without dead ends: 46 [2018-01-25 05:32:14,141 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:32:14,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-25 05:32:14,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-01-25 05:32:14,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-25 05:32:14,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2018-01-25 05:32:14,148 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 18 [2018-01-25 05:32:14,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:32:14,148 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2018-01-25 05:32:14,148 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:32:14,149 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2018-01-25 05:32:14,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 05:32:14,149 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:32:14,149 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:32:14,150 INFO L371 AbstractCegarLoop]: === Iteration 6 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 05:32:14,150 INFO L82 PathProgramCache]: Analyzing trace with hash -9248998, now seen corresponding path program 1 times [2018-01-25 05:32:14,150 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:32:14,151 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:14,151 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:32:14,151 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:14,151 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:32:14,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:32:14,165 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:32:14,250 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-25 05:32:14,250 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:32:14,251 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 05:32:14,251 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:32:14,251 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 05:32:14,251 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 05:32:14,251 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:32:14,252 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand 8 states. [2018-01-25 05:32:14,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:32:14,371 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2018-01-25 05:32:14,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 05:32:14,371 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-01-25 05:32:14,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:32:14,375 INFO L225 Difference]: With dead ends: 69 [2018-01-25 05:32:14,375 INFO L226 Difference]: Without dead ends: 67 [2018-01-25 05:32:14,376 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-01-25 05:32:14,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-25 05:32:14,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 57. [2018-01-25 05:32:14,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-25 05:32:14,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2018-01-25 05:32:14,381 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 18 [2018-01-25 05:32:14,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:32:14,382 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2018-01-25 05:32:14,382 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 05:32:14,382 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2018-01-25 05:32:14,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-25 05:32:14,382 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:32:14,382 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] [2018-01-25 05:32:14,383 INFO L371 AbstractCegarLoop]: === Iteration 7 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 05:32:14,383 INFO L82 PathProgramCache]: Analyzing trace with hash -659041035, now seen corresponding path program 1 times [2018-01-25 05:32:14,383 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:32:14,383 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:14,383 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:32:14,384 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:14,384 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:32:14,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:32:14,393 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:32:14,432 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-25 05:32:14,432 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:32:14,432 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:32:14,432 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:32:14,433 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:32:14,433 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:32:14,433 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:32:14,433 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand 5 states. [2018-01-25 05:32:14,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:32:14,507 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2018-01-25 05:32:14,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:32:14,507 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-01-25 05:32:14,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:32:14,509 INFO L225 Difference]: With dead ends: 57 [2018-01-25 05:32:14,509 INFO L226 Difference]: Without dead ends: 54 [2018-01-25 05:32:14,509 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:32:14,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-25 05:32:14,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-25 05:32:14,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-25 05:32:14,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2018-01-25 05:32:14,516 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 21 [2018-01-25 05:32:14,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:32:14,517 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2018-01-25 05:32:14,517 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:32:14,518 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2018-01-25 05:32:14,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-25 05:32:14,519 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:32:14,519 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] [2018-01-25 05:32:14,519 INFO L371 AbstractCegarLoop]: === Iteration 8 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 05:32:14,519 INFO L82 PathProgramCache]: Analyzing trace with hash -659041034, now seen corresponding path program 1 times [2018-01-25 05:32:14,519 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:32:14,525 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:14,525 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:32:14,525 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:14,525 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:32:14,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:32:14,536 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:32:14,634 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-25 05:32:14,635 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:32:14,635 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 05:32:14,635 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:32:14,635 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 05:32:14,635 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 05:32:14,636 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:32:14,636 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand 8 states. [2018-01-25 05:32:14,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:32:14,764 INFO L93 Difference]: Finished difference Result 73 states and 87 transitions. [2018-01-25 05:32:14,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 05:32:14,765 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-01-25 05:32:14,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:32:14,766 INFO L225 Difference]: With dead ends: 73 [2018-01-25 05:32:14,766 INFO L226 Difference]: Without dead ends: 70 [2018-01-25 05:32:14,766 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-25 05:32:14,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-25 05:32:14,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 64. [2018-01-25 05:32:14,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-25 05:32:14,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2018-01-25 05:32:14,775 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 76 transitions. Word has length 21 [2018-01-25 05:32:14,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:32:14,775 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 76 transitions. [2018-01-25 05:32:14,775 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 05:32:14,775 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2018-01-25 05:32:14,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 05:32:14,776 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:32:14,777 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:32:14,777 INFO L371 AbstractCegarLoop]: === Iteration 9 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 05:32:14,777 INFO L82 PathProgramCache]: Analyzing trace with hash 753859844, now seen corresponding path program 1 times [2018-01-25 05:32:14,778 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:32:14,778 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:14,778 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:32:14,779 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:14,779 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:32:14,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:32:14,790 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:32:14,809 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:32:14,810 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:32:14,810 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:32:14,810 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:32:14,810 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 05:32:14,811 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 05:32:14,811 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:32:14,811 INFO L87 Difference]: Start difference. First operand 64 states and 76 transitions. Second operand 3 states. [2018-01-25 05:32:14,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:32:14,818 INFO L93 Difference]: Finished difference Result 107 states and 130 transitions. [2018-01-25 05:32:14,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 05:32:14,819 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-01-25 05:32:14,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:32:14,821 INFO L225 Difference]: With dead ends: 107 [2018-01-25 05:32:14,821 INFO L226 Difference]: Without dead ends: 67 [2018-01-25 05:32:14,821 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-25 05:32:14,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-25 05:32:14,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-01-25 05:32:14,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-25 05:32:14,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2018-01-25 05:32:14,826 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 27 [2018-01-25 05:32:14,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:32:14,827 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2018-01-25 05:32:14,827 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 05:32:14,827 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2018-01-25 05:32:14,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-25 05:32:14,827 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:32:14,827 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:32:14,828 INFO L371 AbstractCegarLoop]: === Iteration 10 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 05:32:14,828 INFO L82 PathProgramCache]: Analyzing trace with hash 199156551, now seen corresponding path program 1 times [2018-01-25 05:32:14,828 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:32:14,828 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:14,829 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:32:14,829 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:14,829 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:32:14,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:32:14,846 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:32:15,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:32:15,293 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:32:15,293 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-01-25 05:32:15,294 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:32:15,294 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-25 05:32:15,294 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-25 05:32:15,294 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-01-25 05:32:15,294 INFO L87 Difference]: Start difference. First operand 66 states and 78 transitions. Second operand 15 states. [2018-01-25 05:32:15,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:32:15,717 INFO L93 Difference]: Finished difference Result 140 states and 161 transitions. [2018-01-25 05:32:15,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-25 05:32:15,717 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2018-01-25 05:32:15,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:32:15,718 INFO L225 Difference]: With dead ends: 140 [2018-01-25 05:32:15,718 INFO L226 Difference]: Without dead ends: 112 [2018-01-25 05:32:15,718 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=136, Invalid=620, Unknown=0, NotChecked=0, Total=756 [2018-01-25 05:32:15,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-25 05:32:15,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 102. [2018-01-25 05:32:15,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-01-25 05:32:15,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 123 transitions. [2018-01-25 05:32:15,726 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 123 transitions. Word has length 29 [2018-01-25 05:32:15,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:32:15,726 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 123 transitions. [2018-01-25 05:32:15,726 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-25 05:32:15,726 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 123 transitions. [2018-01-25 05:32:15,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-25 05:32:15,727 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:32:15,727 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:32:15,727 INFO L371 AbstractCegarLoop]: === Iteration 11 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 05:32:15,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1606281783, now seen corresponding path program 1 times [2018-01-25 05:32:15,728 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:32:15,728 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:15,728 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:32:15,729 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:15,729 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:32:15,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:32:15,745 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:32:16,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:32:16,199 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:32:16,199 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:32:16,200 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-01-25 05:32:16,201 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [8], [10], [11], [14], [15], [18], [26], [27], [30], [35], [39], [54], [59], [65], [67], [68], [69], [70], [71], [74], [85], [86], [87], [89] [2018-01-25 05:32:16,248 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:32:16,248 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:32:17,719 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:32:17,721 INFO L268 AbstractInterpreter]: Visited 28 different actions 56 times. Merged at 12 different actions 27 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 31 variables. [2018-01-25 05:32:17,734 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:32:17,734 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:32:17,734 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-25 05:32:17,755 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:32:17,756 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:32:17,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:32:17,791 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:32:17,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 05:32:17,823 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:17,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:17,855 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 05:32:18,028 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:32:18,029 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:32:18,029 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-25 05:32:18,030 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:18,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:18,033 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-25 05:32:18,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 14 treesize of output 11 [2018-01-25 05:32:18,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-25 05:32:18,082 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:18,083 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:18,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-25 05:32:18,091 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-01-25 05:32:18,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-01-25 05:32:18,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-25 05:32:18,132 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:18,138 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:18,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-25 05:32:18,147 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-01-25 05:32:19,224 WARN L143 SmtUtils]: Spent 708ms on a formula simplification that was a NOOP. DAG size: 43 [2018-01-25 05:32:19,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 53 [2018-01-25 05:32:19,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 47 [2018-01-25 05:32:19,395 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-01-25 05:32:19,528 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 31 treesize of output 23 [2018-01-25 05:32:19,528 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:19,531 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 35 treesize of output 27 [2018-01-25 05:32:19,531 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:19,534 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 34 treesize of output 26 [2018-01-25 05:32:19,534 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:19,596 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 41 treesize of output 34 [2018-01-25 05:32:19,597 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:19,672 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-01-25 05:32:19,673 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:19,748 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 34 treesize of output 26 [2018-01-25 05:32:19,749 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:19,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 27 [2018-01-25 05:32:19,803 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-01-25 05:32:19,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 24 [2018-01-25 05:32:19,895 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-01-25 05:32:19,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-01-25 05:32:20,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-25 05:32:20,024 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 8 variables, input treesize:63, output treesize:66 [2018-01-25 05:32:20,076 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:32:20,077 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:32:20,595 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 15 treesize of output 11 [2018-01-25 05:32:20,595 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:20,645 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 26 treesize of output 28 [2018-01-25 05:32:20,688 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 24 treesize of output 16 [2018-01-25 05:32:20,689 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:20,700 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 21 treesize of output 15 [2018-01-25 05:32:20,700 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:20,706 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:20,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:20,715 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:69, output treesize:7 [2018-01-25 05:32:20,752 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:32:20,774 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:32:20,774 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:32:20,778 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:32:20,779 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:32:20,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:32:20,831 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:32:20,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 05:32:20,834 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:20,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 05:32:20,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:20,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:20,844 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-25 05:32:20,911 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:32:20,912 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:32:20,912 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-25 05:32:20,912 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:20,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 15 [2018-01-25 05:32:20,920 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:20,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:20,924 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-25 05:32:21,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 16 treesize of output 13 [2018-01-25 05:32:21,005 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 13 treesize of output 12 [2018-01-25 05:32:21,005 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:21,007 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:21,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:21,013 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-01-25 05:32:21,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-01-25 05:32:21,057 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 13 treesize of output 12 [2018-01-25 05:32:21,057 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:21,061 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:21,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-25 05:32:21,066 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2018-01-25 05:32:21,211 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 31 treesize of output 29 [2018-01-25 05:32:21,213 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 10 treesize of output 1 [2018-01-25 05:32:21,214 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:21,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 16 [2018-01-25 05:32:21,236 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-25 05:32:21,241 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:32:21,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:32:21,249 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:48, output treesize:34 [2018-01-25 05:32:21,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:32:21,468 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:32:21,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-25 05:32:21,834 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 5 treesize of output 3 [2018-01-25 05:32:21,835 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:21,836 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:21,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:21,842 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:21 [2018-01-25 05:32:22,012 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:32:22,014 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:32:22,014 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 13, 13, 11] total 61 [2018-01-25 05:32:22,014 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:32:22,015 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-25 05:32:22,015 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-25 05:32:22,016 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=3511, Unknown=0, NotChecked=0, Total=3782 [2018-01-25 05:32:22,016 INFO L87 Difference]: Start difference. First operand 102 states and 123 transitions. Second operand 30 states. [2018-01-25 05:32:24,233 WARN L146 SmtUtils]: Spent 1441ms on a formula simplification. DAG size of input: 76 DAG size of output 57 [2018-01-25 05:32:26,811 WARN L146 SmtUtils]: Spent 1617ms on a formula simplification. DAG size of input: 69 DAG size of output 57 [2018-01-25 05:32:30,316 WARN L146 SmtUtils]: Spent 2384ms on a formula simplification. DAG size of input: 59 DAG size of output 56 [2018-01-25 05:32:30,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:32:30,498 INFO L93 Difference]: Finished difference Result 129 states and 155 transitions. [2018-01-25 05:32:30,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-01-25 05:32:30,499 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 29 [2018-01-25 05:32:30,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:32:30,500 INFO L225 Difference]: With dead ends: 129 [2018-01-25 05:32:30,500 INFO L226 Difference]: Without dead ends: 127 [2018-01-25 05:32:30,502 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 66 SyntacticMatches, 4 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2042 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=764, Invalid=7068, Unknown=0, NotChecked=0, Total=7832 [2018-01-25 05:32:30,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-01-25 05:32:30,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 89. [2018-01-25 05:32:30,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-25 05:32:30,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 105 transitions. [2018-01-25 05:32:30,513 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 105 transitions. Word has length 29 [2018-01-25 05:32:30,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:32:30,514 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 105 transitions. [2018-01-25 05:32:30,514 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-25 05:32:30,514 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 105 transitions. [2018-01-25 05:32:30,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-25 05:32:30,515 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:32:30,515 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] [2018-01-25 05:32:30,515 INFO L371 AbstractCegarLoop]: === Iteration 12 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 05:32:30,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1713594616, now seen corresponding path program 1 times [2018-01-25 05:32:30,516 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:32:30,517 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:30,517 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:32:30,517 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:30,517 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:32:30,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:32:30,532 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:32:30,634 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-25 05:32:30,634 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:32:30,634 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:32:30,634 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:32:30,635 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:32:30,635 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:32:30,635 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:32:30,636 INFO L87 Difference]: Start difference. First operand 89 states and 105 transitions. Second operand 6 states. [2018-01-25 05:32:30,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:32:30,788 INFO L93 Difference]: Finished difference Result 89 states and 105 transitions. [2018-01-25 05:32:30,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 05:32:30,788 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-01-25 05:32:30,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:32:30,789 INFO L225 Difference]: With dead ends: 89 [2018-01-25 05:32:30,789 INFO L226 Difference]: Without dead ends: 72 [2018-01-25 05:32:30,789 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:32:30,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-01-25 05:32:30,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2018-01-25 05:32:30,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-25 05:32:30,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2018-01-25 05:32:30,797 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 31 [2018-01-25 05:32:30,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:32:30,798 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2018-01-25 05:32:30,798 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:32:30,798 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2018-01-25 05:32:30,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-25 05:32:30,799 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:32:30,800 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:32:30,800 INFO L371 AbstractCegarLoop]: === Iteration 13 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 05:32:30,800 INFO L82 PathProgramCache]: Analyzing trace with hash -797033429, now seen corresponding path program 1 times [2018-01-25 05:32:30,800 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:32:30,801 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:30,801 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:32:30,801 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:30,801 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:32:30,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:32:30,815 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:32:30,995 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:32:30,996 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:32:30,996 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:32:30,996 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-01-25 05:32:30,996 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [8], [11], [14], [15], [17], [18], [26], [27], [30], [37], [39], [54], [57], [65], [67], [68], [69], [70], [71], [74], [85], [86], [87], [89] [2018-01-25 05:32:30,998 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:32:30,998 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:32:33,293 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:32:33,293 INFO L268 AbstractInterpreter]: Visited 28 different actions 55 times. Merged at 12 different actions 27 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 29 variables. [2018-01-25 05:32:33,310 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:32:33,310 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:32:33,310 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-25 05:32:33,319 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:32:33,319 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:32:33,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:32:33,351 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:32:33,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 05:32:33,369 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:33,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:33,373 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 05:32:33,436 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:32:33,437 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:32:33,438 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-25 05:32:33,438 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:33,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:33,442 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-25 05:32:33,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-01-25 05:32:33,523 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-25 05:32:33,524 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:33,526 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:33,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:33,530 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-01-25 05:32:33,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2018-01-25 05:32:33,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-25 05:32:33,564 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:33,585 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:33,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-25 05:32:33,591 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:26, output treesize:22 [2018-01-25 05:32:33,701 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 25 treesize of output 23 [2018-01-25 05:32:33,703 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 8 treesize of output 1 [2018-01-25 05:32:33,704 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:33,710 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-25 05:32:33,710 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:33,712 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:33,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:33,722 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:29, output treesize:3 [2018-01-25 05:32:33,773 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-25 05:32:33,774 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:32:33,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-25 05:32:33,944 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 5 treesize of output 3 [2018-01-25 05:32:33,944 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:33,945 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:33,946 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-25 05:32:33,946 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:3 [2018-01-25 05:32:33,985 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-25 05:32:34,005 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-25 05:32:34,005 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13, 9] imperfect sequences [11] total 27 [2018-01-25 05:32:34,005 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:32:34,006 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-25 05:32:34,006 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-25 05:32:34,006 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=632, Unknown=0, NotChecked=0, Total=702 [2018-01-25 05:32:34,006 INFO L87 Difference]: Start difference. First operand 70 states and 79 transitions. Second operand 13 states. [2018-01-25 05:32:37,632 WARN L143 SmtUtils]: Spent 3479ms on a formula simplification that was a NOOP. DAG size: 29 [2018-01-25 05:32:41,544 WARN L143 SmtUtils]: Spent 3894ms on a formula simplification that was a NOOP. DAG size: 31 [2018-01-25 05:32:45,569 WARN L143 SmtUtils]: Spent 4009ms on a formula simplification that was a NOOP. DAG size: 33 [2018-01-25 05:32:45,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:32:45,587 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2018-01-25 05:32:45,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-25 05:32:45,588 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2018-01-25 05:32:45,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:32:45,588 INFO L225 Difference]: With dead ends: 75 [2018-01-25 05:32:45,588 INFO L226 Difference]: Without dead ends: 41 [2018-01-25 05:32:45,589 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=146, Invalid=1044, Unknown=0, NotChecked=0, Total=1190 [2018-01-25 05:32:45,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-25 05:32:45,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-01-25 05:32:45,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-25 05:32:45,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-01-25 05:32:45,592 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 32 [2018-01-25 05:32:45,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:32:45,592 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-01-25 05:32:45,592 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-25 05:32:45,592 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-01-25 05:32:45,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-25 05:32:45,593 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:32:45,593 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:32:45,593 INFO L371 AbstractCegarLoop]: === Iteration 14 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 05:32:45,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1784966119, now seen corresponding path program 1 times [2018-01-25 05:32:45,593 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:32:45,594 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:45,594 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:32:45,594 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:45,594 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:32:45,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:32:45,606 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:32:45,864 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:32:45,864 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:32:45,865 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:32:45,865 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-01-25 05:32:45,865 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [8], [11], [14], [15], [17], [18], [26], [27], [30], [35], [39], [54], [59], [65], [67], [68], [69], [70], [71], [74], [85], [86], [87], [89] [2018-01-25 05:32:45,867 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:32:45,867 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:32:46,896 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:32:46,896 INFO L268 AbstractInterpreter]: Visited 28 different actions 55 times. Merged at 12 different actions 27 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 31 variables. [2018-01-25 05:32:46,913 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:32:46,913 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:32:46,913 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-25 05:32:46,924 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:32:46,925 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:32:46,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:32:46,949 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:32:46,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-25 05:32:46,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-25 05:32:46,960 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:46,963 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:46,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-25 05:32:46,969 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-25 05:32:47,049 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 18 treesize of output 14 [2018-01-25 05:32:47,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-01-25 05:32:47,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 05:32:47,072 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:32:47,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:32:47,086 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-01-25 05:32:47,200 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:32:47,200 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:32:47,364 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 12 [2018-01-25 05:32:47,364 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:47,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-25 05:32:47,377 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-25 05:32:47,377 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:47,378 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:47,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:47,383 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-01-25 05:32:47,387 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:32:47,407 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:32:47,407 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:32:47,410 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:32:47,410 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:32:47,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:32:47,471 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:32:47,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 05:32:47,474 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:47,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:47,478 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-25 05:32:47,523 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 16 treesize of output 13 [2018-01-25 05:32:47,524 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 13 treesize of output 12 [2018-01-25 05:32:47,524 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:47,526 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:47,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:47,530 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-25 05:32:47,745 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 34 treesize of output 34 [2018-01-25 05:32:47,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2018-01-25 05:32:47,751 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 05:32:47,770 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 24 treesize of output 17 [2018-01-25 05:32:47,770 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:47,771 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 19 treesize of output 12 [2018-01-25 05:32:47,771 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:47,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 36 [2018-01-25 05:32:47,796 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-01-25 05:32:47,825 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-01-25 05:32:47,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-25 05:32:47,855 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:42, output treesize:62 [2018-01-25 05:32:47,970 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:32:47,970 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:32:48,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-25 05:32:48,226 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 5 treesize of output 3 [2018-01-25 05:32:48,226 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:48,227 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:48,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:48,231 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-01-25 05:32:48,292 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:32:48,293 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:32:48,294 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9, 14, 15] total 45 [2018-01-25 05:32:48,294 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:32:48,294 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-25 05:32:48,294 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-25 05:32:48,295 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1862, Unknown=0, NotChecked=0, Total=2070 [2018-01-25 05:32:48,295 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 18 states. [2018-01-25 05:32:49,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:32:49,240 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2018-01-25 05:32:49,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-25 05:32:49,241 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2018-01-25 05:32:49,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:32:49,241 INFO L225 Difference]: With dead ends: 59 [2018-01-25 05:32:49,241 INFO L226 Difference]: Without dead ends: 54 [2018-01-25 05:32:49,242 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 87 SyntacticMatches, 6 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 795 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=327, Invalid=2643, Unknown=0, NotChecked=0, Total=2970 [2018-01-25 05:32:49,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-25 05:32:49,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-01-25 05:32:49,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-25 05:32:49,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-01-25 05:32:49,247 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 32 [2018-01-25 05:32:49,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:32:49,247 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-01-25 05:32:49,247 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-25 05:32:49,247 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-01-25 05:32:49,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-25 05:32:49,248 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:32:49,248 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:32:49,248 INFO L371 AbstractCegarLoop]: === Iteration 15 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 05:32:49,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1498931688, now seen corresponding path program 2 times [2018-01-25 05:32:49,248 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:32:49,249 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:49,249 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:32:49,249 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:49,249 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:32:49,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:32:49,264 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:32:49,742 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:32:49,742 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:32:49,742 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:32:49,742 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:32:49,743 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 05:32:49,743 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:32:49,743 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:32:49,748 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:32:49,748 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:32:49,761 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:32:49,768 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:32:49,772 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:32:49,775 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:32:49,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 05:32:49,778 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:49,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:49,780 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 05:32:49,815 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 16 treesize of output 13 [2018-01-25 05:32:49,817 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 13 treesize of output 12 [2018-01-25 05:32:49,818 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:49,821 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:49,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:49,825 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-01-25 05:32:50,091 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 35 treesize of output 35 [2018-01-25 05:32:50,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2018-01-25 05:32:50,097 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 05:32:50,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 35 [2018-01-25 05:32:50,124 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-01-25 05:32:50,164 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 19 treesize of output 12 [2018-01-25 05:32:50,164 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:50,166 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 25 treesize of output 18 [2018-01-25 05:32:50,166 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:50,198 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-01-25 05:32:50,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-25 05:32:50,231 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:53, output treesize:98 [2018-01-25 05:32:50,282 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:32:50,282 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:32:50,919 WARN L146 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 69 DAG size of output 57 [2018-01-25 05:32:50,926 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 57 treesize of output 59 [2018-01-25 05:32:50,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2018-01-25 05:32:50,995 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:51,024 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:51,027 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 53 treesize of output 47 [2018-01-25 05:32:51,053 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 7 [2018-01-25 05:32:51,053 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:51,064 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 5 treesize of output 3 [2018-01-25 05:32:51,065 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:51,072 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:51,124 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 55 treesize of output 49 [2018-01-25 05:32:51,152 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 21 treesize of output 13 [2018-01-25 05:32:51,152 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:51,164 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-25 05:32:51,165 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:51,172 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:51,178 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 59 treesize of output 61 [2018-01-25 05:32:51,250 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 57 treesize of output 49 [2018-01-25 05:32:51,251 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:51,280 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2018-01-25 05:32:51,280 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:51,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-01-25 05:32:51,311 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:51,336 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:51,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:32:51,378 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:149, output treesize:98 [2018-01-25 05:32:51,602 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:32:51,636 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:32:51,636 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:32:51,640 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:32:51,640 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:32:51,670 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:32:51,733 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:32:51,792 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:32:51,798 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:32:51,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 05:32:51,811 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:51,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:51,814 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 05:32:51,868 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 15 treesize of output 12 [2018-01-25 05:32:51,873 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 12 treesize of output 11 [2018-01-25 05:32:51,873 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:51,875 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:51,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:51,876 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-25 05:32:52,264 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 34 treesize of output 34 [2018-01-25 05:32:52,267 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2018-01-25 05:32:52,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:52,280 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 22 treesize of output 17 [2018-01-25 05:32:52,281 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:52,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 33 [2018-01-25 05:32:52,302 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-01-25 05:32:52,327 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-01-25 05:32:52,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-25 05:32:52,353 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:44, output treesize:76 [2018-01-25 05:32:52,414 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:32:52,414 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:32:52,903 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 26 treesize of output 28 [2018-01-25 05:32:52,929 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 21 treesize of output 15 [2018-01-25 05:32:52,930 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:52,935 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:52,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:32:52,943 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:65, output treesize:35 [2018-01-25 05:32:53,051 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:32:53,053 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:32:53,054 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14, 15, 15] total 59 [2018-01-25 05:32:53,054 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:32:53,054 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-25 05:32:53,054 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-25 05:32:53,055 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=3187, Unknown=0, NotChecked=0, Total=3540 [2018-01-25 05:32:53,055 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 27 states. [2018-01-25 05:32:53,659 WARN L146 SmtUtils]: Spent 142ms on a formula simplification. DAG size of input: 67 DAG size of output 51 [2018-01-25 05:32:55,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:32:55,410 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2018-01-25 05:32:55,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-01-25 05:32:55,431 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 43 [2018-01-25 05:32:55,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:32:55,431 INFO L225 Difference]: With dead ends: 74 [2018-01-25 05:32:55,431 INFO L226 Difference]: Without dead ends: 66 [2018-01-25 05:32:55,433 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 124 SyntacticMatches, 3 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 1843 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1141, Invalid=6869, Unknown=0, NotChecked=0, Total=8010 [2018-01-25 05:32:55,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-25 05:32:55,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 51. [2018-01-25 05:32:55,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-25 05:32:55,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2018-01-25 05:32:55,438 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 43 [2018-01-25 05:32:55,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:32:55,438 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2018-01-25 05:32:55,438 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-25 05:32:55,438 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2018-01-25 05:32:55,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-25 05:32:55,439 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:32:55,439 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2018-01-25 05:32:55,439 INFO L371 AbstractCegarLoop]: === Iteration 16 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 05:32:55,440 INFO L82 PathProgramCache]: Analyzing trace with hash 276075674, now seen corresponding path program 1 times [2018-01-25 05:32:55,440 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:32:55,440 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:55,441 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 05:32:55,441 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:55,441 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:32:55,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:32:55,454 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:32:55,707 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:32:55,707 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:32:55,707 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:32:55,707 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 44 with the following transitions: [2018-01-25 05:32:55,707 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [8], [11], [14], [15], [17], [18], [26], [27], [30], [35], [37], [39], [54], [59], [65], [67], [68], [69], [70], [71], [74], [85], [86], [87], [89] [2018-01-25 05:32:55,709 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:32:55,709 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:32:56,637 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:32:56,638 INFO L268 AbstractInterpreter]: Visited 29 different actions 56 times. Merged at 13 different actions 25 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 31 variables. [2018-01-25 05:32:56,639 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:32:56,639 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:32:56,639 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:32:56,653 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:32:56,653 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:32:56,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:32:56,682 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:32:56,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 05:32:56,686 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:56,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:56,690 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 05:32:56,712 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 15 treesize of output 12 [2018-01-25 05:32:56,714 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 12 treesize of output 11 [2018-01-25 05:32:56,715 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:56,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:56,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:56,718 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-25 05:32:56,790 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 19 treesize of output 15 [2018-01-25 05:32:56,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-25 05:32:56,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 05:32:56,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:32:56,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:32:56,803 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2018-01-25 05:32:56,871 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:32:56,871 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:32:57,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-25 05:32:57,107 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-25 05:32:57,108 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:57,109 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:57,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:32:57,113 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:35 [2018-01-25 05:32:57,186 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:32:57,206 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:32:57,206 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:32:57,209 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:32:57,209 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:32:57,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:32:57,277 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:32:57,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 05:32:57,280 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:57,283 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:57,283 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 05:32:57,287 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 16 treesize of output 13 [2018-01-25 05:32:57,288 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 13 treesize of output 12 [2018-01-25 05:32:57,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:57,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:57,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:57,292 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-01-25 05:32:57,359 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 19 treesize of output 15 [2018-01-25 05:32:57,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-25 05:32:57,364 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 05:32:57,366 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:32:57,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:32:57,371 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:34 [2018-01-25 05:32:57,385 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:32:57,385 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:32:57,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-25 05:32:57,541 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-25 05:32:57,542 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:57,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:57,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:32:57,548 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:52 [2018-01-25 05:32:57,634 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:32:57,635 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:32:57,635 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12, 11, 11] total 39 [2018-01-25 05:32:57,635 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:32:57,636 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-25 05:32:57,636 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-25 05:32:57,636 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1413, Unknown=0, NotChecked=0, Total=1560 [2018-01-25 05:32:57,636 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand 20 states. [2018-01-25 05:32:58,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:32:58,208 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2018-01-25 05:32:58,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-25 05:32:58,209 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 43 [2018-01-25 05:32:58,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:32:58,209 INFO L225 Difference]: With dead ends: 64 [2018-01-25 05:32:58,209 INFO L226 Difference]: Without dead ends: 0 [2018-01-25 05:32:58,210 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 139 SyntacticMatches, 5 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=370, Invalid=2180, Unknown=0, NotChecked=0, Total=2550 [2018-01-25 05:32:58,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-25 05:32:58,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-25 05:32:58,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-25 05:32:58,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-25 05:32:58,211 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2018-01-25 05:32:58,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:32:58,211 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-25 05:32:58,211 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-25 05:32:58,211 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-25 05:32:58,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-25 05:32:58,214 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-25 05:32:59,312 WARN L146 SmtUtils]: Spent 979ms on a formula simplification. DAG size of input: 172 DAG size of output 125 [2018-01-25 05:32:59,565 WARN L146 SmtUtils]: Spent 223ms on a formula simplification. DAG size of input: 98 DAG size of output 71 [2018-01-25 05:32:59,569 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 567) no Hoare annotation was computed. [2018-01-25 05:32:59,569 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 567) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 05:32:59,569 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 567) no Hoare annotation was computed. [2018-01-25 05:32:59,569 INFO L401 ceAbstractionStarter]: For program point L544'''(line 544) no Hoare annotation was computed. [2018-01-25 05:32:59,569 INFO L401 ceAbstractionStarter]: For program point subseqErr5RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-25 05:32:59,569 INFO L401 ceAbstractionStarter]: For program point L544'''''''''(lines 544 549) no Hoare annotation was computed. [2018-01-25 05:32:59,570 INFO L401 ceAbstractionStarter]: For program point subseqErr0RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-25 05:32:59,570 INFO L401 ceAbstractionStarter]: For program point L544''''(line 544) no Hoare annotation was computed. [2018-01-25 05:32:59,570 INFO L401 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-01-25 05:32:59,570 INFO L401 ceAbstractionStarter]: For program point L544(lines 544 549) no Hoare annotation was computed. [2018-01-25 05:32:59,570 INFO L401 ceAbstractionStarter]: For program point subseqErr1RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-25 05:32:59,570 INFO L404 ceAbstractionStarter]: At program point subseqENTRY(lines 540 552) the Hoare annotation is: true [2018-01-25 05:32:59,570 INFO L401 ceAbstractionStarter]: For program point subseqErr9RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-25 05:32:59,570 INFO L401 ceAbstractionStarter]: For program point L545''''(lines 545 547) no Hoare annotation was computed. [2018-01-25 05:32:59,570 INFO L401 ceAbstractionStarter]: For program point L544'(line 544) no Hoare annotation was computed. [2018-01-25 05:32:59,570 INFO L401 ceAbstractionStarter]: For program point subseqErr8RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-25 05:32:59,570 INFO L401 ceAbstractionStarter]: For program point subseqFINAL(lines 540 552) no Hoare annotation was computed. [2018-01-25 05:32:59,570 INFO L401 ceAbstractionStarter]: For program point subseqErr4RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-25 05:32:59,571 INFO L397 ceAbstractionStarter]: At program point L544''''''''(lines 544 549) the Hoare annotation is: (let ((.cse0 (not (= 1 (select |#valid| |subseq_#in~s.base|)))) (.cse6 (not (= 0 |subseq_#in~s.offset|))) (.cse7 (not (exists ((main_~length2~5 Int) (main_~nondetString2~5.base Int) (main_~nondetString2~5.offset Int)) (and (= 0 (select (select |#memory_int| main_~nondetString2~5.base) (+ main_~length2~5 main_~nondetString2~5.offset (- 1)))) (not (= |subseq_#in~s.base| main_~nondetString2~5.base)))))) (.cse8 (not (= 0 |subseq_#in~t.offset|))) (.cse4 (select |#length| subseq_~pt~2.base)) (.cse2 (= 1 (select |#valid| subseq_~pt~2.base))) (.cse3 (= subseq_~ps~2.offset 0)) (.cse5 (= 1 (select |#valid| subseq_~ps~2.base))) (.cse1 (not (= 1 (select |#valid| |subseq_#in~t.base|)))) (.cse9 (not (exists ((main_~length1~5 Int) (v_main_~nondetString1~5.offset_BEFORE_CALL_2 Int)) (and (<= |subseq_#in~s.offset| v_main_~nondetString1~5.offset_BEFORE_CALL_2) (<= 1 main_~length1~5) (<= (+ main_~length1~5 v_main_~nondetString1~5.offset_BEFORE_CALL_2) (select |#length| |subseq_#in~s.base|)) (= 0 (select (select |#memory_int| |subseq_#in~s.base|) (+ main_~length1~5 v_main_~nondetString1~5.offset_BEFORE_CALL_2 (- 1))))))))) (and (or .cse0 .cse1 (and .cse2 (= subseq_~pt~2.offset 0) (= 0 (select (select |#memory_int| subseq_~ps~2.base) subseq_~ps~2.offset)) .cse3 (<= 1 .cse4) (<= 1 (select |#length| subseq_~ps~2.base)) .cse5) .cse6 .cse7 (< (select |#length| |subseq_#in~t.base|) 1) .cse8 (not (= 0 (select (select |#memory_int| |subseq_#in~s.base|) |subseq_#in~s.offset|))) .cse9) (let ((.cse10 (exists ((main_~length1~5 Int) (v_main_~nondetString1~5.offset_BEFORE_CALL_2 Int)) (and (= 0 (select (select |#memory_int| subseq_~ps~2.base) (+ main_~length1~5 v_main_~nondetString1~5.offset_BEFORE_CALL_2 (- 1)))) (<= subseq_~ps~2.offset v_main_~nondetString1~5.offset_BEFORE_CALL_2) (<= 1 main_~length1~5) (<= (+ main_~length1~5 v_main_~nondetString1~5.offset_BEFORE_CALL_2) (select |#length| subseq_~ps~2.base)))))) (or .cse0 .cse6 .cse7 .cse8 (and (and (<= (+ subseq_~pt~2.offset 1) .cse4) (<= 1 subseq_~pt~2.offset) (and .cse2 (<= 1 subseq_~ps~2.offset) .cse10 .cse5)) (= (select (select |#memory_int| subseq_~pt~2.base) (+ .cse4 (- 1))) 0)) (not (exists ((v_main_~nondetString2~5.offset_BEFORE_CALL_6 Int)) (and (<= v_main_~nondetString2~5.offset_BEFORE_CALL_6 0) (= (select (select |#memory_int| |subseq_#in~t.base|) (+ (select |#length| |subseq_#in~t.base|) v_main_~nondetString2~5.offset_BEFORE_CALL_6 (- 1))) 0) (<= v_main_~nondetString2~5.offset_BEFORE_CALL_6 |subseq_#in~t.offset|) (<= 0 v_main_~nondetString2~5.offset_BEFORE_CALL_6)))) (and .cse2 (exists ((v_main_~nondetString2~5.offset_BEFORE_CALL_6 Int)) (and (= (select (select |#memory_int| subseq_~pt~2.base) (+ (select |#length| subseq_~pt~2.base) v_main_~nondetString2~5.offset_BEFORE_CALL_6 (- 1))) 0) (<= v_main_~nondetString2~5.offset_BEFORE_CALL_6 0) (<= v_main_~nondetString2~5.offset_BEFORE_CALL_6 subseq_~pt~2.offset) (<= 0 v_main_~nondetString2~5.offset_BEFORE_CALL_6))) (exists ((main_~length2~5 Int) (v_main_~nondetString2~5.offset_BEFORE_CALL_4 Int)) (and (= 0 (select (select |#memory_int| subseq_~pt~2.base) (+ main_~length2~5 v_main_~nondetString2~5.offset_BEFORE_CALL_4 (- 1)))) (<= (+ main_~length2~5 v_main_~nondetString2~5.offset_BEFORE_CALL_4) (select |#length| subseq_~pt~2.base)) (<= 1 main_~length2~5) (<= subseq_~pt~2.offset v_main_~nondetString2~5.offset_BEFORE_CALL_4))) .cse10 .cse3 .cse5) .cse1 (not (exists ((main_~length2~5 Int) (v_main_~nondetString2~5.offset_BEFORE_CALL_4 Int)) (and (= 0 (select (select |#memory_int| |subseq_#in~t.base|) (+ main_~length2~5 v_main_~nondetString2~5.offset_BEFORE_CALL_4 (- 1)))) (<= (+ main_~length2~5 v_main_~nondetString2~5.offset_BEFORE_CALL_4) (select |#length| |subseq_#in~t.base|)) (<= |subseq_#in~t.offset| v_main_~nondetString2~5.offset_BEFORE_CALL_4) (<= 1 main_~length2~5)))) .cse9)))) [2018-01-25 05:32:59,571 INFO L401 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-01-25 05:32:59,571 INFO L401 ceAbstractionStarter]: For program point subseqErr7RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-25 05:32:59,571 INFO L401 ceAbstractionStarter]: For program point subseqEXIT(lines 540 552) no Hoare annotation was computed. [2018-01-25 05:32:59,571 INFO L401 ceAbstractionStarter]: For program point subseqErr3RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-25 05:32:59,571 INFO L401 ceAbstractionStarter]: For program point L544''''''(line 544) no Hoare annotation was computed. [2018-01-25 05:32:59,571 INFO L401 ceAbstractionStarter]: For program point subseqErr2RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-25 05:32:59,571 INFO L401 ceAbstractionStarter]: For program point L545''(line 545) no Hoare annotation was computed. [2018-01-25 05:32:59,571 INFO L401 ceAbstractionStarter]: For program point L544''(line 544) no Hoare annotation was computed. [2018-01-25 05:32:59,571 INFO L401 ceAbstractionStarter]: For program point L545'(line 545) no Hoare annotation was computed. [2018-01-25 05:32:59,571 INFO L401 ceAbstractionStarter]: For program point subseqErr6RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-25 05:32:59,572 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 567) the Hoare annotation is: true [2018-01-25 05:32:59,572 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 567) no Hoare annotation was computed. [2018-01-25 05:32:59,572 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 567) the Hoare annotation is: true [2018-01-25 05:32:59,572 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 567) no Hoare annotation was computed. [2018-01-25 05:32:59,572 INFO L401 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-25 05:32:59,572 INFO L401 ceAbstractionStarter]: For program point L564(line 564) no Hoare annotation was computed. [2018-01-25 05:32:59,572 INFO L401 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-01-25 05:32:59,572 INFO L401 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-01-25 05:32:59,572 INFO L401 ceAbstractionStarter]: For program point L563'(line 563) no Hoare annotation was computed. [2018-01-25 05:32:59,572 INFO L401 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-01-25 05:32:59,573 INFO L397 ceAbstractionStarter]: At program point L565(line 565) the Hoare annotation is: (let ((.cse18 (select |#length| main_~nondetString2~5.base))) (let ((.cse0 (= 1 (select |#valid| main_~nondetString2~5.base))) (.cse1 (= main_~length1~5 (select |#length| main_~nondetString1~5.base))) (.cse2 (= 0 |main_#t~malloc11.offset|)) (.cse3 (= main_~nondetString2~5.offset 0)) (.cse4 (<= 1 main_~length2~5)) (.cse5 (not (= |main_#t~malloc10.base| |main_#t~malloc11.base|))) (.cse6 (= 1 (select |#valid| |main_#t~malloc11.base|))) (.cse7 (= 1 (select |#valid| |main_#t~malloc10.base|))) (.cse8 (= main_~nondetString1~5.offset 0)) (.cse9 (= 0 |main_#t~malloc10.offset|)) (.cse10 (not (= main_~nondetString1~5.base main_~nondetString2~5.base))) (.cse11 (= (select |#valid| main_~nondetString1~5.base) 1)) (.cse12 (exists ((main_~length1~5 Int)) (and (<= (+ main_~length1~5 main_~nondetString1~5.offset) (select |#length| main_~nondetString1~5.base)) (= 0 (select (select |#memory_int| main_~nondetString1~5.base) (+ main_~length1~5 main_~nondetString1~5.offset (- 1)))) (<= 1 main_~length1~5)))) (.cse13 (= main_~length2~5 .cse18)) (.cse14 (= main_~length1~5 (select |#length| |main_#t~malloc10.base|))) (.cse15 (= |old(#valid)| (store (store |#valid| |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0))) (.cse16 (= main_~length2~5 (select |#length| |main_#t~malloc11.base|))) (.cse17 (not (= main_~nondetString1~5.base |main_#t~malloc11.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 (exists ((main_~length2~5 Int) (main_~nondetString2~5.base Int) (main_~nondetString2~5.offset Int)) (and (not (= main_~nondetString2~5.base main_~nondetString1~5.base)) (= (select (select |#memory_int| main_~nondetString2~5.base) (+ main_~length2~5 main_~nondetString2~5.offset (- 1))) 0))) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= 1 main_~length1~5) .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= 0 (select (select |#memory_int| main_~nondetString2~5.base) (+ .cse18 (- 1)))) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17)))) [2018-01-25 05:32:59,573 INFO L401 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-25 05:32:59,573 INFO L401 ceAbstractionStarter]: For program point mainErr2RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-25 05:32:59,573 INFO L401 ceAbstractionStarter]: For program point L556''(lines 556 558) no Hoare annotation was computed. [2018-01-25 05:32:59,573 INFO L401 ceAbstractionStarter]: For program point mainErr3RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-25 05:32:59,573 INFO L401 ceAbstractionStarter]: For program point L562'(line 562) no Hoare annotation was computed. [2018-01-25 05:32:59,573 INFO L401 ceAbstractionStarter]: For program point L564'(line 564) no Hoare annotation was computed. [2018-01-25 05:32:59,573 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 553 567) no Hoare annotation was computed. [2018-01-25 05:32:59,573 INFO L401 ceAbstractionStarter]: For program point L556(lines 556 558) no Hoare annotation was computed. [2018-01-25 05:32:59,573 INFO L401 ceAbstractionStarter]: For program point mainErr4EnsuresViolation(lines 553 567) no Hoare annotation was computed. [2018-01-25 05:32:59,573 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 553 567) no Hoare annotation was computed. [2018-01-25 05:32:59,573 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 553 567) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 05:32:59,573 INFO L401 ceAbstractionStarter]: For program point L562''(line 562) no Hoare annotation was computed. [2018-01-25 05:32:59,573 INFO L401 ceAbstractionStarter]: For program point L563''(line 563) no Hoare annotation was computed. [2018-01-25 05:32:59,573 INFO L401 ceAbstractionStarter]: For program point L563'''(line 563) no Hoare annotation was computed. [2018-01-25 05:32:59,574 INFO L401 ceAbstractionStarter]: For program point L559'(lines 559 561) no Hoare annotation was computed. [2018-01-25 05:32:59,584 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.base,QUANTIFIED] [2018-01-25 05:32:59,585 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-25 05:32:59,586 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.offset,QUANTIFIED] [2018-01-25 05:32:59,586 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.base,QUANTIFIED] [2018-01-25 05:32:59,586 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:59,587 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:59,587 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:59,587 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:59,587 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:59,587 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:59,588 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.base,QUANTIFIED] [2018-01-25 05:32:59,588 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-25 05:32:59,588 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.offset,QUANTIFIED] [2018-01-25 05:32:59,588 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.base,QUANTIFIED] [2018-01-25 05:32:59,589 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:59,589 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:59,589 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:59,589 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:59,590 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:59,590 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:59,590 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:32:59,591 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:32:59,591 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:32:59,591 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:32:59,591 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:32:59,592 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:32:59,592 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:32:59,592 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:32:59,592 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-25 05:32:59,593 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:59,593 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-25 05:32:59,593 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:59,593 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-25 05:32:59,594 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:59,594 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:59,594 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:59,594 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:59,595 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:59,595 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:59,595 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:59,595 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-25 05:32:59,596 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:59,596 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-25 05:32:59,596 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:59,596 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:59,596 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-25 05:32:59,597 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:59,597 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:59,597 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:59,597 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:59,597 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:59,598 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:59,600 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:59,600 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:59,600 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:59,601 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:59,601 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:59,601 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:59,601 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:59,601 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:59,602 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:59,602 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:59,602 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:59,603 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:59,603 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:59,603 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:59,603 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:59,603 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:59,604 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:59,604 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:59,604 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:59,605 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:59,605 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:59,605 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:59,605 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:59,606 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:59,606 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:59,606 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:59,617 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.base,QUANTIFIED] [2018-01-25 05:32:59,618 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-25 05:32:59,618 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.offset,QUANTIFIED] [2018-01-25 05:32:59,618 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.base,QUANTIFIED] [2018-01-25 05:32:59,618 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:59,619 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:59,619 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:59,619 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:59,619 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:59,619 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:59,620 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.base,QUANTIFIED] [2018-01-25 05:32:59,620 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-25 05:32:59,620 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.offset,QUANTIFIED] [2018-01-25 05:32:59,621 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.base,QUANTIFIED] [2018-01-25 05:32:59,621 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:59,621 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:59,622 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:59,622 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:59,622 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:59,622 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:59,623 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:32:59,623 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:32:59,623 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:32:59,624 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:32:59,624 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:32:59,624 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:32:59,624 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:32:59,625 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:32:59,625 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-25 05:32:59,625 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:59,626 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-25 05:32:59,626 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:59,626 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-25 05:32:59,626 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:59,627 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:59,627 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:59,627 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:59,628 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:59,628 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:59,628 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:59,628 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-25 05:32:59,628 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:59,628 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-25 05:32:59,629 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:59,629 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:59,629 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-25 05:32:59,629 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:59,629 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:59,629 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:59,629 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:59,630 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:59,630 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:59,630 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:59,630 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:59,630 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:59,630 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:59,631 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:59,631 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:59,631 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:59,631 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:59,631 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:59,631 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:59,632 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:59,632 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:59,632 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:59,632 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:59,632 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:59,633 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:59,633 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:59,633 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:59,633 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:59,633 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:59,633 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:59,634 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:59,634 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:59,634 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:59,634 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:59,634 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:59,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 05:32:59 BoogieIcfgContainer [2018-01-25 05:32:59,637 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 05:32:59,638 INFO L168 Benchmark]: Toolchain (without parser) took 47245.02 ms. Allocated memory was 305.1 MB in the beginning and 813.7 MB in the end (delta: 508.6 MB). Free memory was 265.2 MB in the beginning and 305.6 MB in the end (delta: -40.4 MB). Peak memory consumption was 468.1 MB. Max. memory is 5.3 GB. [2018-01-25 05:32:59,639 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 305.1 MB. Free memory is still 271.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 05:32:59,639 INFO L168 Benchmark]: CACSL2BoogieTranslator took 203.67 ms. Allocated memory is still 305.1 MB. Free memory was 264.2 MB in the beginning and 254.0 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. [2018-01-25 05:32:59,640 INFO L168 Benchmark]: Boogie Preprocessor took 31.30 ms. Allocated memory is still 305.1 MB. Free memory was 254.0 MB in the beginning and 252.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. [2018-01-25 05:32:59,640 INFO L168 Benchmark]: RCFGBuilder took 290.34 ms. Allocated memory is still 305.1 MB. Free memory was 252.0 MB in the beginning and 233.4 MB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 5.3 GB. [2018-01-25 05:32:59,640 INFO L168 Benchmark]: TraceAbstraction took 46709.61 ms. Allocated memory was 305.1 MB in the beginning and 813.7 MB in the end (delta: 508.6 MB). Free memory was 233.4 MB in the beginning and 305.6 MB in the end (delta: -72.2 MB). Peak memory consumption was 436.4 MB. Max. memory is 5.3 GB. [2018-01-25 05:32:59,641 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.22 ms. Allocated memory is still 305.1 MB. Free memory is still 271.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 203.67 ms. Allocated memory is still 305.1 MB. Free memory was 264.2 MB in the beginning and 254.0 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.30 ms. Allocated memory is still 305.1 MB. Free memory was 254.0 MB in the beginning and 252.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. * RCFGBuilder took 290.34 ms. Allocated memory is still 305.1 MB. Free memory was 252.0 MB in the beginning and 233.4 MB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 46709.61 ms. Allocated memory was 305.1 MB in the beginning and 813.7 MB in the end (delta: 508.6 MB). Free memory was 233.4 MB in the beginning and 305.6 MB in the end (delta: -72.2 MB). Peak memory consumption was 436.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 27 LocStat_MAX_WEQGRAPH_SIZE : 5 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 380 LocStat_NO_SUPPORTING_DISEQUALITIES : 59 LocStat_NO_DISJUNCTIONS : -54 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 34 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 70 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 37 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 3.834972 RENAME_VARIABLES(MILLISECONDS) : 0.172558 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.855721 PROJECTAWAY(MILLISECONDS) : 0.044756 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.097112 DISJOIN(MILLISECONDS) : 0.470826 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.194492 ADD_EQUALITY(MILLISECONDS) : 0.017245 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.015872 #CONJOIN_DISJUNCTIVE : 100 #RENAME_VARIABLES : 177 #UNFREEZE : 0 #CONJOIN : 164 #PROJECTAWAY : 131 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 15 #RENAME_VARIABLES_DISJUNCTIVE : 161 #ADD_EQUALITY : 72 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 27 LocStat_MAX_WEQGRAPH_SIZE : 9 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 356 LocStat_NO_SUPPORTING_DISEQUALITIES : 62 LocStat_NO_DISJUNCTIONS : -54 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 34 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 67 TransStat_NO_SUPPORTING_DISEQUALITIES : 7 TransStat_NO_DISJUNCTIONS : 37 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 5.780101 RENAME_VARIABLES(MILLISECONDS) : 0.552291 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 2.439447 PROJECTAWAY(MILLISECONDS) : 0.087301 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.060603 DISJOIN(MILLISECONDS) : 0.465108 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.583353 ADD_EQUALITY(MILLISECONDS) : 0.017739 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.011574 #CONJOIN_DISJUNCTIVE : 98 #RENAME_VARIABLES : 171 #UNFREEZE : 0 #CONJOIN : 159 #PROJECTAWAY : 126 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 13 #RENAME_VARIABLES_DISJUNCTIVE : 157 #ADD_EQUALITY : 69 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 5 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 27 LocStat_MAX_WEQGRAPH_SIZE : 5 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 378 LocStat_NO_SUPPORTING_DISEQUALITIES : 59 LocStat_NO_DISJUNCTIONS : -54 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 34 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 70 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 37 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 4.531223 RENAME_VARIABLES(MILLISECONDS) : 0.234639 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 2.199416 PROJECTAWAY(MILLISECONDS) : 0.054716 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.053294 DISJOIN(MILLISECONDS) : 0.407958 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.260649 ADD_EQUALITY(MILLISECONDS) : 0.015467 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.007371 #CONJOIN_DISJUNCTIVE : 98 #RENAME_VARIABLES : 171 #UNFREEZE : 0 #CONJOIN : 160 #PROJECTAWAY : 127 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 15 #RENAME_VARIABLES_DISJUNCTIVE : 157 #ADD_EQUALITY : 72 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 27 LocStat_MAX_WEQGRAPH_SIZE : 5 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 382 LocStat_NO_SUPPORTING_DISEQUALITIES : 59 LocStat_NO_DISJUNCTIONS : -54 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 35 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 70 TransStat_NO_SUPPORTING_DISEQUALITIES : 7 TransStat_NO_DISJUNCTIONS : 38 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 2.764266 RENAME_VARIABLES(MILLISECONDS) : 0.350778 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 2.726411 PROJECTAWAY(MILLISECONDS) : 0.251721 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.059692 DISJOIN(MILLISECONDS) : 0.279640 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.381059 ADD_EQUALITY(MILLISECONDS) : 0.014742 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.008560 #CONJOIN_DISJUNCTIVE : 100 #RENAME_VARIABLES : 173 #UNFREEZE : 0 #CONJOIN : 160 #PROJECTAWAY : 128 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 20 #RENAME_VARIABLES_DISJUNCTIVE : 161 #ADD_EQUALITY : 72 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 5 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 553]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - InvariantResult [Line: 544]: Loop Invariant [2018-01-25 05:32:59,660 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.base,QUANTIFIED] [2018-01-25 05:32:59,660 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-25 05:32:59,660 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.offset,QUANTIFIED] [2018-01-25 05:32:59,660 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.base,QUANTIFIED] [2018-01-25 05:32:59,661 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:59,661 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:59,661 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:59,661 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:59,661 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:59,662 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:59,662 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.base,QUANTIFIED] [2018-01-25 05:32:59,662 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-25 05:32:59,662 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.offset,QUANTIFIED] [2018-01-25 05:32:59,662 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.base,QUANTIFIED] [2018-01-25 05:32:59,663 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:59,663 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:59,663 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:59,663 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:59,664 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:59,664 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:59,664 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:32:59,664 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:32:59,665 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:32:59,665 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:32:59,665 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:32:59,665 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:32:59,666 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:32:59,666 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:32:59,666 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-25 05:32:59,666 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:59,667 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-25 05:32:59,667 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:59,667 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-25 05:32:59,667 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:59,668 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:59,668 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:59,668 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:59,668 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:59,669 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:59,669 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:59,669 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-25 05:32:59,669 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:59,670 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-25 05:32:59,670 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:59,670 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:59,670 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-25 05:32:59,670 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:59,671 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:59,671 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:59,671 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:59,671 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:59,671 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:59,672 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:59,672 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:59,672 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:59,672 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:59,673 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:59,673 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:59,673 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:59,673 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:59,673 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:59,674 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:59,674 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:59,674 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:59,674 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:59,675 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:59,675 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:59,675 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:59,675 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:59,676 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:59,676 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:59,683 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:59,683 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:59,683 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:59,684 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:59,684 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:59,684 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:59,684 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:59,688 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.base,QUANTIFIED] [2018-01-25 05:32:59,688 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-25 05:32:59,688 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.offset,QUANTIFIED] [2018-01-25 05:32:59,689 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.base,QUANTIFIED] [2018-01-25 05:32:59,689 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:59,689 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:59,689 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:59,689 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:59,689 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:59,690 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:59,690 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.base,QUANTIFIED] [2018-01-25 05:32:59,690 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-25 05:32:59,690 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.offset,QUANTIFIED] [2018-01-25 05:32:59,691 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.base,QUANTIFIED] [2018-01-25 05:32:59,691 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:59,691 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:59,691 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:59,692 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:59,692 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:59,692 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:59,692 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:32:59,692 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:32:59,693 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:32:59,693 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:32:59,693 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:32:59,693 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:32:59,694 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:32:59,694 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-25 05:32:59,694 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-25 05:32:59,694 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:59,694 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-25 05:32:59,695 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:59,695 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-25 05:32:59,695 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:59,695 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:59,695 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:59,696 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:59,696 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:59,696 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:59,696 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:59,696 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-25 05:32:59,696 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:59,697 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-25 05:32:59,697 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:59,697 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:59,697 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-25 05:32:59,697 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:59,698 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:59,698 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:59,698 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:59,698 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:59,698 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:59,698 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:59,699 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:59,699 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:59,699 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:59,699 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:59,699 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:59,699 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:59,700 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:59,700 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:59,700 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:59,700 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:59,700 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:59,701 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:59,701 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:59,701 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:59,701 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:59,701 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:59,702 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:59,702 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:59,702 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:59,702 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:59,703 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:59,703 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:59,703 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:59,703 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:59,703 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((((((!(1 == \valid[s]) || !(1 == \valid[t])) || ((((((1 == \valid[pt] && pt == 0) && 0 == unknown-#memory_int-unknown[ps][ps]) && ps == 0) && 1 <= unknown-#length-unknown[pt]) && 1 <= unknown-#length-unknown[ps]) && 1 == \valid[ps])) || !(0 == s)) || !(\exists main_~length2~5 : int, main_~nondetString2~5.base : int, main_~nondetString2~5.offset : int :: 0 == unknown-#memory_int-unknown[main_~nondetString2~5.base][main_~length2~5 + main_~nondetString2~5.offset + -1] && !(s == main_~nondetString2~5.base))) || unknown-#length-unknown[t] < 1) || !(0 == t)) || !(0 == unknown-#memory_int-unknown[s][s])) || !(\exists main_~length1~5 : int, v_main_~nondetString1~5.offset_BEFORE_CALL_2 : int :: ((s <= v_main_~nondetString1~5.offset_BEFORE_CALL_2 && 1 <= main_~length1~5) && main_~length1~5 + v_main_~nondetString1~5.offset_BEFORE_CALL_2 <= unknown-#length-unknown[s]) && 0 == unknown-#memory_int-unknown[s][main_~length1~5 + v_main_~nondetString1~5.offset_BEFORE_CALL_2 + -1])) && (((((((((!(1 == \valid[s]) || !(0 == s)) || !(\exists main_~length2~5 : int, main_~nondetString2~5.base : int, main_~nondetString2~5.offset : int :: 0 == unknown-#memory_int-unknown[main_~nondetString2~5.base][main_~length2~5 + main_~nondetString2~5.offset + -1] && !(s == main_~nondetString2~5.base))) || !(0 == t)) || (((pt + 1 <= unknown-#length-unknown[pt] && 1 <= pt) && ((1 == \valid[pt] && 1 <= ps) && (\exists main_~length1~5 : int, v_main_~nondetString1~5.offset_BEFORE_CALL_2 : int :: ((0 == unknown-#memory_int-unknown[ps][main_~length1~5 + v_main_~nondetString1~5.offset_BEFORE_CALL_2 + -1] && ps <= v_main_~nondetString1~5.offset_BEFORE_CALL_2) && 1 <= main_~length1~5) && main_~length1~5 + v_main_~nondetString1~5.offset_BEFORE_CALL_2 <= unknown-#length-unknown[ps])) && 1 == \valid[ps]) && unknown-#memory_int-unknown[pt][unknown-#length-unknown[pt] + -1] == 0)) || !(\exists v_main_~nondetString2~5.offset_BEFORE_CALL_6 : int :: ((v_main_~nondetString2~5.offset_BEFORE_CALL_6 <= 0 && unknown-#memory_int-unknown[t][unknown-#length-unknown[t] + v_main_~nondetString2~5.offset_BEFORE_CALL_6 + -1] == 0) && v_main_~nondetString2~5.offset_BEFORE_CALL_6 <= t) && 0 <= v_main_~nondetString2~5.offset_BEFORE_CALL_6)) || (((((1 == \valid[pt] && (\exists v_main_~nondetString2~5.offset_BEFORE_CALL_6 : int :: ((unknown-#memory_int-unknown[pt][unknown-#length-unknown[pt] + v_main_~nondetString2~5.offset_BEFORE_CALL_6 + -1] == 0 && v_main_~nondetString2~5.offset_BEFORE_CALL_6 <= 0) && v_main_~nondetString2~5.offset_BEFORE_CALL_6 <= pt) && 0 <= v_main_~nondetString2~5.offset_BEFORE_CALL_6)) && (\exists main_~length2~5 : int, v_main_~nondetString2~5.offset_BEFORE_CALL_4 : int :: ((0 == unknown-#memory_int-unknown[pt][main_~length2~5 + v_main_~nondetString2~5.offset_BEFORE_CALL_4 + -1] && main_~length2~5 + v_main_~nondetString2~5.offset_BEFORE_CALL_4 <= unknown-#length-unknown[pt]) && 1 <= main_~length2~5) && pt <= v_main_~nondetString2~5.offset_BEFORE_CALL_4)) && (\exists main_~length1~5 : int, v_main_~nondetString1~5.offset_BEFORE_CALL_2 : int :: ((0 == unknown-#memory_int-unknown[ps][main_~length1~5 + v_main_~nondetString1~5.offset_BEFORE_CALL_2 + -1] && ps <= v_main_~nondetString1~5.offset_BEFORE_CALL_2) && 1 <= main_~length1~5) && main_~length1~5 + v_main_~nondetString1~5.offset_BEFORE_CALL_2 <= unknown-#length-unknown[ps])) && ps == 0) && 1 == \valid[ps])) || !(1 == \valid[t])) || !(\exists main_~length2~5 : int, v_main_~nondetString2~5.offset_BEFORE_CALL_4 : int :: ((0 == unknown-#memory_int-unknown[t][main_~length2~5 + v_main_~nondetString2~5.offset_BEFORE_CALL_4 + -1] && main_~length2~5 + v_main_~nondetString2~5.offset_BEFORE_CALL_4 <= unknown-#length-unknown[t]) && t <= v_main_~nondetString2~5.offset_BEFORE_CALL_4) && 1 <= main_~length2~5)) || !(\exists main_~length1~5 : int, v_main_~nondetString1~5.offset_BEFORE_CALL_2 : int :: ((s <= v_main_~nondetString1~5.offset_BEFORE_CALL_2 && 1 <= main_~length1~5) && main_~length1~5 + v_main_~nondetString1~5.offset_BEFORE_CALL_2 <= unknown-#length-unknown[s]) && 0 == unknown-#memory_int-unknown[s][main_~length1~5 + v_main_~nondetString1~5.offset_BEFORE_CALL_2 + -1])) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 55 locations, 15 error locations. SAFE Result, 46.5s OverallTime, 16 OverallIterations, 3 TraceHistogramMax, 25.3s AutomataDifference, 0.0s DeadEndRemovalTime, 1.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 577 SDtfs, 1164 SDslu, 2249 SDs, 0 SdLazy, 2652 SolverSat, 333 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 883 GetRequests, 478 SyntacticMatches, 21 SemanticMatches, 384 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 5523 ImplicationChecksByTransitivity, 31.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 5.8s AbstIntTime, 4 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 84 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 15 NumberOfFragments, 614 HoareAnnotationTreeSize, 9 FomulaSimplifications, 28 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 2945 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 12.8s InterpolantComputationTime, 724 NumberOfCodeBlocks, 724 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1016 ConstructedInterpolants, 120 QuantifiedInterpolants, 502836 SizeOfPredicates, 146 NumberOfNonLiveVariables, 1423 ConjunctsInSsa, 299 ConjunctsInUnsatCore, 34 InterpolantComputations, 13 PerfectInterpolantSequences, 37/264 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/subseq-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_05-32-59-709.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/subseq-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_05-32-59-709.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/subseq-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_05-32-59-709.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/subseq-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-25_05-32-59-709.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/subseq-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-25_05-32-59-709.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/subseq-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-25_05-32-59-709.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/subseq-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-25_05-32-59-709.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/subseq-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-3-2018-01-25_05-32-59-709.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/subseq-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-3-2018-01-25_05-32-59-709.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/subseq-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_05-32-59-709.csv Received shutdown request...