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_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/array-memsafety/cstrncmp-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e [2018-01-31 08:22:17,559 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 08:22:17,649 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 08:22:17,669 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 08:22:17,669 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 08:22:17,670 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 08:22:17,671 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 08:22:17,675 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 08:22:17,677 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 08:22:17,678 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 08:22:17,683 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 08:22:17,683 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 08:22:17,684 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 08:22:17,685 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 08:22:17,686 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 08:22:17,690 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 08:22:17,692 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 08:22:17,694 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 08:22:17,695 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 08:22:17,700 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 08:22:17,703 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 08:22:17,703 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 08:22:17,703 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 08:22:17,704 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 08:22:17,709 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 08:22:17,711 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 08:22:17,711 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 08:22:17,711 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 08:22:17,711 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 08:22:17,712 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 08:22:17,712 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 08:22:17,712 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-31 08:22:17,732 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 08:22:17,732 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 08:22:17,733 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 08:22:17,733 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 08:22:17,733 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 08:22:17,733 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 08:22:17,733 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 08:22:17,734 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 08:22:17,735 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 08:22:17,735 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 08:22:17,736 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 08:22:17,736 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 08:22:17,736 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 08:22:17,736 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 08:22:17,736 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 08:22:17,736 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 08:22:17,736 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 08:22:17,737 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 08:22:17,737 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 08:22:17,737 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 08:22:17,737 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 08:22:17,737 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 08:22:17,738 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 08:22:17,738 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 08:22:17,738 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 08:22:17,738 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 08:22:17,738 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 08:22:17,738 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 08:22:17,739 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 08:22:17,739 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 08:22:17,740 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 08:22:17,740 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 08:22:17,741 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 08:22:17,741 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 08:22:17,796 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 08:22:17,811 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 08:22:17,816 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 08:22:17,818 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 08:22:17,818 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 08:22:17,819 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-31 08:22:18,014 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 08:22:18,022 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-31 08:22:18,023 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 08:22:18,024 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 08:22:18,031 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 08:22:18,032 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:22:18" (1/1) ... [2018-01-31 08:22:18,036 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52b312c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:22:18, skipping insertion in model container [2018-01-31 08:22:18,037 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:22:18" (1/1) ... [2018-01-31 08:22:18,057 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:22:18,117 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:22:18,280 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:22:18,310 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:22:18,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:22:18 WrapperNode [2018-01-31 08:22:18,319 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 08:22:18,320 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 08:22:18,320 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 08:22:18,322 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 08:22:18,337 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:22:18" (1/1) ... [2018-01-31 08:22:18,338 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:22:18" (1/1) ... [2018-01-31 08:22:18,349 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:22:18" (1/1) ... [2018-01-31 08:22:18,350 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:22:18" (1/1) ... [2018-01-31 08:22:18,355 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:22:18" (1/1) ... [2018-01-31 08:22:18,359 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:22:18" (1/1) ... [2018-01-31 08:22:18,361 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:22:18" (1/1) ... [2018-01-31 08:22:18,363 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 08:22:18,363 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 08:22:18,363 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 08:22:18,363 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 08:22:18,365 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:22:18" (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-31 08:22:18,430 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 08:22:18,431 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 08:22:18,431 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncmp [2018-01-31 08:22:18,431 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 08:22:18,431 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-31 08:22:18,431 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-31 08:22:18,432 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 08:22:18,432 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 08:22:18,432 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 08:22:18,432 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-31 08:22:18,432 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncmp [2018-01-31 08:22:18,432 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 08:22:18,433 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 08:22:18,433 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 08:22:19,062 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 08:22:19,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:22:19 BoogieIcfgContainer [2018-01-31 08:22:19,063 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 08:22:19,064 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 08:22:19,064 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 08:22:19,068 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 08:22:19,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 08:22:18" (1/3) ... [2018-01-31 08:22:19,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ce2b478 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:22:19, skipping insertion in model container [2018-01-31 08:22:19,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:22:18" (2/3) ... [2018-01-31 08:22:19,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ce2b478 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:22:19, skipping insertion in model container [2018-01-31 08:22:19,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:22:19" (3/3) ... [2018-01-31 08:22:19,071 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-01-31 08:22:19,080 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 08:22:19,089 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-31 08:22:19,144 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 08:22:19,145 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 08:22:19,145 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 08:22:19,145 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 08:22:19,145 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 08:22:19,145 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 08:22:19,145 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 08:22:19,145 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 08:22:19,146 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 08:22:19,170 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states. [2018-01-31 08:22:19,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-31 08:22:19,179 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:22:19,182 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:22:19,182 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-31 08:22:19,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1207845215, now seen corresponding path program 1 times [2018-01-31 08:22:19,189 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:22:19,190 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:22:19,253 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:22:19,253 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:22:19,253 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:22:19,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:22:19,349 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:22:19,921 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-31 08:22:19,923 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:22:19,923 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:22:19,924 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:22:20,028 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:22:20,029 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:22:20,032 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 6 states. [2018-01-31 08:22:20,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:22:20,358 INFO L93 Difference]: Finished difference Result 134 states and 142 transitions. [2018-01-31 08:22:20,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:22:20,362 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-31 08:22:20,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:22:20,378 INFO L225 Difference]: With dead ends: 134 [2018-01-31 08:22:20,378 INFO L226 Difference]: Without dead ends: 99 [2018-01-31 08:22:20,381 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-31 08:22:20,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-01-31 08:22:20,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-01-31 08:22:20,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-31 08:22:20,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions. [2018-01-31 08:22:20,424 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 19 [2018-01-31 08:22:20,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:22:20,425 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 106 transitions. [2018-01-31 08:22:20,425 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:22:20,425 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2018-01-31 08:22:20,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-31 08:22:20,426 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:22:20,426 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:22:20,426 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-31 08:22:20,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1211504027, now seen corresponding path program 1 times [2018-01-31 08:22:20,427 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:22:20,427 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:22:20,428 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:22:20,429 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:22:20,429 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:22:20,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:22:20,450 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:22:20,579 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-31 08:22:20,579 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:22:20,579 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 08:22:20,581 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 08:22:20,585 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 08:22:20,586 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 08:22:20,586 INFO L87 Difference]: Start difference. First operand 99 states and 106 transitions. Second operand 4 states. [2018-01-31 08:22:20,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:22:20,729 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2018-01-31 08:22:20,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-31 08:22:20,730 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-01-31 08:22:20,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:22:20,731 INFO L225 Difference]: With dead ends: 99 [2018-01-31 08:22:20,731 INFO L226 Difference]: Without dead ends: 98 [2018-01-31 08:22:20,732 INFO L554 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-31 08:22:20,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-31 08:22:20,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-01-31 08:22:20,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-31 08:22:20,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2018-01-31 08:22:20,743 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 20 [2018-01-31 08:22:20,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:22:20,747 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2018-01-31 08:22:20,747 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 08:22:20,747 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2018-01-31 08:22:20,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-31 08:22:20,748 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:22:20,748 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:22:20,748 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-31 08:22:20,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1211504026, now seen corresponding path program 1 times [2018-01-31 08:22:20,749 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:22:20,749 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:22:20,749 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:22:20,750 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:22:20,750 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:22:20,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:22:20,764 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:22:20,925 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-31 08:22:20,926 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:22:20,926 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 08:22:20,926 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 08:22:20,926 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 08:22:20,927 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:22:20,927 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand 5 states. [2018-01-31 08:22:21,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:22:21,105 INFO L93 Difference]: Finished difference Result 98 states and 105 transitions. [2018-01-31 08:22:21,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:22:21,108 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-31 08:22:21,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:22:21,110 INFO L225 Difference]: With dead ends: 98 [2018-01-31 08:22:21,110 INFO L226 Difference]: Without dead ends: 97 [2018-01-31 08:22:21,110 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:22:21,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-01-31 08:22:21,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-01-31 08:22:21,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-31 08:22:21,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2018-01-31 08:22:21,129 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 20 [2018-01-31 08:22:21,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:22:21,130 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2018-01-31 08:22:21,130 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 08:22:21,130 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2018-01-31 08:22:21,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-31 08:22:21,133 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:22:21,133 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:22:21,133 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-31 08:22:21,133 INFO L82 PathProgramCache]: Analyzing trace with hash -729468162, now seen corresponding path program 1 times [2018-01-31 08:22:21,134 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:22:21,134 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:22:21,135 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:22:21,135 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:22:21,135 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:22:21,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:22:21,177 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:22:21,393 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-31 08:22:21,393 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:22:21,393 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 08:22:21,394 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 08:22:21,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 08:22:21,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:22:21,395 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand 5 states. [2018-01-31 08:22:21,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:22:21,805 INFO L93 Difference]: Finished difference Result 132 states and 143 transitions. [2018-01-31 08:22:21,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 08:22:21,806 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-01-31 08:22:21,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:22:21,809 INFO L225 Difference]: With dead ends: 132 [2018-01-31 08:22:21,809 INFO L226 Difference]: Without dead ends: 129 [2018-01-31 08:22:21,810 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:22:21,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-01-31 08:22:21,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 116. [2018-01-31 08:22:21,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-01-31 08:22:21,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 129 transitions. [2018-01-31 08:22:21,821 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 129 transitions. Word has length 34 [2018-01-31 08:22:21,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:22:21,822 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 129 transitions. [2018-01-31 08:22:21,822 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 08:22:21,822 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 129 transitions. [2018-01-31 08:22:21,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-31 08:22:21,823 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:22:21,823 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:22:21,823 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-31 08:22:21,824 INFO L82 PathProgramCache]: Analyzing trace with hash -729468161, now seen corresponding path program 1 times [2018-01-31 08:22:21,824 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:22:21,824 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:22:21,828 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:22:21,828 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:22:21,829 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:22:21,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:22:21,845 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:22:21,974 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-31 08:22:21,974 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:22:21,975 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 08:22:21,975 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 08:22:21,975 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 08:22:21,975 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:22:21,976 INFO L87 Difference]: Start difference. First operand 116 states and 129 transitions. Second operand 8 states. [2018-01-31 08:22:22,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:22:22,425 INFO L93 Difference]: Finished difference Result 159 states and 175 transitions. [2018-01-31 08:22:22,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 08:22:22,425 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-01-31 08:22:22,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:22:22,427 INFO L225 Difference]: With dead ends: 159 [2018-01-31 08:22:22,427 INFO L226 Difference]: Without dead ends: 156 [2018-01-31 08:22:22,427 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-01-31 08:22:22,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-01-31 08:22:22,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 131. [2018-01-31 08:22:22,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-01-31 08:22:22,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 147 transitions. [2018-01-31 08:22:22,441 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 147 transitions. Word has length 34 [2018-01-31 08:22:22,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:22:22,444 INFO L432 AbstractCegarLoop]: Abstraction has 131 states and 147 transitions. [2018-01-31 08:22:22,445 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 08:22:22,445 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 147 transitions. [2018-01-31 08:22:22,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-31 08:22:22,446 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:22:22,446 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:22:22,446 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-31 08:22:22,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1138676500, now seen corresponding path program 1 times [2018-01-31 08:22:22,446 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:22:22,446 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:22:22,447 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:22:22,447 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:22:22,447 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:22:22,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:22:22,463 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:22:22,529 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-31 08:22:22,529 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:22:22,529 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 08:22:22,529 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 08:22:22,530 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 08:22:22,530 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:22:22,530 INFO L87 Difference]: Start difference. First operand 131 states and 147 transitions. Second operand 5 states. [2018-01-31 08:22:22,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:22:22,649 INFO L93 Difference]: Finished difference Result 154 states and 167 transitions. [2018-01-31 08:22:22,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 08:22:22,705 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-01-31 08:22:22,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:22:22,706 INFO L225 Difference]: With dead ends: 154 [2018-01-31 08:22:22,707 INFO L226 Difference]: Without dead ends: 152 [2018-01-31 08:22:22,707 INFO L554 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-31 08:22:22,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-01-31 08:22:22,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 134. [2018-01-31 08:22:22,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-01-31 08:22:22,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 150 transitions. [2018-01-31 08:22:22,720 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 150 transitions. Word has length 35 [2018-01-31 08:22:22,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:22:22,726 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 150 transitions. [2018-01-31 08:22:22,726 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 08:22:22,726 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 150 transitions. [2018-01-31 08:22:22,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-31 08:22:22,727 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:22:22,727 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:22:22,727 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-31 08:22:22,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1138676499, now seen corresponding path program 1 times [2018-01-31 08:22:22,728 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:22:22,728 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:22:22,729 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:22:22,729 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:22:22,729 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:22:22,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:22:22,743 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:22:22,905 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-31 08:22:22,906 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:22:22,906 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 08:22:22,906 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 08:22:22,906 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 08:22:22,906 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:22:22,906 INFO L87 Difference]: Start difference. First operand 134 states and 150 transitions. Second operand 8 states. [2018-01-31 08:22:23,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:22:23,177 INFO L93 Difference]: Finished difference Result 160 states and 177 transitions. [2018-01-31 08:22:23,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 08:22:23,177 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2018-01-31 08:22:23,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:22:23,178 INFO L225 Difference]: With dead ends: 160 [2018-01-31 08:22:23,179 INFO L226 Difference]: Without dead ends: 158 [2018-01-31 08:22:23,179 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-31 08:22:23,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-01-31 08:22:23,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 137. [2018-01-31 08:22:23,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-01-31 08:22:23,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 152 transitions. [2018-01-31 08:22:23,188 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 152 transitions. Word has length 35 [2018-01-31 08:22:23,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:22:23,188 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 152 transitions. [2018-01-31 08:22:23,188 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 08:22:23,188 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 152 transitions. [2018-01-31 08:22:23,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-31 08:22:23,190 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:22:23,190 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:22:23,190 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-31 08:22:23,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1282170852, now seen corresponding path program 1 times [2018-01-31 08:22:23,190 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:22:23,191 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:22:23,191 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:22:23,191 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:22:23,192 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:22:23,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:22:23,207 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:22:23,403 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-31 08:22:23,404 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:22:23,404 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:22:23,404 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:22:23,405 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:22:23,405 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:22:23,405 INFO L87 Difference]: Start difference. First operand 137 states and 152 transitions. Second operand 6 states. [2018-01-31 08:22:23,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:22:23,777 INFO L93 Difference]: Finished difference Result 137 states and 152 transitions. [2018-01-31 08:22:23,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 08:22:23,777 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-01-31 08:22:23,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:22:23,779 INFO L225 Difference]: With dead ends: 137 [2018-01-31 08:22:23,779 INFO L226 Difference]: Without dead ends: 106 [2018-01-31 08:22:23,780 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:22:23,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-01-31 08:22:23,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-01-31 08:22:23,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-01-31 08:22:23,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2018-01-31 08:22:23,786 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 40 [2018-01-31 08:22:23,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:22:23,787 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2018-01-31 08:22:23,787 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:22:23,787 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2018-01-31 08:22:23,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-31 08:22:23,789 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:22:23,789 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:22:23,789 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-31 08:22:23,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1572396171, now seen corresponding path program 1 times [2018-01-31 08:22:23,790 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:22:23,790 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:22:23,791 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:22:23,791 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:22:23,791 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:22:23,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:22:23,805 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:22:23,843 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:22:23,843 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:22:23,843 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 08:22:23,843 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-31 08:22:23,843 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-31 08:22:23,844 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 08:22:23,844 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand 3 states. [2018-01-31 08:22:23,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:22:23,853 INFO L93 Difference]: Finished difference Result 166 states and 181 transitions. [2018-01-31 08:22:23,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-31 08:22:23,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2018-01-31 08:22:23,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:22:23,855 INFO L225 Difference]: With dead ends: 166 [2018-01-31 08:22:23,855 INFO L226 Difference]: Without dead ends: 98 [2018-01-31 08:22:23,856 INFO L554 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-31 08:22:23,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-31 08:22:23,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-01-31 08:22:23,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-31 08:22:23,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2018-01-31 08:22:23,861 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 55 [2018-01-31 08:22:23,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:22:23,861 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2018-01-31 08:22:23,861 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-31 08:22:23,862 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2018-01-31 08:22:23,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-31 08:22:23,862 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:22:23,862 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:22:23,863 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-31 08:22:23,863 INFO L82 PathProgramCache]: Analyzing trace with hash -669931078, now seen corresponding path program 1 times [2018-01-31 08:22:23,863 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:22:23,863 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:22:23,864 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:22:23,864 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:22:23,865 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:22:23,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:22:23,880 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:22:23,954 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:22:23,954 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:22:23,955 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 08:22:23,955 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-31 08:22:23,955 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-31 08:22:23,956 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 08:22:23,956 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand 3 states. [2018-01-31 08:22:24,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:22:24,027 INFO L93 Difference]: Finished difference Result 151 states and 160 transitions. [2018-01-31 08:22:24,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-31 08:22:24,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-01-31 08:22:24,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:22:24,029 INFO L225 Difference]: With dead ends: 151 [2018-01-31 08:22:24,029 INFO L226 Difference]: Without dead ends: 98 [2018-01-31 08:22:24,030 INFO L554 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-31 08:22:24,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-31 08:22:24,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-01-31 08:22:24,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-31 08:22:24,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 102 transitions. [2018-01-31 08:22:24,048 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 102 transitions. Word has length 58 [2018-01-31 08:22:24,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:22:24,048 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 102 transitions. [2018-01-31 08:22:24,048 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-31 08:22:24,048 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 102 transitions. [2018-01-31 08:22:24,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-31 08:22:24,050 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:22:24,050 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:22:24,050 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-31 08:22:24,050 INFO L82 PathProgramCache]: Analyzing trace with hash 335034965, now seen corresponding path program 1 times [2018-01-31 08:22:24,050 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:22:24,050 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:22:24,051 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:22:24,051 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:22:24,051 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:22:24,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:22:24,069 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:22:24,238 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:22:24,239 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:22:24,239 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 08:22:24,239 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 08:22:24,240 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 08:22:24,240 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 08:22:24,240 INFO L87 Difference]: Start difference. First operand 98 states and 102 transitions. Second operand 4 states. [2018-01-31 08:22:24,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:22:24,418 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2018-01-31 08:22:24,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-31 08:22:24,418 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-01-31 08:22:24,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:22:24,419 INFO L225 Difference]: With dead ends: 98 [2018-01-31 08:22:24,419 INFO L226 Difference]: Without dead ends: 96 [2018-01-31 08:22:24,420 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:22:24,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-01-31 08:22:24,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-01-31 08:22:24,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-31 08:22:24,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2018-01-31 08:22:24,425 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 60 [2018-01-31 08:22:24,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:22:24,425 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2018-01-31 08:22:24,425 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 08:22:24,426 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-01-31 08:22:24,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-31 08:22:24,427 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:22:24,427 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:22:24,427 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-31 08:22:24,427 INFO L82 PathProgramCache]: Analyzing trace with hash 335034966, now seen corresponding path program 1 times [2018-01-31 08:22:24,427 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:22:24,427 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:22:24,428 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:22:24,429 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:22:24,429 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:22:24,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:22:24,451 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:22:25,199 WARN L146 SmtUtils]: Spent 147ms on a formula simplification. DAG size of input: 30 DAG size of output 25 [2018-01-31 08:22:25,314 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:22:25,315 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:22:25,315 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:22:25,329 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:22:25,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:22:25,399 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:22:25,438 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-31 08:22:25,440 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:22:25,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:22:25,448 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 08:22:25,562 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:22:25,562 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:22:25,565 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-31 08:22:25,566 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:22:25,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:22:25,571 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-31 08:22:25,920 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-31 08:22:25,923 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-31 08:22:25,923 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:22:25,926 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:22:25,932 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-31 08:22:25,932 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-01-31 08:22:25,989 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-31 08:22:26,006 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-31 08:22:26,006 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:22:26,096 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:22:26,240 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-31 08:22:26,240 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-01-31 08:22:26,751 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-31 08:22:26,862 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-31 08:22:26,863 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 08:22:26,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-31 08:22:26,893 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 08:22:26,907 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:22:26,919 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-31 08:22:26,919 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:48, output treesize:33 [2018-01-31 08:22:27,415 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:22:27,435 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:22:27,435 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 27 [2018-01-31 08:22:27,435 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-31 08:22:27,436 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-31 08:22:27,436 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=684, Unknown=0, NotChecked=0, Total=756 [2018-01-31 08:22:27,436 INFO L87 Difference]: Start difference. First operand 96 states and 100 transitions. Second operand 28 states. [2018-01-31 08:22:27,836 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 32 DAG size of output 22 [2018-01-31 08:22:29,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:22:29,287 INFO L93 Difference]: Finished difference Result 152 states and 158 transitions. [2018-01-31 08:22:29,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-31 08:22:29,288 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 60 [2018-01-31 08:22:29,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:22:29,289 INFO L225 Difference]: With dead ends: 152 [2018-01-31 08:22:29,289 INFO L226 Difference]: Without dead ends: 149 [2018-01-31 08:22:29,290 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=225, Invalid=1415, Unknown=0, NotChecked=0, Total=1640 [2018-01-31 08:22:29,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-01-31 08:22:29,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 133. [2018-01-31 08:22:29,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-01-31 08:22:29,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 141 transitions. [2018-01-31 08:22:29,298 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 141 transitions. Word has length 60 [2018-01-31 08:22:29,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:22:29,299 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 141 transitions. [2018-01-31 08:22:29,299 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-31 08:22:29,299 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 141 transitions. [2018-01-31 08:22:29,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-31 08:22:29,300 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:22:29,300 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:22:29,300 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-31 08:22:29,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1796149365, now seen corresponding path program 1 times [2018-01-31 08:22:29,301 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:22:29,301 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:22:29,302 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:22:29,302 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:22:29,302 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:22:29,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:22:29,324 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:22:29,493 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:22:29,493 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:22:29,494 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 08:22:29,494 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 08:22:29,494 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 08:22:29,494 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 08:22:29,495 INFO L87 Difference]: Start difference. First operand 133 states and 141 transitions. Second operand 4 states. [2018-01-31 08:22:29,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:22:29,817 INFO L93 Difference]: Finished difference Result 133 states and 141 transitions. [2018-01-31 08:22:29,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-31 08:22:29,818 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2018-01-31 08:22:29,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:22:29,819 INFO L225 Difference]: With dead ends: 133 [2018-01-31 08:22:29,820 INFO L226 Difference]: Without dead ends: 131 [2018-01-31 08:22:29,820 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:22:29,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-01-31 08:22:29,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 118. [2018-01-31 08:22:29,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-31 08:22:29,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 124 transitions. [2018-01-31 08:22:29,830 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 124 transitions. Word has length 61 [2018-01-31 08:22:29,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:22:29,831 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 124 transitions. [2018-01-31 08:22:29,832 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 08:22:29,832 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 124 transitions. [2018-01-31 08:22:29,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-31 08:22:29,833 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:22:29,833 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:22:29,833 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-31 08:22:29,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1796149366, now seen corresponding path program 1 times [2018-01-31 08:22:29,833 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:22:29,834 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:22:29,834 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:22:29,834 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:22:29,835 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:22:29,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:22:29,861 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:22:30,275 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:22:30,276 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:22:30,276 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:22:30,285 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:22:30,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:22:30,331 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:22:30,380 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-31 08:22:30,392 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-31 08:22:30,392 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:22:30,394 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:22:30,399 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-31 08:22:30,399 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-01-31 08:22:30,818 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-31 08:22:30,824 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-31 08:22:30,825 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 08:22:30,840 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-31 08:22:30,840 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 08:22:30,841 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-31 08:22:30,842 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-31 08:22:30,865 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-31 08:22:30,866 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-01-31 08:22:31,151 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-31 08:22:31,231 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-31 08:22:31,231 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:42, output treesize:33 [2018-01-31 08:22:31,606 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:22:31,625 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:22:31,626 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 [2018-01-31 08:22:31,626 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-31 08:22:31,626 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-31 08:22:31,627 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=783, Unknown=0, NotChecked=0, Total=870 [2018-01-31 08:22:31,627 INFO L87 Difference]: Start difference. First operand 118 states and 124 transitions. Second operand 30 states. [2018-01-31 08:22:32,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:22:32,961 INFO L93 Difference]: Finished difference Result 132 states and 136 transitions. [2018-01-31 08:22:32,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-31 08:22:32,961 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 61 [2018-01-31 08:22:32,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:22:32,962 INFO L225 Difference]: With dead ends: 132 [2018-01-31 08:22:32,962 INFO L226 Difference]: Without dead ends: 121 [2018-01-31 08:22:32,963 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=307, Invalid=1855, Unknown=0, NotChecked=0, Total=2162 [2018-01-31 08:22:32,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-31 08:22:32,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 112. [2018-01-31 08:22:32,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-31 08:22:32,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 115 transitions. [2018-01-31 08:22:32,971 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 115 transitions. Word has length 61 [2018-01-31 08:22:32,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:22:32,972 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 115 transitions. [2018-01-31 08:22:32,972 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-31 08:22:32,972 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 115 transitions. [2018-01-31 08:22:32,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-01-31 08:22:32,973 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:22:32,974 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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-31 08:22:32,974 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-31 08:22:32,974 INFO L82 PathProgramCache]: Analyzing trace with hash -877841683, now seen corresponding path program 2 times [2018-01-31 08:22:32,974 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:22:32,974 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:22:32,975 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:22:32,975 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:22:32,975 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:22:33,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:22:33,011 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:22:33,768 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:22:33,768 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:22:33,849 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:22:33,854 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:22:33,876 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:22:33,886 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:22:33,889 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:22:33,894 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:22:33,901 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-31 08:22:33,901 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:22:33,906 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-31 08:22:33,906 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:22:33,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:22:33,910 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-31 08:22:33,950 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:22:33,981 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-31 08:22:33,981 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:22:34,015 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:22:34,016 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:22:34,016 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-31 08:22:34,016 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:22:34,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:22:34,021 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-31 08:22:34,069 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-31 08:22:34,071 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-31 08:22:34,071 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:22:34,073 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:22:34,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:22:34,078 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-01-31 08:22:34,110 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-31 08:22:34,112 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-31 08:22:34,112 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:22:34,117 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:22:34,123 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-31 08:22:34,124 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:35 [2018-01-31 08:22:35,160 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-31 08:22:35,171 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-31 08:22:35,171 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:22:35,407 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-31 08:22:35,408 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-31 08:22:35,479 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:22:35,511 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-31 08:22:35,511 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:54, output treesize:49 [2018-01-31 08:22:35,704 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 16 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:22:35,723 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:22:35,723 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 29 [2018-01-31 08:22:35,724 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-31 08:22:35,724 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-31 08:22:35,724 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=801, Unknown=0, NotChecked=0, Total=870 [2018-01-31 08:22:35,724 INFO L87 Difference]: Start difference. First operand 112 states and 115 transitions. Second operand 30 states. [2018-01-31 08:22:36,378 WARN L146 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 77 DAG size of output 52 [2018-01-31 08:22:37,187 WARN L146 SmtUtils]: Spent 742ms on a formula simplification. DAG size of input: 84 DAG size of output 60 [2018-01-31 08:22:38,798 WARN L146 SmtUtils]: Spent 184ms on a formula simplification. DAG size of input: 71 DAG size of output 52 [2018-01-31 08:22:39,044 WARN L146 SmtUtils]: Spent 139ms on a formula simplification. DAG size of input: 76 DAG size of output 56 [2018-01-31 08:22:39,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:22:39,995 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2018-01-31 08:22:39,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-31 08:22:39,995 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 86 [2018-01-31 08:22:39,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:22:39,996 INFO L225 Difference]: With dead ends: 118 [2018-01-31 08:22:39,996 INFO L226 Difference]: Without dead ends: 115 [2018-01-31 08:22:39,997 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=348, Invalid=2201, Unknown=1, NotChecked=0, Total=2550 [2018-01-31 08:22:39,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-01-31 08:22:40,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 102. [2018-01-31 08:22:40,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-01-31 08:22:40,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 105 transitions. [2018-01-31 08:22:40,003 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 105 transitions. Word has length 86 [2018-01-31 08:22:40,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:22:40,004 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 105 transitions. [2018-01-31 08:22:40,004 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-31 08:22:40,004 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2018-01-31 08:22:40,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-01-31 08:22:40,005 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:22:40,005 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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-31 08:22:40,005 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-31 08:22:40,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1443288385, now seen corresponding path program 2 times [2018-01-31 08:22:40,005 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:22:40,005 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:22:40,006 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:22:40,006 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:22:40,006 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:22:40,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:22:40,029 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:22:40,539 WARN L146 SmtUtils]: Spent 159ms on a formula simplification. DAG size of input: 16 DAG size of output 9 [2018-01-31 08:22:40,737 WARN L146 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 18 DAG size of output 17 [2018-01-31 08:22:41,034 WARN L146 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 37 DAG size of output 27 [2018-01-31 08:22:41,209 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:22:41,209 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:22:41,209 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:22:41,214 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:22:41,229 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:22:41,240 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:22:41,243 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:22:41,249 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:22:41,275 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-31 08:22:41,275 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:22:41,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:22:41,349 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 08:22:41,392 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-31 08:22:41,393 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-31 08:22:41,393 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:22:41,394 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:22:41,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:22:41,398 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-01-31 08:22:42,230 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-31 08:22:42,238 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 25 [2018-01-31 08:22:42,239 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 08:22:42,254 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-31 08:22:42,255 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 08:22:42,256 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-31 08:22:42,257 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-31 08:22:42,293 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-31 08:22:42,293 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-01-31 08:22:42,304 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-31 08:22:42,319 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-31 08:22:42,319 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:49, output treesize:49 [2018-01-31 08:22:42,440 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 16 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:22:42,460 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:22:42,460 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 30 [2018-01-31 08:22:42,461 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-01-31 08:22:42,461 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-01-31 08:22:42,461 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2018-01-31 08:22:42,461 INFO L87 Difference]: Start difference. First operand 102 states and 105 transitions. Second operand 31 states. [2018-01-31 08:22:44,123 WARN L146 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 50 DAG size of output 44 [2018-01-31 08:22:45,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:22:45,034 INFO L93 Difference]: Finished difference Result 122 states and 125 transitions. [2018-01-31 08:22:45,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-01-31 08:22:45,034 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 87 [2018-01-31 08:22:45,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:22:45,035 INFO L225 Difference]: With dead ends: 122 [2018-01-31 08:22:45,035 INFO L226 Difference]: Without dead ends: 0 [2018-01-31 08:22:45,036 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 708 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=538, Invalid=3368, Unknown=0, NotChecked=0, Total=3906 [2018-01-31 08:22:45,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-31 08:22:45,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-31 08:22:45,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-31 08:22:45,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-31 08:22:45,037 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 87 [2018-01-31 08:22:45,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:22:45,037 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-31 08:22:45,037 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-01-31 08:22:45,037 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-31 08:22:45,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-31 08:22:45,041 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-31 08:22:57,661 WARN L146 SmtUtils]: Spent 12550ms on a formula simplification. DAG size of input: 185 DAG size of output 140 [2018-01-31 08:22:57,763 INFO L399 ceAbstractionStarter]: For program point L1(lines 1 569) no Hoare annotation was computed. [2018-01-31 08:22:57,764 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 569) no Hoare annotation was computed. [2018-01-31 08:22:57,764 INFO L395 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 569) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-31 08:22:57,764 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 569) no Hoare annotation was computed. [2018-01-31 08:22:57,764 INFO L402 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 569) the Hoare annotation is: true [2018-01-31 08:22:57,764 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 569) no Hoare annotation was computed. [2018-01-31 08:22:57,764 INFO L402 ceAbstractionStarter]: At program point L1(lines 1 569) the Hoare annotation is: true [2018-01-31 08:22:57,764 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 569) no Hoare annotation was computed. [2018-01-31 08:22:57,765 INFO L399 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 569) no Hoare annotation was computed. [2018-01-31 08:22:57,765 INFO L399 ceAbstractionStarter]: For program point L565'''(line 565) no Hoare annotation was computed. [2018-01-31 08:22:57,765 INFO L399 ceAbstractionStarter]: For program point L561'(lines 561 563) no Hoare annotation was computed. [2018-01-31 08:22:57,765 INFO L399 ceAbstractionStarter]: For program point L564(line 564) no Hoare annotation was computed. [2018-01-31 08:22:57,765 INFO L399 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-01-31 08:22:57,765 INFO L395 ceAbstractionStarter]: At program point L568(line 568) the Hoare annotation is: (let ((.cse0 (select |#length| main_~nondetString2~4.base)) (.cse1 (select |#length| main_~nondetString1~4.base))) (and (= (select |#length| |main_#t~malloc14.base|) main_~length2~4) (not (= main_~nondetString2~4.base main_~nondetString1~4.base)) (= (select (select |#memory_int| main_~nondetString2~4.base) (+ .cse0 main_~nondetString2~4.offset (- 1))) 0) (= (select |#valid| |main_#t~malloc13.base|) 1) (<= 1 main_~length2~4) (= main_~nondetString2~4.offset 0) (= |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)) (= main_~length2~4 .cse0) (= 0 |main_#t~malloc13.offset|) (<= (+ main_~nondetString1~4.offset 1) .cse1) (= main_~length1~4 (select |#length| |main_#t~malloc13.base|)) (= 0 |main_#t~malloc14.offset|) (= main_~nondetString1~4.offset 0) (= 1 (select |#valid| |main_#t~malloc14.base|)) (= 1 (select |#valid| main_~nondetString2~4.base)) (= .cse1 main_~length1~4) (not (= |main_#t~malloc14.base| main_~nondetString1~4.base)) (= (select (select |#memory_int| main_~nondetString1~4.base) (+ main_~nondetString1~4.offset .cse1 (- 1))) 0) (not (= |main_#t~malloc13.base| |main_#t~malloc14.base|)) (= 1 (select |#valid| main_~nondetString1~4.base)))) [2018-01-31 08:22:57,765 INFO L399 ceAbstractionStarter]: For program point L567(line 567) no Hoare annotation was computed. [2018-01-31 08:22:57,766 INFO L399 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-01-31 08:22:57,766 INFO L399 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-01-31 08:22:57,766 INFO L399 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 569) no Hoare annotation was computed. [2018-01-31 08:22:57,766 INFO L399 ceAbstractionStarter]: For program point mainErr2RequiresViolation(lines 1 569) no Hoare annotation was computed. [2018-01-31 08:22:57,767 INFO L399 ceAbstractionStarter]: For program point L558''(lines 558 560) no Hoare annotation was computed. [2018-01-31 08:22:57,767 INFO L399 ceAbstractionStarter]: For program point L566'(line 566) no Hoare annotation was computed. [2018-01-31 08:22:57,767 INFO L399 ceAbstractionStarter]: For program point L556'(line 556) no Hoare annotation was computed. [2018-01-31 08:22:57,767 INFO L399 ceAbstractionStarter]: For program point L568'(line 568) no Hoare annotation was computed. [2018-01-31 08:22:57,767 INFO L399 ceAbstractionStarter]: For program point L557''(line 557) no Hoare annotation was computed. [2018-01-31 08:22:57,768 INFO L399 ceAbstractionStarter]: For program point L568'''(line 568) no Hoare annotation was computed. [2018-01-31 08:22:57,768 INFO L399 ceAbstractionStarter]: For program point mainErr3RequiresViolation(lines 1 569) no Hoare annotation was computed. [2018-01-31 08:22:57,768 INFO L399 ceAbstractionStarter]: For program point L564'(line 564) no Hoare annotation was computed. [2018-01-31 08:22:57,768 INFO L399 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-01-31 08:22:57,768 INFO L399 ceAbstractionStarter]: For program point mainFINAL(lines 555 569) no Hoare annotation was computed. [2018-01-31 08:22:57,768 INFO L399 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-01-31 08:22:57,768 INFO L399 ceAbstractionStarter]: For program point mainErr4EnsuresViolation(lines 555 569) no Hoare annotation was computed. [2018-01-31 08:22:57,768 INFO L399 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-01-31 08:22:57,768 INFO L399 ceAbstractionStarter]: For program point L558(lines 558 560) no Hoare annotation was computed. [2018-01-31 08:22:57,768 INFO L399 ceAbstractionStarter]: For program point mainEXIT(lines 555 569) no Hoare annotation was computed. [2018-01-31 08:22:57,769 INFO L395 ceAbstractionStarter]: At program point mainENTRY(lines 555 569) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-31 08:22:57,769 INFO L399 ceAbstractionStarter]: For program point L564''(line 564) no Hoare annotation was computed. [2018-01-31 08:22:57,769 INFO L399 ceAbstractionStarter]: For program point L565'(line 565) no Hoare annotation was computed. [2018-01-31 08:22:57,769 INFO L399 ceAbstractionStarter]: For program point L557'(line 557) no Hoare annotation was computed. [2018-01-31 08:22:57,769 INFO L399 ceAbstractionStarter]: For program point L568''''(line 568) no Hoare annotation was computed. [2018-01-31 08:22:57,769 INFO L399 ceAbstractionStarter]: For program point L565''(line 565) no Hoare annotation was computed. [2018-01-31 08:22:57,769 INFO L399 ceAbstractionStarter]: For program point L568''(line 568) no Hoare annotation was computed. [2018-01-31 08:22:57,769 INFO L399 ceAbstractionStarter]: For program point L546''''''(line 546) no Hoare annotation was computed. [2018-01-31 08:22:57,769 INFO L399 ceAbstractionStarter]: For program point cstrncmpErr1RequiresViolation(lines 1 569) no Hoare annotation was computed. [2018-01-31 08:22:57,770 INFO L399 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-01-31 08:22:57,770 INFO L399 ceAbstractionStarter]: For program point L545''''''''''''''''(line 545) no Hoare annotation was computed. [2018-01-31 08:22:57,770 INFO L399 ceAbstractionStarter]: For program point L540(lines 540 554) no Hoare annotation was computed. [2018-01-31 08:22:57,770 INFO L399 ceAbstractionStarter]: For program point L553'(line 553) no Hoare annotation was computed. [2018-01-31 08:22:57,770 INFO L399 ceAbstractionStarter]: For program point L546(line 546) no Hoare annotation was computed. [2018-01-31 08:22:57,770 INFO L399 ceAbstractionStarter]: For program point L545(lines 545 550) no Hoare annotation was computed. [2018-01-31 08:22:57,770 INFO L399 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-01-31 08:22:57,770 INFO L399 ceAbstractionStarter]: For program point L543(lines 543 544) no Hoare annotation was computed. [2018-01-31 08:22:57,770 INFO L399 ceAbstractionStarter]: For program point L546'''''(line 546) no Hoare annotation was computed. [2018-01-31 08:22:57,770 INFO L399 ceAbstractionStarter]: For program point L549(line 549) no Hoare annotation was computed. [2018-01-31 08:22:57,771 INFO L399 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-01-31 08:22:57,771 INFO L399 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-01-31 08:22:57,771 INFO L399 ceAbstractionStarter]: For program point L552''(line 552) no Hoare annotation was computed. [2018-01-31 08:22:57,771 INFO L399 ceAbstractionStarter]: For program point cstrncmpErr0RequiresViolation(lines 1 569) no Hoare annotation was computed. [2018-01-31 08:22:57,771 INFO L399 ceAbstractionStarter]: For program point L545'''''''''''''''''(line 545) no Hoare annotation was computed. [2018-01-31 08:22:57,771 INFO L399 ceAbstractionStarter]: For program point L546'(line 546) no Hoare annotation was computed. [2018-01-31 08:22:57,772 INFO L399 ceAbstractionStarter]: For program point L545'''''(line 545) no Hoare annotation was computed. [2018-01-31 08:22:57,772 INFO L399 ceAbstractionStarter]: For program point L546''''(line 546) no Hoare annotation was computed. [2018-01-31 08:22:57,772 INFO L399 ceAbstractionStarter]: For program point L545''''''''''(line 545) no Hoare annotation was computed. [2018-01-31 08:22:57,772 INFO L395 ceAbstractionStarter]: At program point L545''''''''''''''''''(lines 545 550) the Hoare annotation is: (let ((.cse2 (select |#length| cstrncmp_~s1.base)) (.cse3 (select |#length| cstrncmp_~s2.base))) (let ((.cse5 (exists ((v_main_~nondetString1~4.offset_BEFORE_CALL_2 Int)) (and (<= 0 v_main_~nondetString1~4.offset_BEFORE_CALL_2) (<= (+ v_main_~nondetString1~4.offset_BEFORE_CALL_2 1) cstrncmp_~s1.offset) (= 0 (select (select |#memory_int| cstrncmp_~s1.base) (+ v_main_~nondetString1~4.offset_BEFORE_CALL_2 (select |#length| cstrncmp_~s1.base) (- 1)))) (<= v_main_~nondetString1~4.offset_BEFORE_CALL_2 0)))) (.cse0 (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))))) (.cse6 (<= (+ cstrncmp_~s2.offset 1) .cse3)) (.cse1 (= 1 (select |#valid| cstrncmp_~s1.base))) (.cse7 (exists ((v_main_~nondetString2~4.offset_BEFORE_CALL_2 Int)) (and (= 0 (select (select |#memory_int| cstrncmp_~s2.base) (+ v_main_~nondetString2~4.offset_BEFORE_CALL_2 (select |#length| cstrncmp_~s2.base) (- 1)))) (<= 0 v_main_~nondetString2~4.offset_BEFORE_CALL_2) (<= (+ v_main_~nondetString2~4.offset_BEFORE_CALL_2 1) cstrncmp_~s2.offset) (<= v_main_~nondetString2~4.offset_BEFORE_CALL_2 0)))) (.cse8 (<= (+ cstrncmp_~s1.offset 1) .cse2)) (.cse4 (= 1 (select |#valid| cstrncmp_~s2.base)))) (or (not (= 1 (select |#valid| |cstrncmp_#in~s2.base|))) (and .cse0 .cse1 (<= 1 .cse2) (<= 1 .cse3) (exists ((v_main_~nondetString2~4.offset_BEFORE_CALL_2 Int)) (and (= 0 (select (select |#memory_int| cstrncmp_~s2.base) (+ v_main_~nondetString2~4.offset_BEFORE_CALL_2 (select |#length| cstrncmp_~s2.base) (- 1)))) (<= 0 v_main_~nondetString2~4.offset_BEFORE_CALL_2) (<= v_main_~nondetString2~4.offset_BEFORE_CALL_2 cstrncmp_~s2.offset) (<= v_main_~nondetString2~4.offset_BEFORE_CALL_2 0))) (exists ((v_main_~nondetString1~4.offset_BEFORE_CALL_2 Int)) (and (<= 0 v_main_~nondetString1~4.offset_BEFORE_CALL_2) (<= v_main_~nondetString1~4.offset_BEFORE_CALL_2 cstrncmp_~s1.offset) (= 0 (select (select |#memory_int| cstrncmp_~s1.base) (+ v_main_~nondetString1~4.offset_BEFORE_CALL_2 (select |#length| cstrncmp_~s1.base) (- 1)))) (<= v_main_~nondetString1~4.offset_BEFORE_CALL_2 0))) (= 0 cstrncmp_~s2.offset) (= 0 cstrncmp_~s1.offset) .cse4) (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 (= (select |#valid| |cstrncmp_#in~s1.base|) 1)) (and (<= 2 cstrncmp_~s2.offset) .cse5 .cse0 (<= 2 cstrncmp_~s1.offset) .cse6 .cse1 .cse7 .cse8 .cse4) (not (= 0 |cstrncmp_#in~s1.offset|)) (not (exists ((main_~length1~4 Int) (v_main_~nondetString1~4.offset_BEFORE_CALL_1 Int)) (and (<= (+ main_~length1~4 v_main_~nondetString1~4.offset_BEFORE_CALL_1) (select |#length| |cstrncmp_#in~s1.base|)) (= (select (select |#memory_int| |cstrncmp_#in~s1.base|) (+ main_~length1~4 v_main_~nondetString1~4.offset_BEFORE_CALL_1 (- 1))) 0) (<= 1 main_~length1~4) (<= |cstrncmp_#in~s1.offset| v_main_~nondetString1~4.offset_BEFORE_CALL_1)))) (and .cse5 .cse0 .cse6 .cse1 .cse7 (or (<= (+ cstrncmp_~s1.offset 2) .cse2) (= 1 cstrncmp_~s1.offset)) (or (<= (+ cstrncmp_~s2.offset 2) .cse3) (= 1 cstrncmp_~s2.offset)) .cse8 .cse4) (not (exists ((main_~length2~4 Int)) (and (<= 1 main_~length2~4) (<= (+ main_~length2~4 |cstrncmp_#in~s2.offset|) (select |#length| |cstrncmp_#in~s2.base|)) (= 0 (select (select |#memory_int| |cstrncmp_#in~s2.base|) (+ main_~length2~4 |cstrncmp_#in~s2.offset| (- 1))))))) (not (exists ((v_main_~nondetString2~4.offset_BEFORE_CALL_2 Int)) (and (= 0 (select (select |#memory_int| |cstrncmp_#in~s2.base|) (+ v_main_~nondetString2~4.offset_BEFORE_CALL_2 (select |#length| |cstrncmp_#in~s2.base|) (- 1)))) (<= v_main_~nondetString2~4.offset_BEFORE_CALL_2 |cstrncmp_#in~s2.offset|) (<= 0 v_main_~nondetString2~4.offset_BEFORE_CALL_2) (<= v_main_~nondetString2~4.offset_BEFORE_CALL_2 0)))) (not (exists ((v_main_~nondetString1~4.offset_BEFORE_CALL_2 Int)) (and (<= 0 v_main_~nondetString1~4.offset_BEFORE_CALL_2) (<= v_main_~nondetString1~4.offset_BEFORE_CALL_2 |cstrncmp_#in~s1.offset|) (= 0 (select (select |#memory_int| |cstrncmp_#in~s1.base|) (+ v_main_~nondetString1~4.offset_BEFORE_CALL_2 (select |#length| |cstrncmp_#in~s1.base|) (- 1)))) (<= v_main_~nondetString1~4.offset_BEFORE_CALL_2 0)))) (not (= 0 |cstrncmp_#in~s2.offset|))))) [2018-01-31 08:22:57,772 INFO L399 ceAbstractionStarter]: For program point L542'(line 542) no Hoare annotation was computed. [2018-01-31 08:22:57,773 INFO L399 ceAbstractionStarter]: For program point cstrncmpErr3RequiresViolation(lines 1 569) no Hoare annotation was computed. [2018-01-31 08:22:57,773 INFO L399 ceAbstractionStarter]: For program point L546'''''''(line 546) no Hoare annotation was computed. [2018-01-31 08:22:57,773 INFO L399 ceAbstractionStarter]: For program point cstrncmpErr9RequiresViolation(lines 1 569) no Hoare annotation was computed. [2018-01-31 08:22:57,773 INFO L399 ceAbstractionStarter]: For program point L545''''''''''''''(line 545) no Hoare annotation was computed. [2018-01-31 08:22:57,773 INFO L399 ceAbstractionStarter]: For program point L545''(line 545) no Hoare annotation was computed. [2018-01-31 08:22:57,773 INFO L399 ceAbstractionStarter]: For program point L546''''''''(line 546) no Hoare annotation was computed. [2018-01-31 08:22:57,773 INFO L399 ceAbstractionStarter]: For program point L549''(line 549) no Hoare annotation was computed. [2018-01-31 08:22:57,773 INFO L399 ceAbstractionStarter]: For program point cstrncmpErr6RequiresViolation(lines 1 569) no Hoare annotation was computed. [2018-01-31 08:22:57,773 INFO L399 ceAbstractionStarter]: For program point L551'(line 551) no Hoare annotation was computed. [2018-01-31 08:22:57,773 INFO L399 ceAbstractionStarter]: For program point L545'''''''''''''''''''(lines 545 550) no Hoare annotation was computed. [2018-01-31 08:22:57,774 INFO L399 ceAbstractionStarter]: For program point L545'''''''''''''''(line 545) no Hoare annotation was computed. [2018-01-31 08:22:57,774 INFO L399 ceAbstractionStarter]: For program point cstrncmpErr5RequiresViolation(lines 1 569) no Hoare annotation was computed. [2018-01-31 08:22:57,774 INFO L399 ceAbstractionStarter]: For program point cstrncmpErr7RequiresViolation(lines 1 569) no Hoare annotation was computed. [2018-01-31 08:22:57,774 INFO L399 ceAbstractionStarter]: For program point L545'''''''''''(line 545) no Hoare annotation was computed. [2018-01-31 08:22:57,774 INFO L399 ceAbstractionStarter]: For program point L553''''(line 553) no Hoare annotation was computed. [2018-01-31 08:22:57,774 INFO L399 ceAbstractionStarter]: For program point L545'''''''''(line 545) no Hoare annotation was computed. [2018-01-31 08:22:57,774 INFO L399 ceAbstractionStarter]: For program point L545''''(line 545) no Hoare annotation was computed. [2018-01-31 08:22:57,774 INFO L399 ceAbstractionStarter]: For program point L553'''''(line 553) no Hoare annotation was computed. [2018-01-31 08:22:57,774 INFO L399 ceAbstractionStarter]: For program point cstrncmpErr4RequiresViolation(lines 1 569) no Hoare annotation was computed. [2018-01-31 08:22:57,774 INFO L399 ceAbstractionStarter]: For program point L548'(line 548) no Hoare annotation was computed. [2018-01-31 08:22:57,775 INFO L399 ceAbstractionStarter]: For program point cstrncmpErr8RequiresViolation(lines 1 569) no Hoare annotation was computed. [2018-01-31 08:22:57,775 INFO L399 ceAbstractionStarter]: For program point cstrncmpEXIT(lines 540 554) no Hoare annotation was computed. [2018-01-31 08:22:57,775 INFO L399 ceAbstractionStarter]: For program point L545'''(line 545) no Hoare annotation was computed. [2018-01-31 08:22:57,775 INFO L399 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-01-31 08:22:57,775 INFO L399 ceAbstractionStarter]: For program point L540'(lines 540 554) no Hoare annotation was computed. [2018-01-31 08:22:57,776 INFO L399 ceAbstractionStarter]: For program point L552(line 552) no Hoare annotation was computed. [2018-01-31 08:22:57,776 INFO L399 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-01-31 08:22:57,776 INFO L399 ceAbstractionStarter]: For program point L552'(line 552) no Hoare annotation was computed. [2018-01-31 08:22:57,776 INFO L402 ceAbstractionStarter]: At program point cstrncmpENTRY(lines 540 554) the Hoare annotation is: true [2018-01-31 08:22:57,776 INFO L399 ceAbstractionStarter]: For program point L553'''(line 553) no Hoare annotation was computed. [2018-01-31 08:22:57,776 INFO L399 ceAbstractionStarter]: For program point L545''''''(line 545) no Hoare annotation was computed. [2018-01-31 08:22:57,776 INFO L399 ceAbstractionStarter]: For program point L546'''''''''(line 546) no Hoare annotation was computed. [2018-01-31 08:22:57,776 INFO L399 ceAbstractionStarter]: For program point cstrncmpErr2RequiresViolation(lines 1 569) no Hoare annotation was computed. [2018-01-31 08:22:57,776 INFO L399 ceAbstractionStarter]: For program point L545''''''''''''(line 545) no Hoare annotation was computed. [2018-01-31 08:22:57,777 INFO L399 ceAbstractionStarter]: For program point L545'(line 545) no Hoare annotation was computed. [2018-01-31 08:22:57,777 INFO L399 ceAbstractionStarter]: For program point L545''''''''(line 545) no Hoare annotation was computed. [2018-01-31 08:22:57,777 INFO L399 ceAbstractionStarter]: For program point L546'''(line 546) no Hoare annotation was computed. [2018-01-31 08:22:57,777 INFO L399 ceAbstractionStarter]: For program point cstrncmpFINAL(lines 540 554) no Hoare annotation was computed. [2018-01-31 08:22:57,777 INFO L399 ceAbstractionStarter]: For program point L548''(line 548) no Hoare annotation was computed. [2018-01-31 08:22:57,777 INFO L399 ceAbstractionStarter]: For program point L549'(line 549) no Hoare annotation was computed. [2018-01-31 08:22:57,793 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:22:57,794 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:22:57,795 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-31 08:22:57,795 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:22:57,795 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,796 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,796 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,796 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,796 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,797 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,797 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,797 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,798 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:22:57,798 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-31 08:22:57,798 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:22:57,798 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:22:57,799 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,799 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,799 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,800 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,800 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:22:57,800 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:22:57,800 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-31 08:22:57,801 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:22:57,801 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,801 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,802 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,802 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,803 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-31 08:22:57,803 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:22:57,803 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-31 08:22:57,804 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:22:57,804 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-31 08:22:57,804 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:22:57,804 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,805 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,805 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,805 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,805 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:22:57,806 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:22:57,806 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-31 08:22:57,810 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:22:57,810 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,811 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,811 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,811 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,812 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-31 08:22:57,812 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-31 08:22:57,812 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-31 08:22:57,812 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,813 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,813 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,813 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,814 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,814 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,814 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,814 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,816 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:22:57,817 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,817 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,817 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,817 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:22:57,817 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,818 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:22:57,818 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,818 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:22:57,818 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,818 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:22:57,818 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,819 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:22:57,819 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,819 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,819 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:22:57,819 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,820 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,820 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,820 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:22:57,820 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:22:57,821 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,821 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:22:57,821 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,821 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,821 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:22:57,821 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,822 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,822 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,822 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,822 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,822 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:22:57,822 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:22:57,822 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,823 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:22:57,823 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,832 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:22:57,832 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:22:57,832 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-31 08:22:57,833 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:22:57,833 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,833 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,834 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,834 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,834 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,834 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,835 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,835 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,835 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:22:57,835 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-31 08:22:57,836 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:22:57,836 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:22:57,836 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,837 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,837 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,837 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,837 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:22:57,838 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:22:57,838 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-31 08:22:57,838 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:22:57,838 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,839 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,839 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,839 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,839 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-31 08:22:57,840 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:22:57,840 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-31 08:22:57,840 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:22:57,840 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-31 08:22:57,841 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:22:57,841 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,841 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,841 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,841 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,842 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:22:57,842 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:22:57,842 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-31 08:22:57,842 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:22:57,843 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,843 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,843 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,843 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,844 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-31 08:22:57,844 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-31 08:22:57,844 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-31 08:22:57,845 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,845 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,845 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,845 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,845 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,845 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,846 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,846 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,846 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:22:57,846 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,847 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,847 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,847 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:22:57,848 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,848 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:22:57,848 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,848 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:22:57,849 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,849 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:22:57,849 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,849 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:22:57,850 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,850 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,850 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:22:57,850 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,851 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,851 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,851 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:22:57,851 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:22:57,852 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,852 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:22:57,852 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,852 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,853 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:22:57,853 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,853 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,853 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,854 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,854 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,854 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:22:57,854 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:22:57,854 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,855 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:22:57,855 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 08:22:57 BoogieIcfgContainer [2018-01-31 08:22:57,858 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-31 08:22:57,859 INFO L168 Benchmark]: Toolchain (without parser) took 39843.97 ms. Allocated memory was 305.7 MB in the beginning and 632.3 MB in the end (delta: 326.6 MB). Free memory was 263.4 MB in the beginning and 339.0 MB in the end (delta: -75.6 MB). Peak memory consumption was 251.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:22:57,861 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 305.7 MB. Free memory is still 271.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 08:22:57,861 INFO L168 Benchmark]: CACSL2BoogieTranslator took 296.03 ms. Allocated memory is still 305.7 MB. Free memory was 262.4 MB in the beginning and 252.4 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:22:57,861 INFO L168 Benchmark]: Boogie Preprocessor took 43.02 ms. Allocated memory is still 305.7 MB. Free memory was 252.4 MB in the beginning and 250.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:22:57,861 INFO L168 Benchmark]: RCFGBuilder took 700.03 ms. Allocated memory is still 305.7 MB. Free memory was 250.4 MB in the beginning and 226.4 MB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:22:57,862 INFO L168 Benchmark]: TraceAbstraction took 38793.97 ms. Allocated memory was 305.7 MB in the beginning and 632.3 MB in the end (delta: 326.6 MB). Free memory was 225.4 MB in the beginning and 339.0 MB in the end (delta: -113.6 MB). Peak memory consumption was 213.1 MB. Max. memory is 5.3 GB. [2018-01-31 08:22:57,864 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.16 ms. Allocated memory is still 305.7 MB. Free memory is still 271.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 296.03 ms. Allocated memory is still 305.7 MB. Free memory was 262.4 MB in the beginning and 252.4 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 43.02 ms. Allocated memory is still 305.7 MB. Free memory was 252.4 MB in the beginning and 250.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 700.03 ms. Allocated memory is still 305.7 MB. Free memory was 250.4 MB in the beginning and 226.4 MB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 38793.97 ms. Allocated memory was 305.7 MB in the beginning and 632.3 MB in the end (delta: 326.6 MB). Free memory was 225.4 MB in the beginning and 339.0 MB in the end (delta: -113.6 MB). Peak memory consumption was 213.1 MB. Max. memory is 5.3 GB. * 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_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~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[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[v_main_~nondetString1~4.offset_BEFORE_CALL_2,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[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[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_~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_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~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_1,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_1,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_1,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[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_~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_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,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[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~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[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[v_main_~nondetString1~4.offset_BEFORE_CALL_2,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_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~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[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[v_main_~nondetString1~4.offset_BEFORE_CALL_2,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[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[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_~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_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~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_1,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_1,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_1,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[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_~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_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,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[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~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[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[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #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 #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 #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 #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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #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 #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 #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 #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-31 08:22:57,877 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:22:57,878 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:22:57,878 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-31 08:22:57,878 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:22:57,878 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,879 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,879 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,879 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,879 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,880 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,880 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,880 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,880 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:22:57,881 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-31 08:22:57,881 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:22:57,881 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:22:57,881 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,882 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,882 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,882 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,882 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:22:57,883 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:22:57,883 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-31 08:22:57,883 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:22:57,883 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,884 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,884 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,884 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,884 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-31 08:22:57,884 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:22:57,885 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-31 08:22:57,885 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:22:57,885 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-31 08:22:57,885 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:22:57,885 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,886 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,886 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,886 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,886 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:22:57,887 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:22:57,887 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-31 08:22:57,887 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:22:57,887 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,888 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,888 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,893 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,893 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-31 08:22:57,893 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-31 08:22:57,894 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-31 08:22:57,894 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,894 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,894 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,894 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,894 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,895 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,895 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,895 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,895 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:22:57,895 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,896 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,896 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,896 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:22:57,897 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,897 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:22:57,898 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,898 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:22:57,898 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,899 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:22:57,899 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,899 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:22:57,900 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,900 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,900 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:22:57,900 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,901 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,901 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,901 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:22:57,901 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:22:57,902 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,902 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:22:57,902 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,902 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,903 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:22:57,903 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,903 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,904 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,904 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,904 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,904 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:22:57,904 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:22:57,905 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,905 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:22:57,905 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,910 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:22:57,910 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:22:57,910 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-31 08:22:57,911 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:22:57,911 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,911 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,912 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,912 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,912 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,912 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,913 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,913 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,913 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:22:57,914 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-31 08:22:57,914 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:22:57,914 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:22:57,914 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,915 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,915 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,915 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,916 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:22:57,916 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:22:57,916 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-31 08:22:57,916 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:22:57,917 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,917 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,917 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,918 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,918 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-31 08:22:57,918 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:22:57,918 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-31 08:22:57,919 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:22:57,919 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-31 08:22:57,920 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:22:57,920 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,920 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,921 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,921 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,921 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:22:57,922 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:22:57,922 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-31 08:22:57,922 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-31 08:22:57,922 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,923 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,923 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,923 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,923 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-31 08:22:57,924 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-31 08:22:57,924 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-31 08:22:57,924 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,925 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,925 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,925 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,925 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,925 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,925 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,926 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:22:57,926 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:22:57,927 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,927 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,927 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,927 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:22:57,928 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,928 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:22:57,928 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,928 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:22:57,929 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,929 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:22:57,929 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,929 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:22:57,929 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,930 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,930 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:22:57,930 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,930 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,931 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,931 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:22:57,931 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:22:57,931 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,931 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:22:57,932 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,932 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,932 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:22:57,933 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,933 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,933 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,933 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,934 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,934 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:22:57,934 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:22:57,934 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:22:57,934 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:22:57,935 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((!(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)) && 1 == \valid[s1]) && 1 <= unknown-#length-unknown[s1]) && 1 <= unknown-#length-unknown[s2]) && (\exists v_main_~nondetString2~4.offset_BEFORE_CALL_2 : int :: ((0 == unknown-#memory_int-unknown[s2][v_main_~nondetString2~4.offset_BEFORE_CALL_2 + unknown-#length-unknown[s2] + -1] && 0 <= v_main_~nondetString2~4.offset_BEFORE_CALL_2) && v_main_~nondetString2~4.offset_BEFORE_CALL_2 <= s2) && v_main_~nondetString2~4.offset_BEFORE_CALL_2 <= 0)) && (\exists v_main_~nondetString1~4.offset_BEFORE_CALL_2 : int :: ((0 <= v_main_~nondetString1~4.offset_BEFORE_CALL_2 && v_main_~nondetString1~4.offset_BEFORE_CALL_2 <= s1) && 0 == unknown-#memory_int-unknown[s1][v_main_~nondetString1~4.offset_BEFORE_CALL_2 + unknown-#length-unknown[s1] + -1]) && v_main_~nondetString1~4.offset_BEFORE_CALL_2 <= 0)) && 0 == s2) && 0 == s1) && 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))) || !(\valid[s1] == 1)) || ((((((((2 <= s2 && (\exists v_main_~nondetString1~4.offset_BEFORE_CALL_2 : int :: ((0 <= v_main_~nondetString1~4.offset_BEFORE_CALL_2 && v_main_~nondetString1~4.offset_BEFORE_CALL_2 + 1 <= s1) && 0 == unknown-#memory_int-unknown[s1][v_main_~nondetString1~4.offset_BEFORE_CALL_2 + unknown-#length-unknown[s1] + -1]) && v_main_~nondetString1~4.offset_BEFORE_CALL_2 <= 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))) && 2 <= s1) && s2 + 1 <= unknown-#length-unknown[s2]) && 1 == \valid[s1]) && (\exists v_main_~nondetString2~4.offset_BEFORE_CALL_2 : int :: ((0 == unknown-#memory_int-unknown[s2][v_main_~nondetString2~4.offset_BEFORE_CALL_2 + unknown-#length-unknown[s2] + -1] && 0 <= v_main_~nondetString2~4.offset_BEFORE_CALL_2) && v_main_~nondetString2~4.offset_BEFORE_CALL_2 + 1 <= s2) && v_main_~nondetString2~4.offset_BEFORE_CALL_2 <= 0)) && s1 + 1 <= unknown-#length-unknown[s1]) && 1 == \valid[s2])) || !(0 == s1)) || !(\exists main_~length1~4 : int, v_main_~nondetString1~4.offset_BEFORE_CALL_1 : int :: ((main_~length1~4 + v_main_~nondetString1~4.offset_BEFORE_CALL_1 <= unknown-#length-unknown[s1] && unknown-#memory_int-unknown[s1][main_~length1~4 + v_main_~nondetString1~4.offset_BEFORE_CALL_1 + -1] == 0) && 1 <= main_~length1~4) && s1 <= v_main_~nondetString1~4.offset_BEFORE_CALL_1)) || (((((((((\exists v_main_~nondetString1~4.offset_BEFORE_CALL_2 : int :: ((0 <= v_main_~nondetString1~4.offset_BEFORE_CALL_2 && v_main_~nondetString1~4.offset_BEFORE_CALL_2 + 1 <= s1) && 0 == unknown-#memory_int-unknown[s1][v_main_~nondetString1~4.offset_BEFORE_CALL_2 + unknown-#length-unknown[s1] + -1]) && v_main_~nondetString1~4.offset_BEFORE_CALL_2 <= 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 + 1 <= unknown-#length-unknown[s2]) && 1 == \valid[s1]) && (\exists v_main_~nondetString2~4.offset_BEFORE_CALL_2 : int :: ((0 == unknown-#memory_int-unknown[s2][v_main_~nondetString2~4.offset_BEFORE_CALL_2 + unknown-#length-unknown[s2] + -1] && 0 <= v_main_~nondetString2~4.offset_BEFORE_CALL_2) && v_main_~nondetString2~4.offset_BEFORE_CALL_2 + 1 <= s2) && v_main_~nondetString2~4.offset_BEFORE_CALL_2 <= 0)) && (s1 + 2 <= unknown-#length-unknown[s1] || 1 == s1)) && (s2 + 2 <= unknown-#length-unknown[s2] || 1 == s2)) && s1 + 1 <= unknown-#length-unknown[s1]) && 1 == \valid[s2])) || !(\exists main_~length2~4 : int :: (1 <= main_~length2~4 && main_~length2~4 + s2 <= unknown-#length-unknown[s2]) && 0 == unknown-#memory_int-unknown[s2][main_~length2~4 + s2 + -1])) || !(\exists v_main_~nondetString2~4.offset_BEFORE_CALL_2 : int :: ((0 == unknown-#memory_int-unknown[s2][v_main_~nondetString2~4.offset_BEFORE_CALL_2 + unknown-#length-unknown[s2] + -1] && v_main_~nondetString2~4.offset_BEFORE_CALL_2 <= s2) && 0 <= v_main_~nondetString2~4.offset_BEFORE_CALL_2) && v_main_~nondetString2~4.offset_BEFORE_CALL_2 <= 0)) || !(\exists v_main_~nondetString1~4.offset_BEFORE_CALL_2 : int :: ((0 <= v_main_~nondetString1~4.offset_BEFORE_CALL_2 && v_main_~nondetString1~4.offset_BEFORE_CALL_2 <= s1) && 0 == unknown-#memory_int-unknown[s1][v_main_~nondetString1~4.offset_BEFORE_CALL_2 + unknown-#length-unknown[s1] + -1]) && v_main_~nondetString1~4.offset_BEFORE_CALL_2 <= 0)) || !(0 == s2) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 104 locations, 15 error locations. SAFE Result, 38.6s OverallTime, 16 OverallIterations, 3 TraceHistogramMax, 13.1s AutomataDifference, 0.0s DeadEndRemovalTime, 12.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 1350 SDtfs, 2327 SDslu, 6476 SDs, 0 SdLazy, 2820 SolverSat, 140 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 508 GetRequests, 260 SyntacticMatches, 2 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1721 ImplicationChecksByTransitivity, 16.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 128 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 10 NumberOfFragments, 564 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 947 FormulaSimplificationTreeSizeReductionInter, 12.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 11.5s InterpolantComputationTime, 1059 NumberOfCodeBlocks, 1059 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1039 ConstructedInterpolants, 147 QuantifiedInterpolants, 908265 SizeOfPredicates, 72 NumberOfNonLiveVariables, 766 ConjunctsInSsa, 142 ConjunctsInUnsatCore, 20 InterpolantComputations, 12 PerfectInterpolantSequences, 56/206 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: 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_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-31_08-22-57-960.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_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-31_08-22-57-960.csv Received shutdown request...