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/cstrcmp-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-29 22:36:08,321 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-29 22:36:08,323 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-29 22:36:08,338 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-29 22:36:08,338 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-29 22:36:08,339 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-29 22:36:08,340 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-29 22:36:08,342 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-29 22:36:08,343 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-29 22:36:08,344 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-29 22:36:08,344 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-29 22:36:08,345 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-29 22:36:08,345 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-29 22:36:08,346 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-29 22:36:08,347 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-29 22:36:08,349 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-29 22:36:08,351 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-29 22:36:08,353 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-29 22:36:08,354 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-29 22:36:08,355 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-29 22:36:08,358 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-29 22:36:08,358 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-29 22:36:08,358 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-29 22:36:08,359 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-29 22:36:08,360 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-29 22:36:08,361 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-29 22:36:08,361 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-29 22:36:08,362 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-29 22:36:08,362 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-29 22:36:08,362 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-29 22:36:08,363 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-29 22:36:08,363 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-29 22:36:08,373 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-29 22:36:08,373 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-29 22:36:08,374 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-29 22:36:08,374 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-29 22:36:08,374 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-29 22:36:08,374 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-29 22:36:08,375 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-29 22:36:08,375 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-29 22:36:08,375 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-29 22:36:08,376 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-29 22:36:08,376 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-29 22:36:08,376 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-29 22:36:08,376 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-29 22:36:08,376 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-29 22:36:08,377 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-29 22:36:08,377 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-29 22:36:08,377 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-29 22:36:08,377 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-29 22:36:08,377 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-29 22:36:08,378 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-29 22:36:08,378 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-29 22:36:08,378 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-29 22:36:08,378 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-29 22:36:08,378 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-29 22:36:08,379 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-29 22:36:08,379 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-29 22:36:08,379 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-29 22:36:08,379 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-29 22:36:08,379 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-29 22:36:08,380 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-29 22:36:08,380 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-29 22:36:08,380 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-29 22:36:08,381 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-29 22:36:08,381 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-29 22:36:08,416 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-29 22:36:08,429 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-29 22:36:08,433 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-29 22:36:08,435 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-29 22:36:08,435 INFO L276 PluginConnector]: CDTParser initialized [2018-01-29 22:36:08,436 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-01-29 22:36:08,596 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-29 22:36:08,600 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-29 22:36:08,600 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-29 22:36:08,601 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-29 22:36:08,605 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-29 22:36:08,606 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:36:08" (1/1) ... [2018-01-29 22:36:08,608 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24215a3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:36:08, skipping insertion in model container [2018-01-29 22:36:08,608 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:36:08" (1/1) ... [2018-01-29 22:36:08,620 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 22:36:08,658 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 22:36:08,769 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 22:36:08,787 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 22:36:08,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:36:08 WrapperNode [2018-01-29 22:36:08,793 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-29 22:36:08,794 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-29 22:36:08,794 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-29 22:36:08,794 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-29 22:36:08,805 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:36:08" (1/1) ... [2018-01-29 22:36:08,805 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:36:08" (1/1) ... [2018-01-29 22:36:08,816 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:36:08" (1/1) ... [2018-01-29 22:36:08,817 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:36:08" (1/1) ... [2018-01-29 22:36:08,821 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:36:08" (1/1) ... [2018-01-29 22:36:08,824 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:36:08" (1/1) ... [2018-01-29 22:36:08,825 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:36:08" (1/1) ... [2018-01-29 22:36:08,826 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-29 22:36:08,826 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-29 22:36:08,827 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-29 22:36:08,827 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-29 22:36:08,827 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:36:08" (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-29 22:36:08,871 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-29 22:36:08,872 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-29 22:36:08,872 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcmp [2018-01-29 22:36:08,872 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-29 22:36:08,872 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-29 22:36:08,872 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-29 22:36:08,872 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-29 22:36:08,872 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-29 22:36:08,873 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-29 22:36:08,873 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-29 22:36:08,873 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcmp [2018-01-29 22:36:08,873 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-29 22:36:08,873 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-29 22:36:08,873 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-29 22:36:09,104 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-29 22:36:09,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:36:09 BoogieIcfgContainer [2018-01-29 22:36:09,105 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-29 22:36:09,106 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-29 22:36:09,106 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-29 22:36:09,109 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-29 22:36:09,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 10:36:08" (1/3) ... [2018-01-29 22:36:09,110 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5922e0ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 10:36:09, skipping insertion in model container [2018-01-29 22:36:09,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:36:08" (2/3) ... [2018-01-29 22:36:09,110 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5922e0ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 10:36:09, skipping insertion in model container [2018-01-29 22:36:09,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:36:09" (3/3) ... [2018-01-29 22:36:09,112 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-01-29 22:36:09,118 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-29 22:36:09,125 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-29 22:36:09,163 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-29 22:36:09,163 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-29 22:36:09,164 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-29 22:36:09,164 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-29 22:36:09,164 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-29 22:36:09,164 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-29 22:36:09,164 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-29 22:36:09,164 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-29 22:36:09,165 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-29 22:36:09,183 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states. [2018-01-29 22:36:09,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-29 22:36:09,189 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:36:09,190 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:36:09,191 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:36:09,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1375442408, now seen corresponding path program 1 times [2018-01-29 22:36:09,196 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:36:09,197 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:36:09,237 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:09,237 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:36:09,237 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:09,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:36:09,295 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:36:09,492 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-29 22:36:09,494 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:36:09,495 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 22:36:09,496 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 22:36:09,565 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 22:36:09,565 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 22:36:09,567 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 4 states. [2018-01-29 22:36:09,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:36:09,681 INFO L93 Difference]: Finished difference Result 117 states and 122 transitions. [2018-01-29 22:36:09,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-29 22:36:09,683 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-01-29 22:36:09,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:36:09,693 INFO L225 Difference]: With dead ends: 117 [2018-01-29 22:36:09,693 INFO L226 Difference]: Without dead ends: 84 [2018-01-29 22:36:09,696 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-29 22:36:09,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-29 22:36:09,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-01-29 22:36:09,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-29 22:36:09,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2018-01-29 22:36:09,733 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 19 [2018-01-29 22:36:09,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:36:09,733 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2018-01-29 22:36:09,733 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 22:36:09,733 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2018-01-29 22:36:09,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-29 22:36:09,734 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:36:09,734 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:36:09,734 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:36:09,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1375442409, now seen corresponding path program 1 times [2018-01-29 22:36:09,735 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:36:09,735 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:36:09,736 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:09,737 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:36:09,737 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:09,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:36:09,757 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:36:09,899 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-29 22:36:09,899 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:36:09,899 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 22:36:09,901 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 22:36:09,901 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 22:36:09,902 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-29 22:36:09,902 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand 6 states. [2018-01-29 22:36:09,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:36:09,963 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2018-01-29 22:36:09,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 22:36:09,964 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-29 22:36:09,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:36:09,965 INFO L225 Difference]: With dead ends: 84 [2018-01-29 22:36:09,965 INFO L226 Difference]: Without dead ends: 83 [2018-01-29 22:36:09,966 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-29 22:36:09,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-29 22:36:09,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-01-29 22:36:09,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-29 22:36:09,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2018-01-29 22:36:09,973 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 19 [2018-01-29 22:36:09,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:36:09,973 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2018-01-29 22:36:09,973 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 22:36:09,973 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-01-29 22:36:09,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-29 22:36:09,974 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:36:09,974 INFO L350 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-29 22:36:09,974 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:36:09,974 INFO L82 PathProgramCache]: Analyzing trace with hash -310958240, now seen corresponding path program 1 times [2018-01-29 22:36:09,974 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:36:09,974 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:36:09,975 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:09,975 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:36:09,975 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:09,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:36:09,986 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:36:10,043 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-29 22:36:10,043 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:36:10,043 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 22:36:10,044 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 22:36:10,044 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 22:36:10,044 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 22:36:10,044 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 4 states. [2018-01-29 22:36:10,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:36:10,143 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-01-29 22:36:10,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-29 22:36:10,143 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-01-29 22:36:10,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:36:10,144 INFO L225 Difference]: With dead ends: 83 [2018-01-29 22:36:10,144 INFO L226 Difference]: Without dead ends: 82 [2018-01-29 22:36:10,144 INFO L553 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-29 22:36:10,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-01-29 22:36:10,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-01-29 22:36:10,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-01-29 22:36:10,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2018-01-29 22:36:10,150 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 20 [2018-01-29 22:36:10,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:36:10,150 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2018-01-29 22:36:10,150 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 22:36:10,150 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2018-01-29 22:36:10,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-29 22:36:10,151 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:36:10,151 INFO L350 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-29 22:36:10,151 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:36:10,151 INFO L82 PathProgramCache]: Analyzing trace with hash -310958239, now seen corresponding path program 1 times [2018-01-29 22:36:10,151 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:36:10,151 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:36:10,152 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:10,152 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:36:10,152 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:10,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:36:10,162 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:36:10,223 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-29 22:36:10,223 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:36:10,223 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-29 22:36:10,223 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 22:36:10,224 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 22:36:10,224 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-29 22:36:10,224 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand 5 states. [2018-01-29 22:36:10,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:36:10,278 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2018-01-29 22:36:10,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 22:36:10,278 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-29 22:36:10,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:36:10,280 INFO L225 Difference]: With dead ends: 82 [2018-01-29 22:36:10,280 INFO L226 Difference]: Without dead ends: 81 [2018-01-29 22:36:10,280 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-29 22:36:10,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-29 22:36:10,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-01-29 22:36:10,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-29 22:36:10,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2018-01-29 22:36:10,288 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 20 [2018-01-29 22:36:10,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:36:10,289 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2018-01-29 22:36:10,289 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 22:36:10,289 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2018-01-29 22:36:10,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-29 22:36:10,290 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:36:10,290 INFO L350 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] [2018-01-29 22:36:10,290 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:36:10,290 INFO L82 PathProgramCache]: Analyzing trace with hash -982683523, now seen corresponding path program 1 times [2018-01-29 22:36:10,290 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:36:10,291 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:36:10,292 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:10,292 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:36:10,292 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:10,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:36:10,306 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:36:10,350 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-29 22:36:10,350 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:36:10,350 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-29 22:36:10,351 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 22:36:10,351 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 22:36:10,351 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-29 22:36:10,351 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 5 states. [2018-01-29 22:36:10,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:36:10,430 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2018-01-29 22:36:10,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-29 22:36:10,431 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-01-29 22:36:10,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:36:10,432 INFO L225 Difference]: With dead ends: 85 [2018-01-29 22:36:10,432 INFO L226 Difference]: Without dead ends: 82 [2018-01-29 22:36:10,432 INFO L553 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-29 22:36:10,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-01-29 22:36:10,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2018-01-29 22:36:10,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-29 22:36:10,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2018-01-29 22:36:10,440 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 27 [2018-01-29 22:36:10,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:36:10,440 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2018-01-29 22:36:10,440 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 22:36:10,441 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2018-01-29 22:36:10,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-29 22:36:10,442 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:36:10,442 INFO L350 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] [2018-01-29 22:36:10,442 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:36:10,442 INFO L82 PathProgramCache]: Analyzing trace with hash -982683522, now seen corresponding path program 1 times [2018-01-29 22:36:10,442 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:36:10,442 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:36:10,443 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:10,444 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:36:10,444 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:10,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:36:10,459 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:36:10,565 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-29 22:36:10,566 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:36:10,566 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-29 22:36:10,566 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-29 22:36:10,567 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-29 22:36:10,567 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-29 22:36:10,567 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand 8 states. [2018-01-29 22:36:10,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:36:10,699 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2018-01-29 22:36:10,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-29 22:36:10,700 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-01-29 22:36:10,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:36:10,709 INFO L225 Difference]: With dead ends: 117 [2018-01-29 22:36:10,709 INFO L226 Difference]: Without dead ends: 114 [2018-01-29 22:36:10,709 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-01-29 22:36:10,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-01-29 22:36:10,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 92. [2018-01-29 22:36:10,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-01-29 22:36:10,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2018-01-29 22:36:10,717 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 27 [2018-01-29 22:36:10,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:36:10,718 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2018-01-29 22:36:10,718 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-29 22:36:10,718 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2018-01-29 22:36:10,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-29 22:36:10,719 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:36:10,719 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:36:10,719 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:36:10,719 INFO L82 PathProgramCache]: Analyzing trace with hash 2014308867, now seen corresponding path program 1 times [2018-01-29 22:36:10,720 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:36:10,720 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:36:10,721 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:10,721 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:36:10,721 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:10,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:36:10,734 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:36:10,792 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-29 22:36:10,793 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:36:10,793 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-29 22:36:10,793 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 22:36:10,793 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 22:36:10,793 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-29 22:36:10,794 INFO L87 Difference]: Start difference. First operand 92 states and 100 transitions. Second operand 5 states. [2018-01-29 22:36:10,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:36:10,932 INFO L93 Difference]: Finished difference Result 115 states and 122 transitions. [2018-01-29 22:36:10,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-29 22:36:10,932 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-01-29 22:36:10,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:36:10,933 INFO L225 Difference]: With dead ends: 115 [2018-01-29 22:36:10,933 INFO L226 Difference]: Without dead ends: 113 [2018-01-29 22:36:10,933 INFO L553 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-29 22:36:10,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-01-29 22:36:10,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 101. [2018-01-29 22:36:10,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-01-29 22:36:10,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2018-01-29 22:36:10,942 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 31 [2018-01-29 22:36:10,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:36:10,943 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2018-01-29 22:36:10,943 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 22:36:10,943 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2018-01-29 22:36:10,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-29 22:36:10,944 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:36:10,944 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:36:10,944 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:36:10,945 INFO L82 PathProgramCache]: Analyzing trace with hash 2014308868, now seen corresponding path program 1 times [2018-01-29 22:36:10,945 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:36:10,945 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:36:10,946 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:10,946 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:36:10,946 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:10,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:36:10,959 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:36:11,067 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-29 22:36:11,067 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:36:11,067 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-29 22:36:11,068 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-29 22:36:11,068 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-29 22:36:11,068 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-29 22:36:11,068 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand 8 states. [2018-01-29 22:36:11,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:36:11,162 INFO L93 Difference]: Finished difference Result 124 states and 134 transitions. [2018-01-29 22:36:11,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-29 22:36:11,163 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-01-29 22:36:11,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:36:11,163 INFO L225 Difference]: With dead ends: 124 [2018-01-29 22:36:11,164 INFO L226 Difference]: Without dead ends: 122 [2018-01-29 22:36:11,164 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-29 22:36:11,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-01-29 22:36:11,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 104. [2018-01-29 22:36:11,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-01-29 22:36:11,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 113 transitions. [2018-01-29 22:36:11,171 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 113 transitions. Word has length 31 [2018-01-29 22:36:11,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:36:11,172 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 113 transitions. [2018-01-29 22:36:11,172 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-29 22:36:11,172 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 113 transitions. [2018-01-29 22:36:11,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-29 22:36:11,174 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:36:11,174 INFO L350 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:36:11,174 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:36:11,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1362953723, now seen corresponding path program 1 times [2018-01-29 22:36:11,174 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:36:11,175 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:36:11,175 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:11,176 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:36:11,176 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:11,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:36:11,187 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:36:11,212 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:36:11,212 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:36:11,213 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 22:36:11,213 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-29 22:36:11,213 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-29 22:36:11,213 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 22:36:11,213 INFO L87 Difference]: Start difference. First operand 104 states and 113 transitions. Second operand 3 states. [2018-01-29 22:36:11,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:36:11,245 INFO L93 Difference]: Finished difference Result 166 states and 181 transitions. [2018-01-29 22:36:11,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-29 22:36:11,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-01-29 22:36:11,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:36:11,247 INFO L225 Difference]: With dead ends: 166 [2018-01-29 22:36:11,247 INFO L226 Difference]: Without dead ends: 105 [2018-01-29 22:36:11,248 INFO L553 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-29 22:36:11,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-01-29 22:36:11,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-01-29 22:36:11,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-01-29 22:36:11,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 113 transitions. [2018-01-29 22:36:11,254 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 113 transitions. Word has length 42 [2018-01-29 22:36:11,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:36:11,255 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 113 transitions. [2018-01-29 22:36:11,255 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-29 22:36:11,255 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 113 transitions. [2018-01-29 22:36:11,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-29 22:36:11,256 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:36:11,257 INFO L350 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:36:11,257 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:36:11,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1965384566, now seen corresponding path program 1 times [2018-01-29 22:36:11,257 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:36:11,257 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:36:11,258 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:11,258 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:36:11,258 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:11,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:36:11,273 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:36:11,309 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:36:11,310 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:36:11,310 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 22:36:11,310 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 22:36:11,310 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 22:36:11,311 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 22:36:11,311 INFO L87 Difference]: Start difference. First operand 105 states and 113 transitions. Second operand 4 states. [2018-01-29 22:36:11,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:36:11,365 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2018-01-29 22:36:11,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-29 22:36:11,366 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-01-29 22:36:11,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:36:11,367 INFO L225 Difference]: With dead ends: 105 [2018-01-29 22:36:11,367 INFO L226 Difference]: Without dead ends: 104 [2018-01-29 22:36:11,368 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-29 22:36:11,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-01-29 22:36:11,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-01-29 22:36:11,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-01-29 22:36:11,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2018-01-29 22:36:11,375 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 45 [2018-01-29 22:36:11,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:36:11,375 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2018-01-29 22:36:11,375 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 22:36:11,376 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2018-01-29 22:36:11,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-29 22:36:11,377 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:36:11,379 INFO L350 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:36:11,379 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:36:11,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1965384567, now seen corresponding path program 1 times [2018-01-29 22:36:11,380 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:36:11,380 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:36:11,381 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:11,381 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:36:11,381 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:11,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:36:11,400 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:36:11,852 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:36:11,852 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:36:11,853 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-29 22:36:11,860 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:36:11,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:36:11,901 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:36:11,947 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-29 22:36:11,948 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:36:11,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:36:11,956 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 22:36:11,991 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:36:11,992 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:36:11,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-29 22:36:11,995 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:36:12,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:36:12,001 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-29 22:36:12,049 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-29 22:36:12,051 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-29 22:36:12,051 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:36:12,056 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:36:12,063 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-29 22:36:12,063 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-01-29 22:36:12,105 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-29 22:36:12,113 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-29 22:36:12,114 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:36:12,118 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:36:12,126 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-29 22:36:12,126 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-01-29 22:36:12,297 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-29 22:36:12,316 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-29 22:36:12,316 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:36:12,324 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-29 22:36:12,324 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 22:36:12,328 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:36:12,340 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-29 22:36:12,340 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:48, output treesize:33 [2018-01-29 22:36:12,460 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:36:12,480 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:36:12,481 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 26 [2018-01-29 22:36:12,481 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-29 22:36:12,481 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-29 22:36:12,481 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=632, Unknown=0, NotChecked=0, Total=702 [2018-01-29 22:36:12,482 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand 27 states. [2018-01-29 22:36:14,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:36:14,662 INFO L93 Difference]: Finished difference Result 187 states and 202 transitions. [2018-01-29 22:36:14,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-29 22:36:14,662 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 45 [2018-01-29 22:36:14,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:36:14,663 INFO L225 Difference]: With dead ends: 187 [2018-01-29 22:36:14,663 INFO L226 Difference]: Without dead ends: 184 [2018-01-29 22:36:14,664 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=259, Invalid=1632, Unknown=1, NotChecked=0, Total=1892 [2018-01-29 22:36:14,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-01-29 22:36:14,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 133. [2018-01-29 22:36:14,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-01-29 22:36:14,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2018-01-29 22:36:14,673 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 45 [2018-01-29 22:36:14,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:36:14,674 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2018-01-29 22:36:14,674 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-29 22:36:14,674 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2018-01-29 22:36:14,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-29 22:36:14,675 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:36:14,675 INFO L350 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] [2018-01-29 22:36:14,676 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:36:14,676 INFO L82 PathProgramCache]: Analyzing trace with hash -734807940, now seen corresponding path program 1 times [2018-01-29 22:36:14,676 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:36:14,676 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:36:14,677 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:14,677 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:36:14,677 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:14,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:36:14,691 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:36:14,725 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-29 22:36:14,725 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:36:14,725 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 22:36:14,725 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 22:36:14,725 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 22:36:14,725 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 22:36:14,725 INFO L87 Difference]: Start difference. First operand 133 states and 145 transitions. Second operand 4 states. [2018-01-29 22:36:14,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:36:14,785 INFO L93 Difference]: Finished difference Result 141 states and 153 transitions. [2018-01-29 22:36:14,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-29 22:36:14,786 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-01-29 22:36:14,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:36:14,787 INFO L225 Difference]: With dead ends: 141 [2018-01-29 22:36:14,787 INFO L226 Difference]: Without dead ends: 139 [2018-01-29 22:36:14,788 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-29 22:36:14,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-01-29 22:36:14,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 118. [2018-01-29 22:36:14,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-29 22:36:14,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 127 transitions. [2018-01-29 22:36:14,796 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 127 transitions. Word has length 49 [2018-01-29 22:36:14,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:36:14,796 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 127 transitions. [2018-01-29 22:36:14,796 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 22:36:14,796 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 127 transitions. [2018-01-29 22:36:14,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-29 22:36:14,797 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:36:14,798 INFO L350 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] [2018-01-29 22:36:14,798 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:36:14,798 INFO L82 PathProgramCache]: Analyzing trace with hash -734807939, now seen corresponding path program 1 times [2018-01-29 22:36:14,798 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:36:14,798 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:36:14,799 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:14,799 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:36:14,799 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:14,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:36:14,814 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:36:15,065 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-29 22:36:15,065 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:36:15,065 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-29 22:36:15,070 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:36:15,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:36:15,088 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:36:15,119 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-29 22:36:15,121 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-29 22:36:15,122 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:36:15,123 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:36:15,128 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-29 22:36:15,129 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-01-29 22:36:15,403 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 33 treesize of output 33 [2018-01-29 22:36:15,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 31 [2018-01-29 22:36:15,425 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-01-29 22:36:15,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 27 [2018-01-29 22:36:15,527 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-29 22:36:15,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2018-01-29 22:36:15,575 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 22:36:15,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-01-29 22:36:15,577 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-29 22:36:15,601 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-01-29 22:36:15,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-29 22:36:15,635 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:46, output treesize:66 [2018-01-29 22:36:15,766 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-29 22:36:15,785 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:36:15,786 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 [2018-01-29 22:36:15,786 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-29 22:36:15,786 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-29 22:36:15,787 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=788, Unknown=0, NotChecked=0, Total=870 [2018-01-29 22:36:15,787 INFO L87 Difference]: Start difference. First operand 118 states and 127 transitions. Second operand 30 states. [2018-01-29 22:36:16,137 WARN L146 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 60 DAG size of output 45 [2018-01-29 22:36:17,034 WARN L146 SmtUtils]: Spent 354ms on a formula simplification. DAG size of input: 68 DAG size of output 48 [2018-01-29 22:36:17,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:36:17,776 INFO L93 Difference]: Finished difference Result 167 states and 178 transitions. [2018-01-29 22:36:17,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-01-29 22:36:17,776 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 49 [2018-01-29 22:36:17,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:36:17,777 INFO L225 Difference]: With dead ends: 167 [2018-01-29 22:36:17,777 INFO L226 Difference]: Without dead ends: 165 [2018-01-29 22:36:17,778 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 622 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=467, Invalid=2503, Unknown=0, NotChecked=0, Total=2970 [2018-01-29 22:36:17,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-01-29 22:36:17,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 112. [2018-01-29 22:36:17,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-29 22:36:17,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2018-01-29 22:36:17,785 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 49 [2018-01-29 22:36:17,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:36:17,785 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2018-01-29 22:36:17,785 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-29 22:36:17,785 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2018-01-29 22:36:17,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-29 22:36:17,786 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:36:17,787 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:36:17,787 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:36:17,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1866881770, now seen corresponding path program 1 times [2018-01-29 22:36:17,787 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:36:17,787 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:36:17,788 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:17,788 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:36:17,788 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:17,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:36:17,801 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:36:17,933 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-29 22:36:17,933 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:36:17,933 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 22:36:17,934 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 22:36:17,934 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 22:36:17,934 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-29 22:36:17,934 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand 6 states. [2018-01-29 22:36:18,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:36:18,095 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2018-01-29 22:36:18,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-29 22:36:18,096 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-01-29 22:36:18,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:36:18,096 INFO L225 Difference]: With dead ends: 112 [2018-01-29 22:36:18,096 INFO L226 Difference]: Without dead ends: 85 [2018-01-29 22:36:18,097 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-29 22:36:18,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-29 22:36:18,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-01-29 22:36:18,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-29 22:36:18,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2018-01-29 22:36:18,102 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 54 [2018-01-29 22:36:18,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:36:18,102 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2018-01-29 22:36:18,102 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 22:36:18,103 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2018-01-29 22:36:18,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-01-29 22:36:18,103 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:36:18,103 INFO L350 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:36:18,103 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:36:18,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1614670384, now seen corresponding path program 2 times [2018-01-29 22:36:18,104 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:36:18,104 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:36:18,104 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:18,105 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:36:18,105 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:18,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:36:18,120 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:36:18,572 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:36:18,572 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:36:18,572 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-29 22:36:18,577 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 22:36:18,589 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:36:18,596 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:36:18,599 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:36:18,602 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:36:18,605 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-29 22:36:18,605 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:36:18,610 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-29 22:36:18,610 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:36:18,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:36:18,613 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-29 22:36:18,666 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:36:18,667 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-29 22:36:18,668 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:36:18,677 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:36:18,678 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:36:18,678 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-29 22:36:18,678 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:36:18,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:36:18,683 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-29 22:36:18,729 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-29 22:36:18,730 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-29 22:36:18,731 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:36:18,734 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:36:18,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:36:18,739 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-01-29 22:36:18,768 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-29 22:36:18,770 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-29 22:36:18,770 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:36:18,775 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:36:18,783 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-29 22:36:18,783 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:35 [2018-01-29 22:36:19,037 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-29 22:36:19,039 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-29 22:36:19,039 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:36:19,050 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-29 22:36:19,051 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-29 22:36:19,054 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:36:19,064 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-29 22:36:19,064 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:54, output treesize:49 [2018-01-29 22:36:19,179 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:36:19,199 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:36:19,199 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 27 [2018-01-29 22:36:19,200 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-29 22:36:19,200 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-29 22:36:19,200 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=694, Unknown=0, NotChecked=0, Total=756 [2018-01-29 22:36:19,200 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand 28 states. [2018-01-29 22:36:20,311 WARN L146 SmtUtils]: Spent 551ms on a formula simplification. DAG size of input: 77 DAG size of output 52 [2018-01-29 22:36:24,513 WARN L146 SmtUtils]: Spent 1895ms on a formula simplification. DAG size of input: 64 DAG size of output 59 [2018-01-29 22:36:28,090 WARN L146 SmtUtils]: Spent 3548ms on a formula simplification. DAG size of input: 54 DAG size of output 49 [2018-01-29 22:36:28,967 WARN L146 SmtUtils]: Spent 838ms on a formula simplification. DAG size of input: 59 DAG size of output 53 [2018-01-29 22:36:30,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:36:30,022 INFO L93 Difference]: Finished difference Result 100 states and 103 transitions. [2018-01-29 22:36:30,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-29 22:36:30,022 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 63 [2018-01-29 22:36:30,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:36:30,023 INFO L225 Difference]: With dead ends: 100 [2018-01-29 22:36:30,023 INFO L226 Difference]: Without dead ends: 97 [2018-01-29 22:36:30,024 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=295, Invalid=2057, Unknown=0, NotChecked=0, Total=2352 [2018-01-29 22:36:30,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-01-29 22:36:30,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 82. [2018-01-29 22:36:30,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-01-29 22:36:30,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2018-01-29 22:36:30,030 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 63 [2018-01-29 22:36:30,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:36:30,030 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2018-01-29 22:36:30,030 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-29 22:36:30,030 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2018-01-29 22:36:30,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-01-29 22:36:30,030 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:36:30,031 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2018-01-29 22:36:30,031 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:36:30,031 INFO L82 PathProgramCache]: Analyzing trace with hash -574080330, now seen corresponding path program 2 times [2018-01-29 22:36:30,031 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:36:30,031 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:36:30,031 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:30,032 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:36:30,032 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:30,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:36:30,047 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:36:30,642 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:36:30,642 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:36:30,642 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-29 22:36:30,648 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 22:36:30,661 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:36:30,671 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:36:30,675 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:36:30,679 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:36:30,688 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-29 22:36:30,689 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:36:30,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:36:30,706 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 22:36:30,791 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-29 22:36:30,794 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-29 22:36:30,794 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:36:30,796 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:36:30,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:36:30,804 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-01-29 22:36:31,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 35 [2018-01-29 22:36:31,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-01-29 22:36:31,145 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:36:31,161 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 24 treesize of output 22 [2018-01-29 22:36:31,162 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-29 22:36:31,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 35 [2018-01-29 22:36:31,191 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-01-29 22:36:31,225 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-01-29 22:36:31,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-01-29 22:36:31,260 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:116 [2018-01-29 22:36:31,476 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:36:31,496 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:36:31,496 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2018-01-29 22:36:31,496 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-29 22:36:31,497 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-29 22:36:31,497 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=966, Unknown=0, NotChecked=0, Total=1056 [2018-01-29 22:36:31,497 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand 33 states. [2018-01-29 22:36:34,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:36:34,232 INFO L93 Difference]: Finished difference Result 100 states and 103 transitions. [2018-01-29 22:36:34,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-01-29 22:36:34,232 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 67 [2018-01-29 22:36:34,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:36:34,233 INFO L225 Difference]: With dead ends: 100 [2018-01-29 22:36:34,233 INFO L226 Difference]: Without dead ends: 0 [2018-01-29 22:36:34,234 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1017 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=689, Invalid=4423, Unknown=0, NotChecked=0, Total=5112 [2018-01-29 22:36:34,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-29 22:36:34,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-29 22:36:34,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-29 22:36:34,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-29 22:36:34,235 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 67 [2018-01-29 22:36:34,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:36:34,235 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-29 22:36:34,235 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-29 22:36:34,235 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-29 22:36:34,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-29 22:36:34,239 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-29 22:36:34,480 WARN L146 SmtUtils]: Spent 156ms on a formula simplification. DAG size of input: 86 DAG size of output 58 [2018-01-29 22:36:47,104 WARN L146 SmtUtils]: Spent 12616ms on a formula simplification. DAG size of input: 188 DAG size of output 148 [2018-01-29 22:36:47,133 INFO L399 ceAbstractionStarter]: For program point L1(lines 1 565) no Hoare annotation was computed. [2018-01-29 22:36:47,133 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 565) no Hoare annotation was computed. [2018-01-29 22:36:47,134 INFO L395 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 565) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-29 22:36:47,134 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 565) no Hoare annotation was computed. [2018-01-29 22:36:47,134 INFO L399 ceAbstractionStarter]: For program point cstrcmpErr1RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-29 22:36:47,134 INFO L399 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-01-29 22:36:47,134 INFO L399 ceAbstractionStarter]: For program point L540(lines 540 550) no Hoare annotation was computed. [2018-01-29 22:36:47,134 INFO L399 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-01-29 22:36:47,134 INFO L399 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-01-29 22:36:47,134 INFO L399 ceAbstractionStarter]: For program point L543(lines 543 546) no Hoare annotation was computed. [2018-01-29 22:36:47,134 INFO L399 ceAbstractionStarter]: For program point cstrcmpErr0RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-29 22:36:47,134 INFO L399 ceAbstractionStarter]: For program point L549(line 549) no Hoare annotation was computed. [2018-01-29 22:36:47,134 INFO L399 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-01-29 22:36:47,134 INFO L399 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-01-29 22:36:47,135 INFO L399 ceAbstractionStarter]: For program point cstrcmpErr2RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-29 22:36:47,135 INFO L399 ceAbstractionStarter]: For program point L549'''(line 549) no Hoare annotation was computed. [2018-01-29 22:36:47,135 INFO L399 ceAbstractionStarter]: For program point L549''''(line 549) no Hoare annotation was computed. [2018-01-29 22:36:47,135 INFO L399 ceAbstractionStarter]: For program point L543'''(line 543) no Hoare annotation was computed. [2018-01-29 22:36:47,135 INFO L399 ceAbstractionStarter]: For program point L542'(line 542) no Hoare annotation was computed. [2018-01-29 22:36:47,135 INFO L399 ceAbstractionStarter]: For program point L543'''''''''(line 543) no Hoare annotation was computed. [2018-01-29 22:36:47,135 INFO L399 ceAbstractionStarter]: For program point cstrcmpErr9RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-29 22:36:47,135 INFO L399 ceAbstractionStarter]: For program point cstrcmpErr7RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-29 22:36:47,135 INFO L399 ceAbstractionStarter]: For program point cstrcmpErr4RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-29 22:36:47,135 INFO L399 ceAbstractionStarter]: For program point L543'''''''''''(line 543) no Hoare annotation was computed. [2018-01-29 22:36:47,135 INFO L399 ceAbstractionStarter]: For program point L543'(line 543) no Hoare annotation was computed. [2018-01-29 22:36:47,135 INFO L399 ceAbstractionStarter]: For program point L545''(line 545) no Hoare annotation was computed. [2018-01-29 22:36:47,135 INFO L399 ceAbstractionStarter]: For program point L543''(line 543) no Hoare annotation was computed. [2018-01-29 22:36:47,135 INFO L399 ceAbstractionStarter]: For program point L547'(line 547) no Hoare annotation was computed. [2018-01-29 22:36:47,135 INFO L399 ceAbstractionStarter]: For program point cstrcmpEXIT(lines 540 550) no Hoare annotation was computed. [2018-01-29 22:36:47,136 INFO L399 ceAbstractionStarter]: For program point L543'''''''''''''(line 543) no Hoare annotation was computed. [2018-01-29 22:36:47,136 INFO L399 ceAbstractionStarter]: For program point cstrcmpErr6RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-29 22:36:47,136 INFO L399 ceAbstractionStarter]: For program point L543''''(line 543) no Hoare annotation was computed. [2018-01-29 22:36:47,136 INFO L399 ceAbstractionStarter]: For program point L543'''''(line 543) no Hoare annotation was computed. [2018-01-29 22:36:47,136 INFO L399 ceAbstractionStarter]: For program point L543''''''''''''''''''(lines 543 546) no Hoare annotation was computed. [2018-01-29 22:36:47,136 INFO L399 ceAbstractionStarter]: For program point L549'''''(line 549) no Hoare annotation was computed. [2018-01-29 22:36:47,136 INFO L399 ceAbstractionStarter]: For program point cstrcmpErr5RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-29 22:36:47,136 INFO L399 ceAbstractionStarter]: For program point L544'(line 544) no Hoare annotation was computed. [2018-01-29 22:36:47,136 INFO L399 ceAbstractionStarter]: For program point cstrcmpFINAL(lines 540 550) no Hoare annotation was computed. [2018-01-29 22:36:47,136 INFO L399 ceAbstractionStarter]: For program point L548'(line 548) no Hoare annotation was computed. [2018-01-29 22:36:47,136 INFO L399 ceAbstractionStarter]: For program point L543''''''''(line 543) no Hoare annotation was computed. [2018-01-29 22:36:47,136 INFO L402 ceAbstractionStarter]: At program point cstrcmpENTRY(lines 540 550) the Hoare annotation is: true [2018-01-29 22:36:47,136 INFO L399 ceAbstractionStarter]: For program point cstrcmpErr8RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-29 22:36:47,137 INFO L399 ceAbstractionStarter]: For program point cstrcmpErr3RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-29 22:36:47,137 INFO L399 ceAbstractionStarter]: For program point L543''''''''''(line 543) no Hoare annotation was computed. [2018-01-29 22:36:47,137 INFO L399 ceAbstractionStarter]: For program point L543'''''''(line 543) no Hoare annotation was computed. [2018-01-29 22:36:47,137 INFO L399 ceAbstractionStarter]: For program point L543'''''''''''''''(line 543) no Hoare annotation was computed. [2018-01-29 22:36:47,137 INFO L399 ceAbstractionStarter]: For program point L543''''''''''''''(line 543) no Hoare annotation was computed. [2018-01-29 22:36:47,137 INFO L399 ceAbstractionStarter]: For program point L543''''''''''''''''(line 543) no Hoare annotation was computed. [2018-01-29 22:36:47,138 INFO L395 ceAbstractionStarter]: At program point L543'''''''''''''''''(lines 543 546) the Hoare annotation is: (let ((.cse6 (select |#length| cstrcmp_~s1.base))) (let ((.cse1 (= 1 (select |#valid| cstrcmp_~s2.base))) (.cse0 (= 1 (select |#valid| cstrcmp_~s1.base))) (.cse2 (<= (+ cstrcmp_~s1.offset 1) .cse6)) (.cse3 (<= (+ cstrcmp_~s2.offset 1) (select |#length| cstrcmp_~s2.base))) (.cse4 (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) cstrcmp_~s1.offset) (= (select (select |#memory_int| cstrcmp_~s1.base) (+ v_main_~nondetString1~4.offset_BEFORE_CALL_2 (select |#length| cstrcmp_~s1.base) (- 1))) 0) (<= v_main_~nondetString1~4.offset_BEFORE_CALL_2 0)))) (.cse5 (exists ((v_main_~nondetString2~4.offset_BEFORE_CALL_2 Int)) (and (<= (+ v_main_~nondetString2~4.offset_BEFORE_CALL_2 1) cstrcmp_~s2.offset) (= 0 (select (select |#memory_int| cstrcmp_~s2.base) (+ v_main_~nondetString2~4.offset_BEFORE_CALL_2 (select |#length| cstrcmp_~s2.base) (- 1)))) (<= 0 v_main_~nondetString2~4.offset_BEFORE_CALL_2) (<= v_main_~nondetString2~4.offset_BEFORE_CALL_2 0))))) (or (and .cse0 (exists ((v_main_~nondetString1~4.offset_BEFORE_CALL_2 Int)) (and (<= 0 v_main_~nondetString1~4.offset_BEFORE_CALL_2) (= (select (select |#memory_int| cstrcmp_~s1.base) (+ v_main_~nondetString1~4.offset_BEFORE_CALL_2 (select |#length| cstrcmp_~s1.base) (- 1))) 0) (<= v_main_~nondetString1~4.offset_BEFORE_CALL_2 0) (<= v_main_~nondetString1~4.offset_BEFORE_CALL_2 cstrcmp_~s1.offset))) (exists ((v_main_~nondetString2~4.offset_BEFORE_CALL_2 Int)) (and (= 0 (select (select |#memory_int| cstrcmp_~s2.base) (+ v_main_~nondetString2~4.offset_BEFORE_CALL_2 (select |#length| cstrcmp_~s2.base) (- 1)))) (<= v_main_~nondetString2~4.offset_BEFORE_CALL_2 cstrcmp_~s2.offset) (<= 0 v_main_~nondetString2~4.offset_BEFORE_CALL_2) (<= v_main_~nondetString2~4.offset_BEFORE_CALL_2 0))) (exists ((main_~length1~4 Int) (v_main_~nondetString1~4.offset_BEFORE_CALL_1 Int)) (and (<= cstrcmp_~s1.offset v_main_~nondetString1~4.offset_BEFORE_CALL_1) (<= (+ main_~length1~4 v_main_~nondetString1~4.offset_BEFORE_CALL_1) (select |#length| cstrcmp_~s1.base)) (= (select (select |#memory_int| cstrcmp_~s1.base) (+ main_~length1~4 v_main_~nondetString1~4.offset_BEFORE_CALL_1 (- 1))) 0) (<= 1 main_~length1~4))) .cse1 (= 0 cstrcmp_~s1.offset) (= cstrcmp_~s2.offset 0) (exists ((main_~length2~4 Int)) (and (<= 1 main_~length2~4) (= (select (select |#memory_int| cstrcmp_~s2.base) (+ main_~length2~4 cstrcmp_~s2.offset (- 1))) 0) (<= (+ main_~length2~4 cstrcmp_~s2.offset) (select |#length| cstrcmp_~s2.base))))) (not (= 0 |cstrcmp_#in~s2.offset|)) (and (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 (= cstrcmp_~s1.base main_~nondetString2~4.base)))) .cse1 .cse0 .cse2 (<= 2 cstrcmp_~s1.offset) .cse3 .cse4 .cse5 (<= 2 cstrcmp_~s2.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| |cstrcmp_#in~s1.base|)) (<= |cstrcmp_#in~s1.offset| v_main_~nondetString1~4.offset_BEFORE_CALL_1) (= (select (select |#memory_int| |cstrcmp_#in~s1.base|) (+ main_~length1~4 v_main_~nondetString1~4.offset_BEFORE_CALL_1 (- 1))) 0) (<= 1 main_~length1~4)))) (not (= 1 (select |#valid| |cstrcmp_#in~s2.base|))) (not (= 0 |cstrcmp_#in~s1.offset|)) (not (exists ((v_main_~nondetString2~4.offset_BEFORE_CALL_2 Int)) (and (<= v_main_~nondetString2~4.offset_BEFORE_CALL_2 |cstrcmp_#in~s2.offset|) (= 0 (select (select |#memory_int| |cstrcmp_#in~s2.base|) (+ v_main_~nondetString2~4.offset_BEFORE_CALL_2 (select |#length| |cstrcmp_#in~s2.base|) (- 1)))) (<= 0 v_main_~nondetString2~4.offset_BEFORE_CALL_2) (<= v_main_~nondetString2~4.offset_BEFORE_CALL_2 0)))) (not (exists ((main_~nondetString2~4.offset Int) (main_~nondetString2~4.base Int)) (and (not (= main_~nondetString2~4.base |cstrcmp_#in~s1.base|)) (= 0 (select (select |#memory_int| main_~nondetString2~4.base) (+ main_~nondetString2~4.offset (select |#length| main_~nondetString2~4.base) (- 1))))))) (not (= (select |#valid| |cstrcmp_#in~s1.base|) 1)) (and .cse1 .cse0 .cse2 (or (= 1 cstrcmp_~s1.offset) (<= (+ cstrcmp_~s1.offset 2) .cse6)) (= 1 cstrcmp_~s2.offset) .cse3 .cse4 .cse5) (not (exists ((main_~length2~4 Int)) (and (<= 1 main_~length2~4) (<= (+ main_~length2~4 |cstrcmp_#in~s2.offset|) (select |#length| |cstrcmp_#in~s2.base|)) (= 0 (select (select |#memory_int| |cstrcmp_#in~s2.base|) (+ main_~length2~4 |cstrcmp_#in~s2.offset| (- 1))))))) (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 |cstrcmp_#in~s1.offset|) (<= v_main_~nondetString1~4.offset_BEFORE_CALL_2 0) (= 0 (select (select |#memory_int| |cstrcmp_#in~s1.base|) (+ v_main_~nondetString1~4.offset_BEFORE_CALL_2 (select |#length| |cstrcmp_#in~s1.base|) (- 1)))))))))) [2018-01-29 22:36:47,138 INFO L399 ceAbstractionStarter]: For program point L544''(line 544) no Hoare annotation was computed. [2018-01-29 22:36:47,138 INFO L399 ceAbstractionStarter]: For program point L545'(line 545) no Hoare annotation was computed. [2018-01-29 22:36:47,138 INFO L399 ceAbstractionStarter]: For program point L548''(line 548) no Hoare annotation was computed. [2018-01-29 22:36:47,138 INFO L399 ceAbstractionStarter]: For program point L549'(line 549) no Hoare annotation was computed. [2018-01-29 22:36:47,138 INFO L402 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 565) the Hoare annotation is: true [2018-01-29 22:36:47,138 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 565) no Hoare annotation was computed. [2018-01-29 22:36:47,138 INFO L402 ceAbstractionStarter]: At program point L1(lines 1 565) the Hoare annotation is: true [2018-01-29 22:36:47,139 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 565) no Hoare annotation was computed. [2018-01-29 22:36:47,139 INFO L399 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-01-29 22:36:47,139 INFO L399 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-29 22:36:47,139 INFO L399 ceAbstractionStarter]: For program point L561'(line 561) no Hoare annotation was computed. [2018-01-29 22:36:47,139 INFO L399 ceAbstractionStarter]: For program point L564(line 564) no Hoare annotation was computed. [2018-01-29 22:36:47,139 INFO L395 ceAbstractionStarter]: At program point L563(line 563) the Hoare annotation is: (let ((.cse0 (select |#length| main_~nondetString2~4.base)) (.cse1 (select |#length| main_~nondetString1~4.base))) (and (= 1 (select |#valid| |main_#t~malloc12.base|)) (not (= main_~nondetString2~4.base main_~nondetString1~4.base)) (= (select (select |#memory_int| main_~nondetString2~4.base) (+ .cse0 main_~nondetString2~4.offset (- 1))) 0) (= 0 |main_#t~malloc11.offset|) (not (= |main_#t~malloc12.base| main_~nondetString1~4.base)) (<= 1 main_~length2~4) (= (store (store |#valid| |main_#t~malloc11.base| 0) |main_#t~malloc12.base| 0) |old(#valid)|) (= main_~nondetString2~4.offset 0) (= main_~length1~4 (select |#length| |main_#t~malloc11.base|)) (= main_~length2~4 .cse0) (<= (+ main_~nondetString1~4.offset 1) .cse1) (= main_~nondetString1~4.offset 0) (= 0 |main_#t~malloc12.offset|) (= 1 (select |#valid| main_~nondetString2~4.base)) (= main_~length2~4 (select |#length| |main_#t~malloc12.base|)) (= .cse1 main_~length1~4) (= (select (select |#memory_int| main_~nondetString1~4.base) (+ main_~nondetString1~4.offset .cse1 (- 1))) 0) (not (= |main_#t~malloc11.base| |main_#t~malloc12.base|)) (= 1 (select |#valid| |main_#t~malloc11.base|)) (= 1 (select |#valid| main_~nondetString1~4.base)))) [2018-01-29 22:36:47,139 INFO L399 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-01-29 22:36:47,139 INFO L399 ceAbstractionStarter]: For program point L553'(line 553) no Hoare annotation was computed. [2018-01-29 22:36:47,140 INFO L399 ceAbstractionStarter]: For program point L561(line 561) no Hoare annotation was computed. [2018-01-29 22:36:47,140 INFO L399 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-29 22:36:47,140 INFO L399 ceAbstractionStarter]: For program point L553''(line 553) no Hoare annotation was computed. [2018-01-29 22:36:47,140 INFO L399 ceAbstractionStarter]: For program point mainErr2RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-29 22:36:47,140 INFO L399 ceAbstractionStarter]: For program point L554''(lines 554 556) no Hoare annotation was computed. [2018-01-29 22:36:47,140 INFO L399 ceAbstractionStarter]: For program point L560'(line 560) no Hoare annotation was computed. [2018-01-29 22:36:47,140 INFO L399 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-01-29 22:36:47,140 INFO L399 ceAbstractionStarter]: For program point mainErr3RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-29 22:36:47,140 INFO L399 ceAbstractionStarter]: For program point L552(line 552) no Hoare annotation was computed. [2018-01-29 22:36:47,140 INFO L399 ceAbstractionStarter]: For program point L562'(line 562) no Hoare annotation was computed. [2018-01-29 22:36:47,141 INFO L399 ceAbstractionStarter]: For program point L552'(line 552) no Hoare annotation was computed. [2018-01-29 22:36:47,141 INFO L399 ceAbstractionStarter]: For program point L564'(line 564) no Hoare annotation was computed. [2018-01-29 22:36:47,141 INFO L399 ceAbstractionStarter]: For program point mainFINAL(lines 551 565) no Hoare annotation was computed. [2018-01-29 22:36:47,141 INFO L399 ceAbstractionStarter]: For program point L555(line 555) no Hoare annotation was computed. [2018-01-29 22:36:47,141 INFO L399 ceAbstractionStarter]: For program point L554(lines 554 556) no Hoare annotation was computed. [2018-01-29 22:36:47,141 INFO L399 ceAbstractionStarter]: For program point mainErr4EnsuresViolation(lines 551 565) no Hoare annotation was computed. [2018-01-29 22:36:47,141 INFO L399 ceAbstractionStarter]: For program point L558(line 558) no Hoare annotation was computed. [2018-01-29 22:36:47,141 INFO L399 ceAbstractionStarter]: For program point mainEXIT(lines 551 565) no Hoare annotation was computed. [2018-01-29 22:36:47,141 INFO L395 ceAbstractionStarter]: At program point mainENTRY(lines 551 565) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-29 22:36:47,142 INFO L399 ceAbstractionStarter]: For program point L561''(line 561) no Hoare annotation was computed. [2018-01-29 22:36:47,142 INFO L399 ceAbstractionStarter]: For program point L564''(line 564) no Hoare annotation was computed. [2018-01-29 22:36:47,142 INFO L399 ceAbstractionStarter]: For program point L560''(line 560) no Hoare annotation was computed. [2018-01-29 22:36:47,142 INFO L399 ceAbstractionStarter]: For program point L561'''(line 561) no Hoare annotation was computed. [2018-01-29 22:36:47,142 INFO L399 ceAbstractionStarter]: For program point L557'(lines 557 559) no Hoare annotation was computed. [2018-01-29 22:36:47,153 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,153 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,154 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,154 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,154 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,154 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,154 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,154 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,155 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:36:47,155 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-29 22:36:47,155 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:36:47,155 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-29 22:36:47,155 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:36:47,156 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-29 22:36:47,156 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-29 22:36:47,156 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-29 22:36:47,156 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-29 22:36:47,156 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-29 22:36:47,157 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-29 22:36:47,157 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-29 22:36:47,157 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-29 22:36:47,157 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,157 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,158 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,158 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,158 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,158 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,158 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,158 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,159 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-29 22:36:47,159 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:36:47,159 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:36:47,159 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-29 22:36:47,159 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:36:47,159 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-29 22:36:47,160 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,160 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,160 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,160 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,160 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-29 22:36:47,160 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-29 22:36:47,161 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-29 22:36:47,161 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-29 22:36:47,161 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,161 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,161 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,162 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,162 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,162 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,162 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,162 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,162 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-29 22:36:47,162 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-29 22:36:47,162 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-29 22:36:47,163 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,163 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,163 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,163 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,165 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:47,165 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,165 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:47,166 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,166 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,166 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:47,167 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:47,167 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,167 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:47,168 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,168 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,168 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,168 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:47,169 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,169 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:47,169 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,170 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,170 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:47,170 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:47,170 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,171 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:47,171 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,171 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,171 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,172 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,172 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:47,172 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,172 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:47,173 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,173 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,173 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:47,173 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:47,174 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,188 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,188 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,188 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,189 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,189 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,190 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,190 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,190 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,191 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:36:47,191 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-29 22:36:47,191 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:36:47,191 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-29 22:36:47,192 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:36:47,192 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-29 22:36:47,192 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-29 22:36:47,193 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-29 22:36:47,193 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-29 22:36:47,194 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-29 22:36:47,194 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-29 22:36:47,194 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-29 22:36:47,195 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-29 22:36:47,195 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,195 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,196 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,196 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,196 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,197 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,197 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,197 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,198 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-29 22:36:47,198 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:36:47,198 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:36:47,198 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-29 22:36:47,198 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:36:47,199 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-29 22:36:47,199 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,199 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,199 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,199 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,200 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-29 22:36:47,200 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-29 22:36:47,200 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-29 22:36:47,200 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-29 22:36:47,200 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,200 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,201 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,201 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,201 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,201 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,201 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,202 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,202 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-29 22:36:47,202 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-29 22:36:47,202 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-29 22:36:47,202 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,202 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,202 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,203 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,203 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:47,203 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,203 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:47,203 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,204 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,204 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:47,204 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:47,204 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,205 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:47,205 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,205 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,205 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,205 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:47,205 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,206 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:47,206 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,206 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,206 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:47,206 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:47,206 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,207 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:47,207 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,207 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,207 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,207 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,207 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:47,207 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,208 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:47,208 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,208 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,208 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:47,208 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:47,208 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 10:36:47 BoogieIcfgContainer [2018-01-29 22:36:47,217 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-29 22:36:47,218 INFO L168 Benchmark]: Toolchain (without parser) took 38621.30 ms. Allocated memory was 302.5 MB in the beginning and 625.0 MB in the end (delta: 322.4 MB). Free memory was 262.5 MB in the beginning and 592.2 MB in the end (delta: -329.6 MB). Peak memory consumption was 280.6 MB. Max. memory is 5.3 GB. [2018-01-29 22:36:47,219 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 302.5 MB. Free memory is still 268.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-29 22:36:47,220 INFO L168 Benchmark]: CACSL2BoogieTranslator took 192.88 ms. Allocated memory is still 302.5 MB. Free memory was 261.6 MB in the beginning and 251.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-29 22:36:47,220 INFO L168 Benchmark]: Boogie Preprocessor took 32.60 ms. Allocated memory is still 302.5 MB. Free memory was 251.6 MB in the beginning and 249.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-29 22:36:47,221 INFO L168 Benchmark]: RCFGBuilder took 278.74 ms. Allocated memory is still 302.5 MB. Free memory was 249.6 MB in the beginning and 227.9 MB in the end (delta: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 5.3 GB. [2018-01-29 22:36:47,221 INFO L168 Benchmark]: TraceAbstraction took 38111.27 ms. Allocated memory was 302.5 MB in the beginning and 625.0 MB in the end (delta: 322.4 MB). Free memory was 227.9 MB in the beginning and 592.2 MB in the end (delta: -364.3 MB). Peak memory consumption was 245.9 MB. Max. memory is 5.3 GB. [2018-01-29 22:36:47,223 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.19 ms. Allocated memory is still 302.5 MB. Free memory is still 268.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 192.88 ms. Allocated memory is still 302.5 MB. Free memory was 261.6 MB in the beginning and 251.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.60 ms. Allocated memory is still 302.5 MB. Free memory was 251.6 MB in the beginning and 249.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 278.74 ms. Allocated memory is still 302.5 MB. Free memory was 249.6 MB in the beginning and 227.9 MB in the end (delta: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 38111.27 ms. Allocated memory was 302.5 MB in the beginning and 625.0 MB in the end (delta: 322.4 MB). Free memory was 227.9 MB in the beginning and 592.2 MB in the end (delta: -364.3 MB). Peak memory consumption was 245.9 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[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[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_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[main_~length1~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[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_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_~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[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_~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_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_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_~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_~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[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[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_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[main_~length1~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[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_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_~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[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_~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_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_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_~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_~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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #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 #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #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 #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 551]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - InvariantResult [Line: 543]: Loop Invariant [2018-01-29 22:36:47,234 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,235 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,235 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,235 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,235 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,236 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,236 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,236 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,236 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:36:47,237 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-29 22:36:47,237 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:36:47,237 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-29 22:36:47,237 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:36:47,238 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-29 22:36:47,238 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-29 22:36:47,238 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-29 22:36:47,238 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-29 22:36:47,239 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-29 22:36:47,239 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-29 22:36:47,239 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-29 22:36:47,240 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-29 22:36:47,240 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,240 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,240 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,241 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,241 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,241 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,241 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,242 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,242 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-29 22:36:47,242 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:36:47,242 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:36:47,242 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-29 22:36:47,243 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:36:47,243 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-29 22:36:47,243 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,243 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,243 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,244 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,244 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-29 22:36:47,244 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-29 22:36:47,244 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-29 22:36:47,244 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-29 22:36:47,245 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,245 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,245 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,245 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,245 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,246 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,246 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,246 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,246 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-29 22:36:47,246 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-29 22:36:47,247 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-29 22:36:47,247 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,247 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,247 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,247 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,247 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:47,248 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,248 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:47,248 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,249 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,249 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:47,249 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:47,249 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,250 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:47,250 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,250 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,250 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,251 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:47,251 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,251 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:47,251 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,252 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,252 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:47,252 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:47,252 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,253 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:47,253 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,253 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,253 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,253 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,254 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:47,254 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,254 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:47,254 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,254 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,254 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:47,255 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:47,255 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,258 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,259 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,259 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,259 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,259 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,260 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,260 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,260 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,260 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:36:47,261 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-29 22:36:47,261 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:36:47,261 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-29 22:36:47,261 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:36:47,262 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-29 22:36:47,262 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-29 22:36:47,262 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-29 22:36:47,262 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-29 22:36:47,263 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-29 22:36:47,263 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-29 22:36:47,263 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-29 22:36:47,263 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-29 22:36:47,264 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,264 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,264 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,264 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,265 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,265 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,265 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,265 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,266 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-29 22:36:47,266 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:36:47,266 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:36:47,266 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-29 22:36:47,266 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:36:47,267 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-29 22:36:47,267 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,267 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,267 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,267 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,268 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-29 22:36:47,268 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-29 22:36:47,268 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-29 22:36:47,268 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-29 22:36:47,269 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,269 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,269 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,269 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,269 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,269 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,270 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,270 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,270 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-29 22:36:47,270 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-29 22:36:47,270 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-29 22:36:47,270 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,271 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,271 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,271 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:36:47,271 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:47,271 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,272 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:47,272 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,272 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,273 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:47,273 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:47,273 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,273 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:47,274 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,274 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,274 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,274 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:47,274 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,275 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:47,275 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,275 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,275 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:47,276 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:47,276 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,276 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:47,276 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,276 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,277 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,277 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,277 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:47,277 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,277 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:47,278 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,278 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:47,278 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:47,278 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:47,278 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((((((((((1 == \valid[s1] && (\exists v_main_~nondetString1~4.offset_BEFORE_CALL_2 : int :: ((0 <= v_main_~nondetString1~4.offset_BEFORE_CALL_2 && unknown-#memory_int-unknown[s1][v_main_~nondetString1~4.offset_BEFORE_CALL_2 + unknown-#length-unknown[s1] + -1] == 0) && v_main_~nondetString1~4.offset_BEFORE_CALL_2 <= 0) && v_main_~nondetString1~4.offset_BEFORE_CALL_2 <= 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] && 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 main_~length1~4 : int, v_main_~nondetString1~4.offset_BEFORE_CALL_1 : int :: ((s1 <= v_main_~nondetString1~4.offset_BEFORE_CALL_1 && 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)) && 1 == \valid[s2]) && 0 == s1) && s2 == 0) && (\exists main_~length2~4 : int :: (1 <= main_~length2~4 && unknown-#memory_int-unknown[s2][main_~length2~4 + s2 + -1] == 0) && main_~length2~4 + s2 <= unknown-#length-unknown[s2])) || !(0 == 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 && !(s1 == main_~nondetString2~4.base)) && 1 == \valid[s2]) && 1 == \valid[s1]) && s1 + 1 <= unknown-#length-unknown[s1]) && 2 <= s1) && s2 + 1 <= unknown-#length-unknown[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) && unknown-#memory_int-unknown[s1][v_main_~nondetString1~4.offset_BEFORE_CALL_2 + unknown-#length-unknown[s1] + -1] == 0) && v_main_~nondetString1~4.offset_BEFORE_CALL_2 <= 0)) && (\exists v_main_~nondetString2~4.offset_BEFORE_CALL_2 : int :: ((v_main_~nondetString2~4.offset_BEFORE_CALL_2 + 1 <= s2 && 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 <= 0)) && 2 <= s2)) || !(\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] && s1 <= v_main_~nondetString1~4.offset_BEFORE_CALL_1) && unknown-#memory_int-unknown[s1][main_~length1~4 + v_main_~nondetString1~4.offset_BEFORE_CALL_1 + -1] == 0) && 1 <= main_~length1~4)) || !(1 == \valid[s2])) || !(0 == s1)) || !(\exists v_main_~nondetString2~4.offset_BEFORE_CALL_2 : int :: ((v_main_~nondetString2~4.offset_BEFORE_CALL_2 <= s2 && 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 <= 0)) || !(\exists main_~nondetString2~4.offset : int, main_~nondetString2~4.base : int :: !(main_~nondetString2~4.base == s1) && 0 == unknown-#memory_int-unknown[main_~nondetString2~4.base][main_~nondetString2~4.offset + unknown-#length-unknown[main_~nondetString2~4.base] + -1])) || !(\valid[s1] == 1)) || (((((((1 == \valid[s2] && 1 == \valid[s1]) && s1 + 1 <= unknown-#length-unknown[s1]) && (1 == s1 || s1 + 2 <= unknown-#length-unknown[s1])) && 1 == s2) && s2 + 1 <= unknown-#length-unknown[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) && unknown-#memory_int-unknown[s1][v_main_~nondetString1~4.offset_BEFORE_CALL_2 + unknown-#length-unknown[s1] + -1] == 0) && v_main_~nondetString1~4.offset_BEFORE_CALL_2 <= 0)) && (\exists v_main_~nondetString2~4.offset_BEFORE_CALL_2 : int :: ((v_main_~nondetString2~4.offset_BEFORE_CALL_2 + 1 <= s2 && 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 <= 0))) || !(\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_~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) && v_main_~nondetString1~4.offset_BEFORE_CALL_2 <= 0) && 0 == unknown-#memory_int-unknown[s1][v_main_~nondetString1~4.offset_BEFORE_CALL_2 + unknown-#length-unknown[s1] + -1]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 88 locations, 15 error locations. SAFE Result, 37.9s OverallTime, 16 OverallIterations, 3 TraceHistogramMax, 18.9s AutomataDifference, 0.0s DeadEndRemovalTime, 12.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 1225 SDtfs, 2466 SDslu, 5816 SDs, 0 SdLazy, 3167 SolverSat, 239 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 4.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 460 GetRequests, 190 SyntacticMatches, 4 SemanticMatches, 266 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2303 ImplicationChecksByTransitivity, 17.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 193 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 10 NumberOfFragments, 552 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 936 FormulaSimplificationTreeSizeReductionInter, 12.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 832 NumberOfCodeBlocks, 832 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 812 ConstructedInterpolants, 72 QuantifiedInterpolants, 412706 SizeOfPredicates, 72 NumberOfNonLiveVariables, 670 ConjunctsInSsa, 142 ConjunctsInUnsatCore, 20 InterpolantComputations, 12 PerfectInterpolantSequences, 18/130 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/cstrcmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-29_22-36-47-286.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-29_22-36-47-286.csv Received shutdown request...