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/cstrncmp-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 05:22:44,195 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 05:22:44,196 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 05:22:44,208 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 05:22:44,209 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 05:22:44,210 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 05:22:44,211 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 05:22:44,212 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 05:22:44,214 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 05:22:44,214 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 05:22:44,215 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 05:22:44,215 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 05:22:44,216 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 05:22:44,218 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 05:22:44,219 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 05:22:44,221 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 05:22:44,223 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 05:22:44,226 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 05:22:44,227 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 05:22:44,228 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 05:22:44,231 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 05:22:44,231 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 05:22:44,231 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 05:22:44,232 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 05:22:44,233 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 05:22:44,234 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 05:22:44,234 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 05:22:44,235 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 05:22:44,235 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 05:22:44,235 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 05:22:44,236 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 05:22:44,237 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:22:44,247 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 05:22:44,247 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 05:22:44,248 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 05:22:44,248 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 05:22:44,249 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 05:22:44,249 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 05:22:44,249 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 05:22:44,249 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 05:22:44,250 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 05:22:44,250 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 05:22:44,250 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 05:22:44,250 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 05:22:44,251 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 05:22:44,251 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 05:22:44,251 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 05:22:44,251 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 05:22:44,251 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 05:22:44,251 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 05:22:44,252 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 05:22:44,252 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 05:22:44,252 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 05:22:44,252 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 05:22:44,252 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 05:22:44,253 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 05:22:44,253 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 05:22:44,253 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 05:22:44,253 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 05:22:44,253 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 05:22:44,254 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 05:22:44,254 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 05:22:44,254 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 05:22:44,254 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 05:22:44,254 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 05:22:44,254 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 05:22:44,255 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 05:22:44,256 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 05:22:44,290 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 05:22:44,303 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 05:22:44,307 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 05:22:44,309 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 05:22:44,309 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 05:22:44,310 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-01-25 05:22:44,511 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 05:22:44,518 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 05:22:44,519 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 05:22:44,519 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 05:22:44,526 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 05:22:44,527 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:22:44" (1/1) ... [2018-01-25 05:22:44,531 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75d63a1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:22:44, skipping insertion in model container [2018-01-25 05:22:44,531 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:22:44" (1/1) ... [2018-01-25 05:22:44,549 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:22:44,588 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:22:44,717 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:22:44,735 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:22:44,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:22:44 WrapperNode [2018-01-25 05:22:44,742 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 05:22:44,742 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 05:22:44,742 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 05:22:44,742 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 05:22:44,756 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:22:44" (1/1) ... [2018-01-25 05:22:44,756 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:22:44" (1/1) ... [2018-01-25 05:22:44,764 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:22:44" (1/1) ... [2018-01-25 05:22:44,765 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:22:44" (1/1) ... [2018-01-25 05:22:44,769 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:22:44" (1/1) ... [2018-01-25 05:22:44,772 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:22:44" (1/1) ... [2018-01-25 05:22:44,773 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:22:44" (1/1) ... [2018-01-25 05:22:44,775 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 05:22:44,775 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 05:22:44,775 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 05:22:44,775 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 05:22:44,776 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:22:44" (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:22:44,830 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 05:22:44,830 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 05:22:44,830 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncmp [2018-01-25 05:22:44,830 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 05:22:44,830 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 05:22:44,830 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 05:22:44,830 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 05:22:44,831 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 05:22:44,831 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 05:22:44,831 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 05:22:44,831 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncmp [2018-01-25 05:22:44,831 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 05:22:44,831 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 05:22:44,831 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 05:22:45,081 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 05:22:45,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:22:45 BoogieIcfgContainer [2018-01-25 05:22:45,082 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 05:22:45,083 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 05:22:45,083 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 05:22:45,084 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 05:22:45,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 05:22:44" (1/3) ... [2018-01-25 05:22:45,085 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11f9a032 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:22:45, skipping insertion in model container [2018-01-25 05:22:45,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:22:44" (2/3) ... [2018-01-25 05:22:45,086 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11f9a032 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:22:45, skipping insertion in model container [2018-01-25 05:22:45,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:22:45" (3/3) ... [2018-01-25 05:22:45,087 INFO L105 eAbstractionObserver]: Analyzing ICFG cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-01-25 05:22:45,094 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 05:22:45,100 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-25 05:22:45,146 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 05:22:45,146 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 05:22:45,147 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 05:22:45,147 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 05:22:45,147 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 05:22:45,147 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 05:22:45,147 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 05:22:45,147 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 05:22:45,148 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 05:22:45,169 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2018-01-25 05:22:45,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 05:22:45,177 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:22:45,178 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:22:45,178 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-25 05:22:45,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1779029996, now seen corresponding path program 1 times [2018-01-25 05:22:45,186 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:22:45,233 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:22:45,233 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:22:45,233 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:22:45,233 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:22:45,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:22:45,294 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:22:45,397 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:22:45,399 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:22:45,399 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:22:45,399 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:22:45,402 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:22:45,493 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:22:45,493 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:22:45,497 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 4 states. [2018-01-25 05:22:45,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:22:45,635 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2018-01-25 05:22:45,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:22:45,636 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-25 05:22:45,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:22:45,644 INFO L225 Difference]: With dead ends: 83 [2018-01-25 05:22:45,644 INFO L226 Difference]: Without dead ends: 57 [2018-01-25 05:22:45,647 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:22:45,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-25 05:22:45,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-01-25 05:22:45,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-25 05:22:45,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2018-01-25 05:22:45,676 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 13 [2018-01-25 05:22:45,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:22:45,677 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2018-01-25 05:22:45,677 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:22:45,677 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2018-01-25 05:22:45,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 05:22:45,677 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:22:45,677 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:22:45,677 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-25 05:22:45,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1779029997, now seen corresponding path program 1 times [2018-01-25 05:22:45,678 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:22:45,679 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:22:45,679 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:22:45,679 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:22:45,679 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:22:45,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:22:45,698 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:22:45,842 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:22:45,842 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:22:45,925 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:22:45,925 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:22:45,927 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:22:45,927 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:22:45,927 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:22:45,927 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand 6 states. [2018-01-25 05:22:45,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:22:45,987 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2018-01-25 05:22:45,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:22:45,987 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-01-25 05:22:45,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:22:45,989 INFO L225 Difference]: With dead ends: 57 [2018-01-25 05:22:45,989 INFO L226 Difference]: Without dead ends: 56 [2018-01-25 05:22:45,990 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:22:45,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-01-25 05:22:45,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-01-25 05:22:45,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-25 05:22:45,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2018-01-25 05:22:45,997 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 13 [2018-01-25 05:22:45,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:22:45,998 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2018-01-25 05:22:45,998 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:22:45,998 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2018-01-25 05:22:45,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 05:22:45,998 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:22:45,998 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:22:45,998 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-25 05:22:45,999 INFO L82 PathProgramCache]: Analyzing trace with hash -684644977, now seen corresponding path program 1 times [2018-01-25 05:22:45,999 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:22:46,000 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:22:46,000 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:22:46,000 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:22:46,000 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:22:46,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:22:46,015 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:22:46,070 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:22:46,070 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:22:46,070 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:22:46,070 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:22:46,071 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:22:46,071 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:22:46,071 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:22:46,071 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand 4 states. [2018-01-25 05:22:46,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:22:46,138 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2018-01-25 05:22:46,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:22:46,138 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-25 05:22:46,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:22:46,139 INFO L225 Difference]: With dead ends: 56 [2018-01-25 05:22:46,140 INFO L226 Difference]: Without dead ends: 55 [2018-01-25 05:22:46,140 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:22:46,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-25 05:22:46,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-01-25 05:22:46,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-25 05:22:46,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2018-01-25 05:22:46,147 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 14 [2018-01-25 05:22:46,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:22:46,147 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2018-01-25 05:22:46,147 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:22:46,148 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2018-01-25 05:22:46,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 05:22:46,148 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:22:46,148 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:22:46,148 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-25 05:22:46,149 INFO L82 PathProgramCache]: Analyzing trace with hash -684644976, now seen corresponding path program 1 times [2018-01-25 05:22:46,149 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:22:46,150 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:22:46,150 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:22:46,150 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:22:46,150 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:22:46,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:22:46,163 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:22:46,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:22:46,233 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:22:46,233 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:22:46,233 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:22:46,233 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:22:46,234 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:22:46,234 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:22:46,234 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand 5 states. [2018-01-25 05:22:46,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:22:46,271 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2018-01-25 05:22:46,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:22:46,272 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-25 05:22:46,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:22:46,272 INFO L225 Difference]: With dead ends: 55 [2018-01-25 05:22:46,272 INFO L226 Difference]: Without dead ends: 54 [2018-01-25 05:22:46,273 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:22:46,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-25 05:22:46,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-25 05:22:46,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-25 05:22:46,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2018-01-25 05:22:46,278 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 14 [2018-01-25 05:22:46,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:22:46,278 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2018-01-25 05:22:46,278 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:22:46,278 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2018-01-25 05:22:46,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 05:22:46,279 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:22:46,279 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] [2018-01-25 05:22:46,279 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-25 05:22:46,279 INFO L82 PathProgramCache]: Analyzing trace with hash 518960417, now seen corresponding path program 1 times [2018-01-25 05:22:46,279 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:22:46,280 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:22:46,280 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:22:46,281 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:22:46,281 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:22:46,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:22:46,295 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:22:46,334 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:22:46,335 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:22:46,335 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:22:46,335 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:22:46,335 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:22:46,336 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:22:46,336 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:22:46,336 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand 5 states. [2018-01-25 05:22:46,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:22:46,399 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-01-25 05:22:46,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:22:46,400 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-01-25 05:22:46,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:22:46,401 INFO L225 Difference]: With dead ends: 54 [2018-01-25 05:22:46,401 INFO L226 Difference]: Without dead ends: 51 [2018-01-25 05:22:46,401 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:22:46,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-25 05:22:46,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-25 05:22:46,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-25 05:22:46,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2018-01-25 05:22:46,406 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 22 [2018-01-25 05:22:46,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:22:46,406 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2018-01-25 05:22:46,407 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:22:46,407 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-01-25 05:22:46,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 05:22:46,407 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:22:46,407 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] [2018-01-25 05:22:46,407 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-25 05:22:46,408 INFO L82 PathProgramCache]: Analyzing trace with hash 518960418, now seen corresponding path program 1 times [2018-01-25 05:22:46,408 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:22:46,409 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:22:46,409 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:22:46,409 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:22:46,409 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:22:46,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:22:46,424 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:22:46,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:22:46,539 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:22:46,539 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 05:22:46,539 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:22:46,540 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 05:22:46,540 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 05:22:46,540 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:22:46,540 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 8 states. [2018-01-25 05:22:46,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:22:46,656 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2018-01-25 05:22:46,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 05:22:46,657 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-01-25 05:22:46,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:22:46,660 INFO L225 Difference]: With dead ends: 77 [2018-01-25 05:22:46,661 INFO L226 Difference]: Without dead ends: 74 [2018-01-25 05:22:46,661 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:22:46,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-25 05:22:46,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 61. [2018-01-25 05:22:46,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-25 05:22:46,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2018-01-25 05:22:46,669 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 22 [2018-01-25 05:22:46,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:22:46,669 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 73 transitions. [2018-01-25 05:22:46,669 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 05:22:46,670 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2018-01-25 05:22:46,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 05:22:46,670 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:22:46,671 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] [2018-01-25 05:22:46,671 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-25 05:22:46,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1092096233, now seen corresponding path program 1 times [2018-01-25 05:22:46,671 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:22:46,672 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:22:46,672 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:22:46,672 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:22:46,672 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:22:46,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:22:46,686 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:22:46,719 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:22:46,719 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:22:46,719 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:22:46,719 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:22:46,720 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:22:46,724 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:22:46,725 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:22:46,725 INFO L87 Difference]: Start difference. First operand 61 states and 73 transitions. Second operand 5 states. [2018-01-25 05:22:46,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:22:46,789 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2018-01-25 05:22:46,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:22:46,790 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-01-25 05:22:46,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:22:46,790 INFO L225 Difference]: With dead ends: 61 [2018-01-25 05:22:46,790 INFO L226 Difference]: Without dead ends: 59 [2018-01-25 05:22:46,791 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:22:46,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-25 05:22:46,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-01-25 05:22:46,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-25 05:22:46,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2018-01-25 05:22:46,795 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 23 [2018-01-25 05:22:46,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:22:46,796 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2018-01-25 05:22:46,796 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:22:46,796 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2018-01-25 05:22:46,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 05:22:46,796 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:22:46,797 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] [2018-01-25 05:22:46,797 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-25 05:22:46,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1092096232, now seen corresponding path program 1 times [2018-01-25 05:22:46,797 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:22:46,798 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:22:46,798 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:22:46,798 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:22:46,798 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:22:46,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:22:46,810 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:22:46,945 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:22:46,945 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:22:46,945 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 05:22:46,945 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:22:46,946 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 05:22:46,946 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 05:22:46,946 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:22:46,947 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand 8 states. [2018-01-25 05:22:47,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:22:47,070 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2018-01-25 05:22:47,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 05:22:47,071 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-01-25 05:22:47,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:22:47,072 INFO L225 Difference]: With dead ends: 70 [2018-01-25 05:22:47,072 INFO L226 Difference]: Without dead ends: 68 [2018-01-25 05:22:47,072 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-25 05:22:47,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-25 05:22:47,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 61. [2018-01-25 05:22:47,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-25 05:22:47,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2018-01-25 05:22:47,078 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 23 [2018-01-25 05:22:47,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:22:47,079 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2018-01-25 05:22:47,079 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 05:22:47,079 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2018-01-25 05:22:47,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 05:22:47,080 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:22:47,080 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] [2018-01-25 05:22:47,080 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-25 05:22:47,081 INFO L82 PathProgramCache]: Analyzing trace with hash -2118091962, now seen corresponding path program 1 times [2018-01-25 05:22:47,081 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:22:47,082 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:22:47,082 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:22:47,082 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:22:47,082 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:22:47,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:22:47,096 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:22:47,206 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:22:47,207 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:22:47,207 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:22:47,207 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:22:47,207 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:22:47,207 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:22:47,208 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:22:47,208 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand 6 states. [2018-01-25 05:22:47,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:22:47,384 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2018-01-25 05:22:47,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 05:22:47,384 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-01-25 05:22:47,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:22:47,385 INFO L225 Difference]: With dead ends: 61 [2018-01-25 05:22:47,385 INFO L226 Difference]: Without dead ends: 46 [2018-01-25 05:22:47,386 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:22:47,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-25 05:22:47,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-01-25 05:22:47,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-25 05:22:47,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-01-25 05:22:47,390 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 26 [2018-01-25 05:22:47,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:22:47,390 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-01-25 05:22:47,390 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:22:47,390 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-01-25 05:22:47,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-25 05:22:47,391 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:22:47,391 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:22:47,391 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-25 05:22:47,391 INFO L82 PathProgramCache]: Analyzing trace with hash 487859445, now seen corresponding path program 1 times [2018-01-25 05:22:47,391 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:22:47,392 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:22:47,392 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:22:47,392 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:22:47,392 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:22:47,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:22:47,402 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:22:47,429 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:22:47,430 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:22:47,430 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:22:47,430 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:22:47,430 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 05:22:47,430 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 05:22:47,431 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:22:47,431 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 3 states. [2018-01-25 05:22:47,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:22:47,440 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2018-01-25 05:22:47,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 05:22:47,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-01-25 05:22:47,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:22:47,440 INFO L225 Difference]: With dead ends: 69 [2018-01-25 05:22:47,441 INFO L226 Difference]: Without dead ends: 47 [2018-01-25 05:22:47,441 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:22:47,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-01-25 05:22:47,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-01-25 05:22:47,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-25 05:22:47,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-01-25 05:22:47,447 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 28 [2018-01-25 05:22:47,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:22:47,448 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-01-25 05:22:47,448 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 05:22:47,448 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-01-25 05:22:47,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-25 05:22:47,449 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:22:47,449 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:22:47,449 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-25 05:22:47,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1854244690, now seen corresponding path program 1 times [2018-01-25 05:22:47,450 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:22:47,450 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:22:47,451 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:22:47,451 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:22:47,451 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:22:47,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:22:47,462 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:22:47,479 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:22:47,479 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:22:47,479 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:22:47,480 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:22:47,480 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 05:22:47,480 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 05:22:47,480 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:22:47,480 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 3 states. [2018-01-25 05:22:47,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:22:47,495 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2018-01-25 05:22:47,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 05:22:47,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-01-25 05:22:47,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:22:47,496 INFO L225 Difference]: With dead ends: 68 [2018-01-25 05:22:47,497 INFO L226 Difference]: Without dead ends: 47 [2018-01-25 05:22:47,497 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:22:47,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-01-25 05:22:47,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-01-25 05:22:47,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-25 05:22:47,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2018-01-25 05:22:47,502 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 31 [2018-01-25 05:22:47,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:22:47,502 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2018-01-25 05:22:47,502 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 05:22:47,502 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2018-01-25 05:22:47,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-25 05:22:47,503 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:22:47,504 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:22:47,504 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-25 05:22:47,504 INFO L82 PathProgramCache]: Analyzing trace with hash 2022484201, now seen corresponding path program 1 times [2018-01-25 05:22:47,504 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:22:47,505 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:22:47,505 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:22:47,505 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:22:47,505 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:22:47,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:22:47,523 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:22:47,976 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:22:47,976 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:22:47,976 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-25 05:22:47,976 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:22:47,977 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-25 05:22:47,977 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-25 05:22:47,977 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-01-25 05:22:47,977 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 12 states. [2018-01-25 05:22:48,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:22:48,273 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2018-01-25 05:22:48,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-25 05:22:48,273 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2018-01-25 05:22:48,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:22:48,274 INFO L225 Difference]: With dead ends: 89 [2018-01-25 05:22:48,274 INFO L226 Difference]: Without dead ends: 47 [2018-01-25 05:22:48,275 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2018-01-25 05:22:48,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-01-25 05:22:48,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-01-25 05:22:48,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-25 05:22:48,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2018-01-25 05:22:48,278 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 33 [2018-01-25 05:22:48,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:22:48,278 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2018-01-25 05:22:48,278 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-25 05:22:48,278 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2018-01-25 05:22:48,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-25 05:22:48,279 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:22:48,279 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:22:48,279 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-25 05:22:48,279 INFO L82 PathProgramCache]: Analyzing trace with hash -349255061, now seen corresponding path program 1 times [2018-01-25 05:22:48,279 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:22:48,280 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:22:48,280 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:22:48,280 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:22:48,280 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:22:48,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:22:48,295 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:22:48,527 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:22:48,527 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:22:48,527 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:22:48,528 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 34 with the following transitions: [2018-01-25 05:22:48,529 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [10], [16], [18], [19], [20], [21], [22], [25], [28], [37], [41], [45], [47], [50], [51], [53], [54], [57], [65], [70], [71], [74], [79], [99], [100], [101], [103] [2018-01-25 05:22:48,572 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:22:48,573 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:22:50,293 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:22:50,295 INFO L268 AbstractInterpreter]: Visited 30 different actions 54 times. Merged at 12 different actions 24 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 32 variables. [2018-01-25 05:22:50,318 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:22:50,318 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:22:50,319 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:22:50,331 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:22:50,331 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:22:50,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:22:50,378 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:22:50,411 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:22:50,413 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:22:50,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:22:50,418 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 05:22:50,533 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:22:50,534 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:22:50,535 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:22:50,535 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:22:50,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:22:50,539 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-25 05:22:50,669 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:22:50,672 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:22:50,672 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:22:50,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:22:50,690 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:22:50,691 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-01-25 05:22:50,747 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:22:50,751 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:22:50,751 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:22:50,758 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:22:50,808 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:22:50,808 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-01-25 05:22:51,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-01-25 05:22:51,141 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:22:51,142 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 05:22:51,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-01-25 05:22:51,159 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 05:22:51,164 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:22:51,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:22:51,188 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:48, output treesize:33 [2018-01-25 05:22:51,392 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 17 DAG size of output 17 [2018-01-25 05:22:51,543 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:22:51,544 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:22:51,964 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:22:51,965 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:22:51,972 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:22:51,982 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:22:51,982 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 05:22:51,984 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:22:51,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:22:51,989 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:35, output treesize:7 [2018-01-25 05:22:52,030 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:22:52,051 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:22:52,051 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:22:52,055 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:22:52,055 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:22:52,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:22:52,109 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:22:52,119 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:22:52,119 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:22:52,125 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:22:52,125 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:22:52,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:22:52,129 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-25 05:22:52,182 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:22:52,183 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:22:52,183 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:22:52,184 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:22:52,190 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:22:52,191 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:22:52,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:22:52,197 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-25 05:22:52,290 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:22:52,292 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:22:52,292 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:22:52,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:22:52,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:22:52,300 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-01-25 05:22:52,350 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:22:52,352 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:22:52,352 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:22:52,357 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:22:52,364 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:22:52,364 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2018-01-25 05:22:52,741 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:22:52,744 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:22:52,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:22:52,754 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:22:52,755 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-25 05:22:52,759 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:22:52,766 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:22:52,766 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:45, output treesize:34 [2018-01-25 05:22:52,911 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:22:52,911 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:22:53,197 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:22:53,204 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:22:53,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:22:53,206 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:22:53,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:22:53,210 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:21 [2018-01-25 05:22:53,363 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:22:53,365 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:22:53,365 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 10, 14, 12] total 51 [2018-01-25 05:22:53,365 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:22:53,365 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-25 05:22:53,366 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-25 05:22:53,366 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=2457, Unknown=0, NotChecked=0, Total=2652 [2018-01-25 05:22:53,367 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 24 states. [2018-01-25 05:22:54,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:22:54,876 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2018-01-25 05:22:54,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-25 05:22:54,877 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 33 [2018-01-25 05:22:54,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:22:54,878 INFO L225 Difference]: With dead ends: 69 [2018-01-25 05:22:54,878 INFO L226 Difference]: Without dead ends: 66 [2018-01-25 05:22:54,879 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 89 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 934 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=343, Invalid=3439, Unknown=0, NotChecked=0, Total=3782 [2018-01-25 05:22:54,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-25 05:22:54,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2018-01-25 05:22:54,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-25 05:22:54,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-01-25 05:22:54,887 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 33 [2018-01-25 05:22:54,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:22:54,888 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2018-01-25 05:22:54,888 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-25 05:22:54,888 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-01-25 05:22:54,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-25 05:22:54,889 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:22:54,889 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, 1, 1] [2018-01-25 05:22:54,889 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-25 05:22:54,889 INFO L82 PathProgramCache]: Analyzing trace with hash 2057994991, now seen corresponding path program 1 times [2018-01-25 05:22:54,889 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:22:54,890 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:22:54,890 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:22:54,891 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:22:54,891 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:22:54,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:22:54,917 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:22:55,234 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:22:55,235 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:22:55,235 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:22:55,235 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-01-25 05:22:55,235 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [10], [16], [18], [19], [20], [21], [22], [25], [28], [37], [41], [45], [47], [50], [51], [54], [56], [57], [65], [70], [71], [74], [79], [99], [100], [101], [103] [2018-01-25 05:22:55,237 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:22:55,237 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:22:56,817 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:22:56,817 INFO L268 AbstractInterpreter]: Visited 30 different actions 54 times. Merged at 12 different actions 24 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 32 variables. [2018-01-25 05:22:56,828 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:22:56,828 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:22:56,828 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:22:56,839 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:22:56,839 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:22:56,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:22:56,867 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:22:56,873 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:22:56,876 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:22:56,876 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:22:56,878 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:22:56,885 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:22:56,886 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-25 05:22:57,859 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 29 treesize of output 29 [2018-01-25 05:22:57,881 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 25 treesize of output 23 [2018-01-25 05:22:57,882 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 05:22:57,939 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 15 treesize of output 8 [2018-01-25 05:22:57,939 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 05:22:57,941 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 17 treesize of output 12 [2018-01-25 05:22:57,942 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 05:22:57,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 23 [2018-01-25 05:22:57,964 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-01-25 05:22:57,974 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-25 05:22:57,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:22:57,988 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:45, output treesize:33 [2018-01-25 05:22:58,066 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:22:58,066 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:22:58,438 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:22:58,438 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:22:58,466 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:22:58,506 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:22:58,506 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 05:22:58,519 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 16 treesize of output 14 [2018-01-25 05:22:58,519 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 05:22:58,531 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:22:58,532 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-25 05:22:58,537 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:22:58,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:22:58,547 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:69, output treesize:7 [2018-01-25 05:22:58,557 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:22:58,579 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:22:58,579 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 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 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:22:58,583 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:22:58,584 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:22:58,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:22:58,644 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:22:58,648 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:22:58,648 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:22:58,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:22:58,669 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-25 05:22:58,754 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:22:58,755 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:22:58,755 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:22:58,757 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:22:58,760 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:22:58,761 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-25 05:22:59,099 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 31 treesize of output 31 [2018-01-25 05:22:59,105 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 27 treesize of output 28 [2018-01-25 05:22:59,106 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 05:22:59,120 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 15 treesize of output 8 [2018-01-25 05:22:59,121 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 05:22:59,122 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 19 treesize of output 14 [2018-01-25 05:22:59,122 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 05:22:59,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 30 [2018-01-25 05:22:59,143 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-01-25 05:22:59,153 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-25 05:22:59,164 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:22:59,165 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:39, output treesize:31 [2018-01-25 05:22:59,285 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:22:59,286 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:22:59,413 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:22:59,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2018-01-25 05:22:59,440 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:22:59,445 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:22:59,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:22:59,452 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:14 [2018-01-25 05:22:59,532 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:22:59,533 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:22:59,533 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12, 14, 14] total 49 [2018-01-25 05:22:59,533 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:22:59,534 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-25 05:22:59,534 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-25 05:22:59,535 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=2223, Unknown=1, NotChecked=0, Total=2450 [2018-01-25 05:22:59,535 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 24 states. [2018-01-25 05:23:00,134 WARN L146 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 62 DAG size of output 49 [2018-01-25 05:23:00,313 WARN L146 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 49 DAG size of output 39 [2018-01-25 05:23:00,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:23:00,674 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2018-01-25 05:23:00,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-25 05:23:00,674 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 34 [2018-01-25 05:23:00,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:23:00,675 INFO L225 Difference]: With dead ends: 66 [2018-01-25 05:23:00,675 INFO L226 Difference]: Without dead ends: 60 [2018-01-25 05:23:00,676 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 97 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 879 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=397, Invalid=3262, Unknown=1, NotChecked=0, Total=3660 [2018-01-25 05:23:00,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-25 05:23:00,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2018-01-25 05:23:00,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-25 05:23:00,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2018-01-25 05:23:00,683 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 34 [2018-01-25 05:23:00,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:23:00,683 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2018-01-25 05:23:00,683 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-25 05:23:00,683 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-01-25 05:23:00,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-25 05:23:00,684 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:23:00,684 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:23:00,685 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-25 05:23:00,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1216715776, now seen corresponding path program 2 times [2018-01-25 05:23:00,685 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:23:00,686 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:23:00,686 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:23:00,686 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:23:00,686 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:23:00,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:23:00,701 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:23:01,120 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:23:01,121 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:23:01,121 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:23:01,121 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:23:01,121 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:23:01,121 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:23:01,121 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:23:01,127 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:23:01,127 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:23:01,138 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:23:01,145 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:23:01,147 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:23:01,150 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:23:01,152 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:23:01,152 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:23:01,157 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:23:01,157 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:23:01,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:23:01,160 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-25 05:23:01,192 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:23:01,193 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:23:01,193 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:23:01,200 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:23:01,200 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:23:01,201 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:23:01,201 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:23:01,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:23:01,205 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-25 05:23:01,241 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:23:01,242 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:23:01,243 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:23:01,244 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:23:01,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:23:01,250 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-01-25 05:23:01,275 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:23:01,277 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:23:01,277 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:23:01,281 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:23:01,287 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:23:01,287 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:35 [2018-01-25 05:23:01,525 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 32 treesize of output 30 [2018-01-25 05:23:01,529 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:23:01,529 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:23:01,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-01-25 05:23:01,540 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-25 05:23:01,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:23:01,552 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:23:01,552 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:54, output treesize:49 [2018-01-25 05:23:01,651 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:23:01,651 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:23:02,210 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 41 treesize of output 39 [2018-01-25 05:23:02,230 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:23:02,247 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:23:02,257 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:23:02,292 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 39 treesize of output 37 [2018-01-25 05:23:02,312 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:23:02,312 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 05:23:02,319 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:23:02,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:23:02,335 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:81, output treesize:98 [2018-01-25 05:23:05,399 WARN L143 SmtUtils]: Spent 2923ms on a formula simplification that was a NOOP. DAG size: 38 [2018-01-25 05:23:05,495 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:23:05,517 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:23:05,517 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 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 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:23:05,520 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:23:05,520 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:23:05,536 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:23:05,562 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:23:05,597 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:23:05,603 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:23:05,608 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:23:05,609 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:23:05,615 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:23:05,616 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:23:05,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:23:05,619 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-25 05:23:05,654 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:23:05,655 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:23:05,655 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:23:05,663 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:23:05,664 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:23:05,664 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:23:05,664 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:23:05,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:23:05,669 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-25 05:23:05,741 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 15 treesize of output 12 [2018-01-25 05:23:05,742 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:23:05,742 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:23:05,743 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:23:05,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:23:05,747 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-25 05:23:05,791 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 28 treesize of output 29 [2018-01-25 05:23:05,793 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:23:05,793 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:23:05,798 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:23:05,802 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:23:05,803 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-01-25 05:23:06,013 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 32 treesize of output 30 [2018-01-25 05:23:06,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-01-25 05:23:06,025 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 05:23:06,036 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:23:06,037 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 05:23:06,042 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:23:06,058 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:23:06,058 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:54, output treesize:49 [2018-01-25 05:23:06,074 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:23:06,074 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:23:06,520 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:23:06,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, 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:23:06,529 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:23:06,530 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:23:06,535 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:23:06,536 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:35 [2018-01-25 05:23:07,000 WARN L143 SmtUtils]: Spent 325ms on a formula simplification that was a NOOP. DAG size: 34 [2018-01-25 05:23:07,193 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:23:07,195 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:23:07,195 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 12, 15, 13] total 49 [2018-01-25 05:23:07,195 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:23:07,196 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-25 05:23:07,196 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-25 05:23:07,196 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=2288, Unknown=0, NotChecked=0, Total=2450 [2018-01-25 05:23:07,196 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 26 states. [2018-01-25 05:23:07,982 WARN L146 SmtUtils]: Spent 284ms on a formula simplification. DAG size of input: 57 DAG size of output 41 [2018-01-25 05:23:08,282 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 64 DAG size of output 49 [2018-01-25 05:23:08,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:23:08,962 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-01-25 05:23:08,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-25 05:23:08,962 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 44 [2018-01-25 05:23:08,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:23:08,963 INFO L225 Difference]: With dead ends: 60 [2018-01-25 05:23:08,963 INFO L226 Difference]: Without dead ends: 57 [2018-01-25 05:23:08,964 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 134 SyntacticMatches, 6 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=441, Invalid=3591, Unknown=0, NotChecked=0, Total=4032 [2018-01-25 05:23:08,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-25 05:23:08,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2018-01-25 05:23:08,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-25 05:23:08,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2018-01-25 05:23:08,969 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 44 [2018-01-25 05:23:08,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:23:08,969 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2018-01-25 05:23:08,969 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-25 05:23:08,969 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2018-01-25 05:23:08,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-25 05:23:08,970 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:23:08,970 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, 1, 1] [2018-01-25 05:23:08,970 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-25 05:23:08,971 INFO L82 PathProgramCache]: Analyzing trace with hash -936516614, now seen corresponding path program 2 times [2018-01-25 05:23:08,971 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:23:08,971 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:23:08,971 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 05:23:08,971 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:23:08,972 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:23:08,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:23:08,989 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:23:09,528 WARN L146 SmtUtils]: Spent 158ms on a formula simplification. DAG size of input: 37 DAG size of output 27 [2018-01-25 05:23:09,771 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:23:09,771 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:23:09,771 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:23:09,771 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:23:09,771 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:23:09,771 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:23:09,771 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:23:09,777 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:23:09,778 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:23:09,795 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:23:09,803 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:23:09,805 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:23:09,809 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:23:09,815 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:23:09,816 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:23:09,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:23:09,820 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 05:23:09,854 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:23:09,856 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:23:09,856 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:23:09,857 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:23:09,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:23:09,862 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-01-25 05:23:10,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, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 31 [2018-01-25 05:23:10,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 27 [2018-01-25 05:23:10,139 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 05:23:10,151 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 27 treesize of output 20 [2018-01-25 05:23:10,151 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 05:23:10,165 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 20 treesize of output 18 [2018-01-25 05:23:10,166 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-25 05:23:10,176 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-25 05:23:10,189 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:23:10,189 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:49, output treesize:49 [2018-01-25 05:23:10,280 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:23:10,280 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:23:10,806 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:23:10,867 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:23:10,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:23:10,896 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:23:10,898 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:23:10,922 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:23:10,923 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 05:23:10,932 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:23:10,932 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-25 05:23:10,939 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:23:10,985 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:23:11,010 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:23:11,010 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-25 05:23:11,019 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:23:11,020 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-25 05:23:11,026 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:23:11,032 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:23:11,095 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 57 treesize of output 49 [2018-01-25 05:23:11,096 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-25 05:23:11,126 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:23:11,127 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-25 05:23:11,157 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:23:11,157 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-25 05:23:11,171 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:23:11,210 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:23:11,210 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:149, output treesize:98 [2018-01-25 05:23:11,322 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:23:11,343 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:23:11,343 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 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 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:23:11,346 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:23:11,346 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:23:11,363 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:23:11,388 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:23:11,430 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:23:11,436 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:23:11,439 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:23:11,440 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:23:11,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:23:11,443 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 05:23:11,477 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:23:11,478 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:23:11,478 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:23:11,479 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:23:11,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:23:11,481 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-25 05:23:11,820 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 30 treesize of output 30 [2018-01-25 05:23:11,823 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 26 treesize of output 19 [2018-01-25 05:23:11,823 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:23:11,838 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 19 treesize of output 17 [2018-01-25 05:23:11,839 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-25 05:23:11,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 25 [2018-01-25 05:23:11,864 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-25 05:23:11,875 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-25 05:23:11,887 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:23:11,887 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:34 [2018-01-25 05:23:11,917 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:23:11,918 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:23:12,246 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:23:12,279 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:23:12,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:23:12,294 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 16 treesize of output 14 [2018-01-25 05:23:12,295 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 05:23:12,307 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:23:12,308 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 05:23:12,312 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:23:12,322 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:23:12,322 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:65, output treesize:35 [2018-01-25 05:23:12,449 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:23:12,450 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:23:12,450 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14, 15, 15] total 54 [2018-01-25 05:23:12,451 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:23:12,451 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-25 05:23:12,451 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-25 05:23:12,452 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=2693, Unknown=0, NotChecked=0, Total=2970 [2018-01-25 05:23:12,452 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 27 states. [2018-01-25 05:23:13,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:23:13,784 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-01-25 05:23:13,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-25 05:23:13,785 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 45 [2018-01-25 05:23:13,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:23:13,785 INFO L225 Difference]: With dead ends: 57 [2018-01-25 05:23:13,785 INFO L226 Difference]: Without dead ends: 0 [2018-01-25 05:23:13,786 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 135 SyntacticMatches, 4 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 6 DeprecatedPredicates, 1269 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=700, Invalid=4556, Unknown=0, NotChecked=0, Total=5256 [2018-01-25 05:23:13,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-25 05:23:13,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-25 05:23:13,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-25 05:23:13,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-25 05:23:13,787 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2018-01-25 05:23:13,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:23:13,787 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-25 05:23:13,787 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-25 05:23:13,787 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-25 05:23:13,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-25 05:23:13,791 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-25 05:23:14,197 WARN L146 SmtUtils]: Spent 296ms on a formula simplification. DAG size of input: 101 DAG size of output 73 [2018-01-25 05:23:31,147 WARN L146 SmtUtils]: Spent 16879ms on a formula simplification. DAG size of input: 194 DAG size of output 154 [2018-01-25 05:23:31,151 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 569) no Hoare annotation was computed. [2018-01-25 05:23:31,151 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 569) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 05:23:31,151 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 569) no Hoare annotation was computed. [2018-01-25 05:23:31,151 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 569) the Hoare annotation is: true [2018-01-25 05:23:31,151 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 569) no Hoare annotation was computed. [2018-01-25 05:23:31,151 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 569) the Hoare annotation is: true [2018-01-25 05:23:31,151 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 569) no Hoare annotation was computed. [2018-01-25 05:23:31,151 INFO L401 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 569) no Hoare annotation was computed. [2018-01-25 05:23:31,152 INFO L401 ceAbstractionStarter]: For program point L565'''(line 565) no Hoare annotation was computed. [2018-01-25 05:23:31,152 INFO L401 ceAbstractionStarter]: For program point L561'(lines 561 563) no Hoare annotation was computed. [2018-01-25 05:23:31,152 INFO L401 ceAbstractionStarter]: For program point L564(line 564) no Hoare annotation was computed. [2018-01-25 05:23:31,152 INFO L397 ceAbstractionStarter]: At program point L568(line 568) the Hoare annotation is: (let ((.cse5 (select |#length| main_~nondetString1~4.base)) (.cse18 (select |#length| main_~nondetString2~4.base))) (let ((.cse2 (select |#memory_int| main_~nondetString2~4.base)) (.cse0 (= main_~length1~4 (select |#length| |main_#t~malloc13.base|))) (.cse3 (= 1 (select |#valid| |main_#t~malloc14.base|))) (.cse4 (= 1 (select |#valid| main_~nondetString1~4.base))) (.cse1 (select |#length| |main_#t~malloc14.base|)) (.cse6 (not (= main_~nondetString1~4.base main_~nondetString2~4.base))) (.cse7 (<= 1 main_~length2~4)) (.cse8 (= main_~nondetString2~4.offset 0)) (.cse9 (= |old(#valid)| (store (store |#valid| |main_#t~malloc13.base| (select (store |#valid| |main_#t~malloc13.base| 0) |main_#t~malloc13.base|)) |main_#t~malloc14.base| 0))) (.cse10 (= main_~length2~4 .cse18)) (.cse11 (= 0 |main_#t~malloc13.offset|)) (.cse12 (<= (+ main_~nondetString1~4.offset 1) .cse5)) (.cse13 (= 0 |main_#t~malloc14.offset|)) (.cse14 (= 1 (select |#valid| main_~nondetString2~4.base))) (.cse15 (= 1 (select |#valid| |main_#t~malloc13.base|))) (.cse16 (not (= |main_#t~malloc13.base| |main_#t~malloc14.base|))) (.cse17 (not (= main_~nondetString1~4.base |main_#t~malloc14.base|)))) (or (and .cse0 (= main_~length2~4 .cse1) (= 0 (select (select (store |#memory_int| main_~nondetString2~4.base (store .cse2 (+ main_~length2~4 main_~nondetString2~4.offset (- 1)) 0)) main_~nondetString1~4.base) main_~nondetString1~4.offset)) .cse3 .cse4 (= main_~length1~4 .cse5) .cse6 .cse7 .cse8 (<= main_~length1~4 1) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= 1 (+ main_~length1~4 main_~nondetString1~4.offset))) (and (= (select .cse2 (+ .cse18 main_~nondetString2~4.offset (- 1))) 0) .cse0 (= main_~nondetString1~4.offset 0) .cse3 .cse4 (= .cse1 main_~length2~4) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= .cse5 main_~length1~4) (= (select (select |#memory_int| main_~nondetString1~4.base) (+ main_~nondetString1~4.offset .cse5 (- 1))) 0) .cse15 .cse16 .cse17)))) [2018-01-25 05:23:31,152 INFO L401 ceAbstractionStarter]: For program point L567(line 567) no Hoare annotation was computed. [2018-01-25 05:23:31,152 INFO L401 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-01-25 05:23:31,152 INFO L401 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-01-25 05:23:31,152 INFO L401 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 569) no Hoare annotation was computed. [2018-01-25 05:23:31,152 INFO L401 ceAbstractionStarter]: For program point mainErr2RequiresViolation(lines 1 569) no Hoare annotation was computed. [2018-01-25 05:23:31,152 INFO L401 ceAbstractionStarter]: For program point L558''(lines 558 560) no Hoare annotation was computed. [2018-01-25 05:23:31,152 INFO L401 ceAbstractionStarter]: For program point L566'(line 566) no Hoare annotation was computed. [2018-01-25 05:23:31,152 INFO L401 ceAbstractionStarter]: For program point L568'(line 568) no Hoare annotation was computed. [2018-01-25 05:23:31,153 INFO L401 ceAbstractionStarter]: For program point mainErr3RequiresViolation(lines 1 569) no Hoare annotation was computed. [2018-01-25 05:23:31,153 INFO L401 ceAbstractionStarter]: For program point L564'(line 564) no Hoare annotation was computed. [2018-01-25 05:23:31,153 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 555 569) no Hoare annotation was computed. [2018-01-25 05:23:31,153 INFO L401 ceAbstractionStarter]: For program point mainErr4EnsuresViolation(lines 555 569) no Hoare annotation was computed. [2018-01-25 05:23:31,153 INFO L401 ceAbstractionStarter]: For program point L558(lines 558 560) no Hoare annotation was computed. [2018-01-25 05:23:31,153 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 555 569) no Hoare annotation was computed. [2018-01-25 05:23:31,153 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 555 569) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 05:23:31,153 INFO L401 ceAbstractionStarter]: For program point L564''(line 564) no Hoare annotation was computed. [2018-01-25 05:23:31,153 INFO L401 ceAbstractionStarter]: For program point L565'(line 565) no Hoare annotation was computed. [2018-01-25 05:23:31,153 INFO L401 ceAbstractionStarter]: For program point L565''(line 565) no Hoare annotation was computed. [2018-01-25 05:23:31,153 INFO L401 ceAbstractionStarter]: For program point cstrncmpErr1RequiresViolation(lines 1 569) no Hoare annotation was computed. [2018-01-25 05:23:31,153 INFO L401 ceAbstractionStarter]: For program point L546(line 546) no Hoare annotation was computed. [2018-01-25 05:23:31,153 INFO L401 ceAbstractionStarter]: For program point L545(lines 545 550) no Hoare annotation was computed. [2018-01-25 05:23:31,153 INFO L401 ceAbstractionStarter]: For program point L543(lines 543 544) no Hoare annotation was computed. [2018-01-25 05:23:31,153 INFO L401 ceAbstractionStarter]: For program point cstrncmpErr0RequiresViolation(lines 1 569) no Hoare annotation was computed. [2018-01-25 05:23:31,154 INFO L401 ceAbstractionStarter]: For program point L546''''(line 546) no Hoare annotation was computed. [2018-01-25 05:23:31,154 INFO L401 ceAbstractionStarter]: For program point cstrncmpErr3RequiresViolation(lines 1 569) no Hoare annotation was computed. [2018-01-25 05:23:31,154 INFO L401 ceAbstractionStarter]: For program point cstrncmpErr9RequiresViolation(lines 1 569) no Hoare annotation was computed. [2018-01-25 05:23:31,154 INFO L401 ceAbstractionStarter]: For program point L545''(line 545) no Hoare annotation was computed. [2018-01-25 05:23:31,154 INFO L401 ceAbstractionStarter]: For program point cstrncmpErr6RequiresViolation(lines 1 569) no Hoare annotation was computed. [2018-01-25 05:23:31,154 INFO L401 ceAbstractionStarter]: For program point cstrncmpErr5RequiresViolation(lines 1 569) no Hoare annotation was computed. [2018-01-25 05:23:31,154 INFO L401 ceAbstractionStarter]: For program point cstrncmpErr7RequiresViolation(lines 1 569) no Hoare annotation was computed. [2018-01-25 05:23:31,154 INFO L401 ceAbstractionStarter]: For program point L553''(line 553) no Hoare annotation was computed. [2018-01-25 05:23:31,154 INFO L401 ceAbstractionStarter]: For program point L545'''''''''(lines 545 550) no Hoare annotation was computed. [2018-01-25 05:23:31,154 INFO L401 ceAbstractionStarter]: For program point L545''''(line 545) no Hoare annotation was computed. [2018-01-25 05:23:31,154 INFO L401 ceAbstractionStarter]: For program point cstrncmpErr4RequiresViolation(lines 1 569) no Hoare annotation was computed. [2018-01-25 05:23:31,155 INFO L401 ceAbstractionStarter]: For program point cstrncmpErr8RequiresViolation(lines 1 569) no Hoare annotation was computed. [2018-01-25 05:23:31,155 INFO L401 ceAbstractionStarter]: For program point cstrncmpEXIT(lines 540 554) no Hoare annotation was computed. [2018-01-25 05:23:31,155 INFO L401 ceAbstractionStarter]: For program point L545'''(line 545) no Hoare annotation was computed. [2018-01-25 05:23:31,155 INFO L401 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-01-25 05:23:31,155 INFO L401 ceAbstractionStarter]: For program point L552(line 552) no Hoare annotation was computed. [2018-01-25 05:23:31,155 INFO L401 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-01-25 05:23:31,155 INFO L401 ceAbstractionStarter]: For program point L552'(line 552) no Hoare annotation was computed. [2018-01-25 05:23:31,155 INFO L404 ceAbstractionStarter]: At program point cstrncmpENTRY(lines 540 554) the Hoare annotation is: true [2018-01-25 05:23:31,155 INFO L401 ceAbstractionStarter]: For program point L545''''''(line 545) no Hoare annotation was computed. [2018-01-25 05:23:31,155 INFO L401 ceAbstractionStarter]: For program point cstrncmpErr2RequiresViolation(lines 1 569) no Hoare annotation was computed. [2018-01-25 05:23:31,155 INFO L401 ceAbstractionStarter]: For program point L546''(line 546) no Hoare annotation was computed. [2018-01-25 05:23:31,155 INFO L401 ceAbstractionStarter]: For program point L545'(line 545) no Hoare annotation was computed. [2018-01-25 05:23:31,156 INFO L397 ceAbstractionStarter]: At program point L545''''''''(lines 545 550) the Hoare annotation is: (let ((.cse16 (select |#length| cstrncmp_~s2.base)) (.cse15 (select |#length| cstrncmp_~s1.base))) (let ((.cse1 (not (= 1 (select |#valid| |cstrncmp_#in~s2.base|)))) (.cse2 (not (= (select |#valid| |cstrncmp_#in~s1.base|) 1))) (.cse0 (not (= 0 |cstrncmp_#in~s1.offset|))) (.cse4 (= cstrncmp_~s2.offset 0)) (.cse5 (= cstrncmp_~s1.offset 0)) (.cse7 (<= 1 .cse15)) (.cse8 (<= 1 .cse16)) (.cse6 (= 1 (select |#valid| cstrncmp_~s1.base))) (.cse9 (= 1 (select |#valid| cstrncmp_~s2.base))) (.cse3 (not (= 0 |cstrncmp_#in~s2.offset|)))) (and (or (< (select |#length| |cstrncmp_#in~s1.base|) 1) .cse0 .cse1 (not (= 0 (select (select |#memory_int| |cstrncmp_#in~s1.base|) |cstrncmp_#in~s1.offset|))) (< (select |#length| |cstrncmp_#in~s2.base|) 1) .cse2 .cse3 (and .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 (select (select |#memory_int| cstrncmp_~s1.base) cstrncmp_~s1.offset)) .cse9)) (let ((.cse10 (exists ((main_~nondetString2~4.offset Int) (main_~nondetString2~4.base Int)) (and (= (select (select |#memory_int| main_~nondetString2~4.base) (+ (select |#length| main_~nondetString2~4.base) main_~nondetString2~4.offset (- 1))) 0) (not (= main_~nondetString2~4.base cstrncmp_~s1.base))))) (.cse11 (<= (+ cstrncmp_~s2.offset 1) .cse16)) (.cse12 (exists ((v_main_~nondetString1~4.offset_BEFORE_CALL_5 Int)) (and (<= v_main_~nondetString1~4.offset_BEFORE_CALL_5 0) (<= (+ v_main_~nondetString1~4.offset_BEFORE_CALL_5 1) cstrncmp_~s1.offset) (<= 0 v_main_~nondetString1~4.offset_BEFORE_CALL_5) (= (select (select |#memory_int| cstrncmp_~s1.base) (+ v_main_~nondetString1~4.offset_BEFORE_CALL_5 (select |#length| cstrncmp_~s1.base) (- 1))) 0)))) (.cse13 (exists ((v_main_~nondetString2~4.offset_BEFORE_CALL_5 Int)) (and (<= v_main_~nondetString2~4.offset_BEFORE_CALL_5 0) (<= (+ v_main_~nondetString2~4.offset_BEFORE_CALL_5 1) cstrncmp_~s2.offset) (<= 0 v_main_~nondetString2~4.offset_BEFORE_CALL_5) (= (select (select |#memory_int| cstrncmp_~s2.base) (+ v_main_~nondetString2~4.offset_BEFORE_CALL_5 (select |#length| cstrncmp_~s2.base) (- 1))) 0)))) (.cse14 (<= (+ cstrncmp_~s1.offset 1) .cse15))) (or (and (<= 2 cstrncmp_~s2.offset) .cse10 (<= 2 cstrncmp_~s1.offset) .cse11 .cse6 .cse12 .cse13 .cse14 .cse9) (not (exists ((v_main_~nondetString2~4.offset_BEFORE_CALL_5 Int)) (and (<= v_main_~nondetString2~4.offset_BEFORE_CALL_5 0) (= (select (select |#memory_int| |cstrncmp_#in~s2.base|) (+ v_main_~nondetString2~4.offset_BEFORE_CALL_5 (select |#length| |cstrncmp_#in~s2.base|) (- 1))) 0) (<= 0 v_main_~nondetString2~4.offset_BEFORE_CALL_5) (<= v_main_~nondetString2~4.offset_BEFORE_CALL_5 |cstrncmp_#in~s2.offset|)))) .cse1 (not (exists ((main_~nondetString2~4.offset Int) (main_~nondetString2~4.base Int)) (and (= 0 (select (select |#memory_int| main_~nondetString2~4.base) (+ main_~nondetString2~4.offset (select |#length| main_~nondetString2~4.base) (- 1)))) (not (= main_~nondetString2~4.base |cstrncmp_#in~s1.base|))))) (not (exists ((main_~length2~4 Int) (v_main_~nondetString2~4.offset_BEFORE_CALL_3 Int)) (and (= (select (select |#memory_int| |cstrncmp_#in~s2.base|) (+ main_~length2~4 v_main_~nondetString2~4.offset_BEFORE_CALL_3 (- 1))) 0) (<= |cstrncmp_#in~s2.offset| v_main_~nondetString2~4.offset_BEFORE_CALL_3) (<= 1 main_~length2~4) (<= (+ main_~length2~4 v_main_~nondetString2~4.offset_BEFORE_CALL_3) (select |#length| |cstrncmp_#in~s2.base|))))) .cse2 .cse0 (and (exists ((v_main_~nondetString1~4.offset_BEFORE_CALL_5 Int)) (and (<= v_main_~nondetString1~4.offset_BEFORE_CALL_5 0) (<= v_main_~nondetString1~4.offset_BEFORE_CALL_5 cstrncmp_~s1.offset) (<= 0 v_main_~nondetString1~4.offset_BEFORE_CALL_5) (= (select (select |#memory_int| cstrncmp_~s1.base) (+ v_main_~nondetString1~4.offset_BEFORE_CALL_5 (select |#length| cstrncmp_~s1.base) (- 1))) 0))) .cse10 .cse4 .cse5 .cse6 .cse7 .cse8 (exists ((v_main_~nondetString2~4.offset_BEFORE_CALL_5 Int)) (and (<= v_main_~nondetString2~4.offset_BEFORE_CALL_5 0) (<= v_main_~nondetString2~4.offset_BEFORE_CALL_5 cstrncmp_~s2.offset) (<= 0 v_main_~nondetString2~4.offset_BEFORE_CALL_5) (= (select (select |#memory_int| cstrncmp_~s2.base) (+ v_main_~nondetString2~4.offset_BEFORE_CALL_5 (select |#length| cstrncmp_~s2.base) (- 1))) 0))) .cse9) (and .cse10 .cse11 .cse6 .cse12 (or (<= (+ cstrncmp_~s1.offset 2) .cse15) (= 1 cstrncmp_~s1.offset)) (or (<= (+ cstrncmp_~s2.offset 2) .cse16) (= 1 cstrncmp_~s2.offset)) .cse13 .cse14 .cse9) (not (exists ((v_main_~nondetString1~4.offset_BEFORE_CALL_2 Int) (main_~length1~4 Int)) (and (= (select (select |#memory_int| |cstrncmp_#in~s1.base|) (+ v_main_~nondetString1~4.offset_BEFORE_CALL_2 main_~length1~4 (- 1))) 0) (<= |cstrncmp_#in~s1.offset| v_main_~nondetString1~4.offset_BEFORE_CALL_2) (<= (+ v_main_~nondetString1~4.offset_BEFORE_CALL_2 main_~length1~4) (select |#length| |cstrncmp_#in~s1.base|)) (<= 1 main_~length1~4)))) (not (exists ((v_main_~nondetString1~4.offset_BEFORE_CALL_5 Int)) (and (= 0 (select (select |#memory_int| |cstrncmp_#in~s1.base|) (+ v_main_~nondetString1~4.offset_BEFORE_CALL_5 (select |#length| |cstrncmp_#in~s1.base|) (- 1)))) (<= v_main_~nondetString1~4.offset_BEFORE_CALL_5 0) (<= 0 v_main_~nondetString1~4.offset_BEFORE_CALL_5) (<= v_main_~nondetString1~4.offset_BEFORE_CALL_5 |cstrncmp_#in~s1.offset|)))) .cse3))))) [2018-01-25 05:23:31,156 INFO L401 ceAbstractionStarter]: For program point L546'''(line 546) no Hoare annotation was computed. [2018-01-25 05:23:31,156 INFO L401 ceAbstractionStarter]: For program point cstrncmpFINAL(lines 540 554) no Hoare annotation was computed. [2018-01-25 05:23:31,168 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-25 05:23:31,169 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-25 05:23:31,170 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-25 05:23:31,170 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-25 05:23:31,170 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,171 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,171 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,171 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,172 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,172 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,172 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,173 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,173 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,173 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,173 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,174 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,174 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-25 05:23:31,174 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-25 05:23:31,174 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-25 05:23:31,174 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-25 05:23:31,175 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:23:31,175 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-25 05:23:31,175 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-25 05:23:31,175 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:23:31,175 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:23:31,175 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-25 05:23:31,176 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,176 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,176 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,176 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,176 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-25 05:23:31,176 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-25 05:23:31,177 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-25 05:23:31,177 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-25 05:23:31,177 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,177 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,177 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,177 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,178 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-25 05:23:31,178 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-25 05:23:31,178 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-25 05:23:31,178 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-25 05:23:31,178 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,179 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,179 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,179 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,179 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,179 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,179 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,180 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,180 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:23:31,180 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 05:23:31,180 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:23:31,180 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:23:31,180 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 05:23:31,181 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 05:23:31,181 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,181 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,181 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,181 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,183 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,183 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:31,183 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,183 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,183 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,184 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:31,184 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:31,184 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,184 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,184 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:31,185 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,185 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:31,185 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,185 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,185 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:31,186 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,186 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:31,186 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,186 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:31,186 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,186 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:31,187 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,187 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:31,187 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,187 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,187 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,187 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:31,188 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,188 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:31,188 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,188 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,188 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:31,188 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,189 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,189 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,189 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:31,189 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,189 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,189 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:31,190 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,190 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:31,190 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,203 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-25 05:23:31,204 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-25 05:23:31,204 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-25 05:23:31,204 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-25 05:23:31,205 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,205 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,205 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,206 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,206 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,206 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,206 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,207 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,207 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,207 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,208 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,208 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,208 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-25 05:23:31,208 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-25 05:23:31,209 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-25 05:23:31,209 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-25 05:23:31,209 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:23:31,209 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-25 05:23:31,210 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-25 05:23:31,210 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:23:31,210 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:23:31,210 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-25 05:23:31,211 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,211 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,211 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,212 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,212 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-25 05:23:31,212 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-25 05:23:31,212 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-25 05:23:31,213 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-25 05:23:31,213 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,213 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,214 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,214 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,214 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-25 05:23:31,214 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-25 05:23:31,215 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-25 05:23:31,215 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-25 05:23:31,215 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,215 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,216 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,216 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,216 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,216 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,217 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,217 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,217 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:23:31,217 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 05:23:31,217 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:23:31,218 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:23:31,218 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 05:23:31,218 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 05:23:31,218 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,218 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,218 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,218 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,218 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,219 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:31,219 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,219 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,219 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,219 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:31,219 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:31,219 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,220 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,220 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:31,220 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,220 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:31,220 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,221 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,221 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:31,221 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,221 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:31,221 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,221 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:31,222 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,222 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:31,222 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,222 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:31,222 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,222 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,223 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,223 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:31,223 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,223 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:31,223 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,224 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,224 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:31,224 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,224 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,224 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,225 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:31,225 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,225 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,225 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:31,225 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,225 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:31,225 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 05:23:31 BoogieIcfgContainer [2018-01-25 05:23:31,229 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 05:23:31,230 INFO L168 Benchmark]: Toolchain (without parser) took 46717.85 ms. Allocated memory was 307.8 MB in the beginning and 731.4 MB in the end (delta: 423.6 MB). Free memory was 267.8 MB in the beginning and 476.6 MB in the end (delta: -208.8 MB). Peak memory consumption was 214.8 MB. Max. memory is 5.3 GB. [2018-01-25 05:23:31,231 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 307.8 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 05:23:31,231 INFO L168 Benchmark]: CACSL2BoogieTranslator took 222.99 ms. Allocated memory is still 307.8 MB. Free memory was 266.8 MB in the beginning and 256.6 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:23:31,231 INFO L168 Benchmark]: Boogie Preprocessor took 32.81 ms. Allocated memory is still 307.8 MB. Free memory was 256.6 MB in the beginning and 254.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 05:23:31,232 INFO L168 Benchmark]: RCFGBuilder took 306.73 ms. Allocated memory is still 307.8 MB. Free memory was 254.6 MB in the beginning and 234.9 MB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 5.3 GB. [2018-01-25 05:23:31,232 INFO L168 Benchmark]: TraceAbstraction took 46146.21 ms. Allocated memory was 307.8 MB in the beginning and 731.4 MB in the end (delta: 423.6 MB). Free memory was 234.9 MB in the beginning and 476.6 MB in the end (delta: -241.7 MB). Peak memory consumption was 181.9 MB. Max. memory is 5.3 GB. [2018-01-25 05:23:31,234 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.17 ms. Allocated memory is still 307.8 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 222.99 ms. Allocated memory is still 307.8 MB. Free memory was 266.8 MB in the beginning and 256.6 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.81 ms. Allocated memory is still 307.8 MB. Free memory was 256.6 MB in the beginning and 254.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 306.73 ms. Allocated memory is still 307.8 MB. Free memory was 254.6 MB in the beginning and 234.9 MB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 46146.21 ms. Allocated memory was 307.8 MB in the beginning and 731.4 MB in the end (delta: 423.6 MB). Free memory was 234.9 MB in the beginning and 476.6 MB in the end (delta: -241.7 MB). Peak memory consumption was 181.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 29 LocStat_MAX_WEQGRAPH_SIZE : 5 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 352 LocStat_NO_SUPPORTING_DISEQUALITIES : 78 LocStat_NO_DISJUNCTIONS : -58 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 36 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 78 TransStat_NO_SUPPORTING_DISEQUALITIES : 8 TransStat_NO_DISJUNCTIONS : 41 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 2.097691 RENAME_VARIABLES(MILLISECONDS) : 0.439190 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 2.046482 PROJECTAWAY(MILLISECONDS) : 1.244214 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.088696 DISJOIN(MILLISECONDS) : 0.525290 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.471552 ADD_EQUALITY(MILLISECONDS) : 0.019490 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.009546 #CONJOIN_DISJUNCTIVE : 103 #RENAME_VARIABLES : 179 #UNFREEZE : 0 #CONJOIN : 175 #PROJECTAWAY : 136 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 25 #RENAME_VARIABLES_DISJUNCTIVE : 157 #ADD_EQUALITY : 77 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 6 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 29 LocStat_MAX_WEQGRAPH_SIZE : 5 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 346 LocStat_NO_SUPPORTING_DISEQUALITIES : 78 LocStat_NO_DISJUNCTIONS : -58 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 36 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 78 TransStat_NO_SUPPORTING_DISEQUALITIES : 8 TransStat_NO_DISJUNCTIONS : 41 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 2.404483 RENAME_VARIABLES(MILLISECONDS) : 0.473176 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 2.319649 PROJECTAWAY(MILLISECONDS) : 1.186795 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.071149 DISJOIN(MILLISECONDS) : 0.514317 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.507106 ADD_EQUALITY(MILLISECONDS) : 0.032975 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.012235 #CONJOIN_DISJUNCTIVE : 103 #RENAME_VARIABLES : 179 #UNFREEZE : 0 #CONJOIN : 175 #PROJECTAWAY : 136 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 25 #RENAME_VARIABLES_DISJUNCTIVE : 157 #ADD_EQUALITY : 77 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 6 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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 #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 #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 #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 #length - 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 #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 #length - 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 #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 #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 #length - 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 #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 * 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: 555]: all allocated memory was freed For all program executions holds that all allocated memory was freed 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 - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - InvariantResult [Line: 545]: Loop Invariant [2018-01-25 05:23:31,250 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-25 05:23:31,250 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-25 05:23:31,250 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-25 05:23:31,250 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-25 05:23:31,251 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,251 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,251 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,252 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,252 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,252 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,252 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,253 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,253 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,253 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,253 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,254 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,254 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-25 05:23:31,254 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-25 05:23:31,254 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-25 05:23:31,254 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-25 05:23:31,255 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:23:31,255 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-25 05:23:31,255 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-25 05:23:31,255 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:23:31,256 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:23:31,256 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-25 05:23:31,256 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,256 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,256 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,257 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,257 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-25 05:23:31,257 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-25 05:23:31,257 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-25 05:23:31,258 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-25 05:23:31,258 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,258 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,258 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,258 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,258 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-25 05:23:31,258 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-25 05:23:31,259 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-25 05:23:31,259 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-25 05:23:31,259 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,259 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,259 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,259 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,259 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,260 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,260 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,260 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,260 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:23:31,260 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 05:23:31,260 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:23:31,260 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:23:31,260 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 05:23:31,261 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 05:23:31,261 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,261 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,261 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,261 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,261 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,261 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:31,261 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,261 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,262 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,262 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:31,262 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:31,262 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,262 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,262 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:31,262 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,263 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:31,263 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,263 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,263 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:31,263 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,263 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:31,263 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,264 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:31,264 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,264 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:31,264 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,264 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:31,264 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,264 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,264 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,265 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:31,265 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,265 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:31,265 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,265 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,265 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:31,265 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,265 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,266 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,266 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:31,266 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,266 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,266 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:31,266 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,266 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:31,266 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,270 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-25 05:23:31,270 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-25 05:23:31,270 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-25 05:23:31,271 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-25 05:23:31,271 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,271 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,272 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,272 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,272 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,272 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,273 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,273 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,273 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,273 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,274 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,274 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,274 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-25 05:23:31,274 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-25 05:23:31,275 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-25 05:23:31,275 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-25 05:23:31,275 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:23:31,275 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-25 05:23:31,275 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-25 05:23:31,276 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:23:31,276 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-25 05:23:31,276 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-25 05:23:31,276 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,276 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,277 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,277 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,277 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-25 05:23:31,277 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-25 05:23:31,278 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-25 05:23:31,278 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-25 05:23:31,278 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,278 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,278 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,279 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,279 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-25 05:23:31,279 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-25 05:23:31,279 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-25 05:23:31,279 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-25 05:23:31,280 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,280 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,280 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,280 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,281 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,281 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,281 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,281 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,281 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:23:31,282 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 05:23:31,282 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:23:31,282 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:23:31,282 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 05:23:31,282 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 05:23:31,282 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,283 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,283 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,283 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-25 05:23:31,283 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,283 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:31,283 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,284 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,284 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,284 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:31,284 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:31,284 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,285 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,285 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:31,285 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,285 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:31,286 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,286 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,286 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:31,286 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,287 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:31,287 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,287 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:31,287 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,288 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:31,288 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,288 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:31,288 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,288 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,289 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,289 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:31,289 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,289 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:31,289 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,290 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,290 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:31,290 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,290 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,291 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,291 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:31,291 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,291 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,291 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:31,292 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:31,292 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:31,292 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((unknown-#length-unknown[s1] < 1 || !(0 == s1)) || !(1 == \valid[s2])) || !(0 == unknown-#memory_int-unknown[s1][s1])) || unknown-#length-unknown[s2] < 1) || !(\valid[s1] == 1)) || !(0 == s2)) || ((((((s2 == 0 && s1 == 0) && 1 == \valid[s1]) && 1 <= unknown-#length-unknown[s1]) && 1 <= unknown-#length-unknown[s2]) && 0 == unknown-#memory_int-unknown[s1][s1]) && 1 == \valid[s2])) && (((((((((((((((((((2 <= s2 && (\exists main_~nondetString2~4.offset : int, main_~nondetString2~4.base : int :: unknown-#memory_int-unknown[main_~nondetString2~4.base][unknown-#length-unknown[main_~nondetString2~4.base] + main_~nondetString2~4.offset + -1] == 0 && !(main_~nondetString2~4.base == s1))) && 2 <= s1) && s2 + 1 <= unknown-#length-unknown[s2]) && 1 == \valid[s1]) && (\exists v_main_~nondetString1~4.offset_BEFORE_CALL_5 : int :: ((v_main_~nondetString1~4.offset_BEFORE_CALL_5 <= 0 && v_main_~nondetString1~4.offset_BEFORE_CALL_5 + 1 <= s1) && 0 <= v_main_~nondetString1~4.offset_BEFORE_CALL_5) && unknown-#memory_int-unknown[s1][v_main_~nondetString1~4.offset_BEFORE_CALL_5 + unknown-#length-unknown[s1] + -1] == 0)) && (\exists v_main_~nondetString2~4.offset_BEFORE_CALL_5 : int :: ((v_main_~nondetString2~4.offset_BEFORE_CALL_5 <= 0 && v_main_~nondetString2~4.offset_BEFORE_CALL_5 + 1 <= s2) && 0 <= v_main_~nondetString2~4.offset_BEFORE_CALL_5) && unknown-#memory_int-unknown[s2][v_main_~nondetString2~4.offset_BEFORE_CALL_5 + unknown-#length-unknown[s2] + -1] == 0)) && s1 + 1 <= unknown-#length-unknown[s1]) && 1 == \valid[s2]) || !(\exists v_main_~nondetString2~4.offset_BEFORE_CALL_5 : int :: ((v_main_~nondetString2~4.offset_BEFORE_CALL_5 <= 0 && unknown-#memory_int-unknown[s2][v_main_~nondetString2~4.offset_BEFORE_CALL_5 + unknown-#length-unknown[s2] + -1] == 0) && 0 <= v_main_~nondetString2~4.offset_BEFORE_CALL_5) && v_main_~nondetString2~4.offset_BEFORE_CALL_5 <= s2)) || !(1 == \valid[s2])) || !(\exists main_~nondetString2~4.offset : int, main_~nondetString2~4.base : int :: 0 == unknown-#memory_int-unknown[main_~nondetString2~4.base][main_~nondetString2~4.offset + unknown-#length-unknown[main_~nondetString2~4.base] + -1] && !(main_~nondetString2~4.base == s1))) || !(\exists main_~length2~4 : int, v_main_~nondetString2~4.offset_BEFORE_CALL_3 : int :: ((unknown-#memory_int-unknown[s2][main_~length2~4 + v_main_~nondetString2~4.offset_BEFORE_CALL_3 + -1] == 0 && s2 <= v_main_~nondetString2~4.offset_BEFORE_CALL_3) && 1 <= main_~length2~4) && main_~length2~4 + v_main_~nondetString2~4.offset_BEFORE_CALL_3 <= unknown-#length-unknown[s2])) || !(\valid[s1] == 1)) || !(0 == s1)) || (((((((((\exists v_main_~nondetString1~4.offset_BEFORE_CALL_5 : int :: ((v_main_~nondetString1~4.offset_BEFORE_CALL_5 <= 0 && v_main_~nondetString1~4.offset_BEFORE_CALL_5 <= s1) && 0 <= v_main_~nondetString1~4.offset_BEFORE_CALL_5) && unknown-#memory_int-unknown[s1][v_main_~nondetString1~4.offset_BEFORE_CALL_5 + unknown-#length-unknown[s1] + -1] == 0) && (\exists main_~nondetString2~4.offset : int, main_~nondetString2~4.base : int :: unknown-#memory_int-unknown[main_~nondetString2~4.base][unknown-#length-unknown[main_~nondetString2~4.base] + main_~nondetString2~4.offset + -1] == 0 && !(main_~nondetString2~4.base == s1))) && s2 == 0) && s1 == 0) && 1 == \valid[s1]) && 1 <= unknown-#length-unknown[s1]) && 1 <= unknown-#length-unknown[s2]) && (\exists v_main_~nondetString2~4.offset_BEFORE_CALL_5 : int :: ((v_main_~nondetString2~4.offset_BEFORE_CALL_5 <= 0 && v_main_~nondetString2~4.offset_BEFORE_CALL_5 <= s2) && 0 <= v_main_~nondetString2~4.offset_BEFORE_CALL_5) && unknown-#memory_int-unknown[s2][v_main_~nondetString2~4.offset_BEFORE_CALL_5 + unknown-#length-unknown[s2] + -1] == 0)) && 1 == \valid[s2])) || (((((((((\exists main_~nondetString2~4.offset : int, main_~nondetString2~4.base : int :: unknown-#memory_int-unknown[main_~nondetString2~4.base][unknown-#length-unknown[main_~nondetString2~4.base] + main_~nondetString2~4.offset + -1] == 0 && !(main_~nondetString2~4.base == s1)) && s2 + 1 <= unknown-#length-unknown[s2]) && 1 == \valid[s1]) && (\exists v_main_~nondetString1~4.offset_BEFORE_CALL_5 : int :: ((v_main_~nondetString1~4.offset_BEFORE_CALL_5 <= 0 && v_main_~nondetString1~4.offset_BEFORE_CALL_5 + 1 <= s1) && 0 <= v_main_~nondetString1~4.offset_BEFORE_CALL_5) && unknown-#memory_int-unknown[s1][v_main_~nondetString1~4.offset_BEFORE_CALL_5 + unknown-#length-unknown[s1] + -1] == 0)) && (s1 + 2 <= unknown-#length-unknown[s1] || 1 == s1)) && (s2 + 2 <= unknown-#length-unknown[s2] || 1 == s2)) && (\exists v_main_~nondetString2~4.offset_BEFORE_CALL_5 : int :: ((v_main_~nondetString2~4.offset_BEFORE_CALL_5 <= 0 && v_main_~nondetString2~4.offset_BEFORE_CALL_5 + 1 <= s2) && 0 <= v_main_~nondetString2~4.offset_BEFORE_CALL_5) && unknown-#memory_int-unknown[s2][v_main_~nondetString2~4.offset_BEFORE_CALL_5 + unknown-#length-unknown[s2] + -1] == 0)) && s1 + 1 <= unknown-#length-unknown[s1]) && 1 == \valid[s2])) || !(\exists v_main_~nondetString1~4.offset_BEFORE_CALL_2 : int, main_~length1~4 : int :: ((unknown-#memory_int-unknown[s1][v_main_~nondetString1~4.offset_BEFORE_CALL_2 + main_~length1~4 + -1] == 0 && s1 <= v_main_~nondetString1~4.offset_BEFORE_CALL_2) && v_main_~nondetString1~4.offset_BEFORE_CALL_2 + main_~length1~4 <= unknown-#length-unknown[s1]) && 1 <= main_~length1~4)) || !(\exists v_main_~nondetString1~4.offset_BEFORE_CALL_5 : int :: ((0 == unknown-#memory_int-unknown[s1][v_main_~nondetString1~4.offset_BEFORE_CALL_5 + unknown-#length-unknown[s1] + -1] && v_main_~nondetString1~4.offset_BEFORE_CALL_5 <= 0) && 0 <= v_main_~nondetString1~4.offset_BEFORE_CALL_5) && v_main_~nondetString1~4.offset_BEFORE_CALL_5 <= s1)) || !(0 == s2)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 61 locations, 15 error locations. SAFE Result, 46.0s OverallTime, 16 OverallIterations, 3 TraceHistogramMax, 7.0s AutomataDifference, 0.0s DeadEndRemovalTime, 17.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 670 SDtfs, 1048 SDslu, 2488 SDs, 0 SdLazy, 2205 SolverSat, 128 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 808 GetRequests, 472 SyntacticMatches, 18 SemanticMatches, 318 ConstructedPredicates, 0 IntricatePredicates, 6 DeprecatedPredicates, 3811 ImplicationChecksByTransitivity, 17.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.3s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 32 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 14 NumberOfFragments, 756 HoareAnnotationTreeSize, 9 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 1107 FormulaSimplificationTreeSizeReductionInter, 17.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 17.0s InterpolantComputationTime, 730 NumberOfCodeBlocks, 730 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1010 ConstructedInterpolants, 208 QuantifiedInterpolants, 693612 SizeOfPredicates, 136 NumberOfNonLiveVariables, 1308 ConjunctsInSsa, 259 ConjunctsInUnsatCore, 32 InterpolantComputations, 12 PerfectInterpolantSequences, 47/256 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/cstrncmp-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-23-31-298.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrncmp-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-23-31-298.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrncmp-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-23-31-298.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrncmp-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-23-31-298.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrncmp-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-23-31-298.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrncmp-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-23-31-298.csv Received shutdown request...