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.epf -i ../../../trunk/examples/svcomp/array-memsafety/cstrncmp-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 11:42:05,051 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 11:42:05,053 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 11:42:05,065 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 11:42:05,065 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 11:42:05,066 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 11:42:05,067 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 11:42:05,069 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 11:42:05,070 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 11:42:05,071 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 11:42:05,072 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 11:42:05,072 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 11:42:05,072 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 11:42:05,073 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 11:42:05,074 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 11:42:05,076 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 11:42:05,078 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 11:42:05,080 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 11:42:05,081 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 11:42:05,082 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 11:42:05,085 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 11:42:05,085 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 11:42:05,085 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 11:42:05,086 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 11:42:05,087 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 11:42:05,088 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 11:42:05,088 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 11:42:05,089 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 11:42:05,089 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 11:42:05,089 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 11:42:05,090 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 11:42:05,090 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.epf [2018-01-24 11:42:05,099 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 11:42:05,099 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 11:42:05,100 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 11:42:05,100 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 11:42:05,101 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 11:42:05,101 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 11:42:05,101 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 11:42:05,102 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 11:42:05,102 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 11:42:05,102 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 11:42:05,102 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 11:42:05,102 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 11:42:05,102 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 11:42:05,103 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 11:42:05,103 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 11:42:05,103 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 11:42:05,103 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 11:42:05,103 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 11:42:05,104 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 11:42:05,104 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 11:42:05,104 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 11:42:05,104 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 11:42:05,104 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 11:42:05,105 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 11:42:05,105 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 11:42:05,105 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 11:42:05,105 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 11:42:05,105 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 11:42:05,106 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 11:42:05,106 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 11:42:05,106 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 11:42:05,106 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 11:42:05,107 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 11:42:05,107 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 11:42:05,141 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 11:42:05,153 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 11:42:05,157 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 11:42:05,159 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 11:42:05,159 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 11:42:05,160 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-01-24 11:42:05,332 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 11:42:05,338 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 11:42:05,339 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 11:42:05,339 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 11:42:05,346 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 11:42:05,347 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:42:05" (1/1) ... [2018-01-24 11:42:05,349 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75d63a1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:42:05, skipping insertion in model container [2018-01-24 11:42:05,350 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:42:05" (1/1) ... [2018-01-24 11:42:05,368 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 11:42:05,407 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 11:42:05,528 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 11:42:05,549 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 11:42:05,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:42:05 WrapperNode [2018-01-24 11:42:05,557 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 11:42:05,558 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 11:42:05,558 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 11:42:05,558 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 11:42:05,570 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:42:05" (1/1) ... [2018-01-24 11:42:05,570 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:42:05" (1/1) ... [2018-01-24 11:42:05,582 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:42:05" (1/1) ... [2018-01-24 11:42:05,583 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:42:05" (1/1) ... [2018-01-24 11:42:05,587 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:42:05" (1/1) ... [2018-01-24 11:42:05,590 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:42:05" (1/1) ... [2018-01-24 11:42:05,591 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:42:05" (1/1) ... [2018-01-24 11:42:05,592 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 11:42:05,593 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 11:42:05,593 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 11:42:05,593 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 11:42:05,594 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:42:05" (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-24 11:42:05,640 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 11:42:05,640 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 11:42:05,641 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncmp [2018-01-24 11:42:05,641 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 11:42:05,641 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 11:42:05,641 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 11:42:05,641 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 11:42:05,641 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 11:42:05,642 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 11:42:05,642 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 11:42:05,642 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncmp [2018-01-24 11:42:05,642 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 11:42:05,642 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 11:42:05,642 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 11:42:05,889 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 11:42:05,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:42:05 BoogieIcfgContainer [2018-01-24 11:42:05,890 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 11:42:05,890 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 11:42:05,890 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 11:42:05,892 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 11:42:05,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 11:42:05" (1/3) ... [2018-01-24 11:42:05,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11f9a032 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:42:05, skipping insertion in model container [2018-01-24 11:42:05,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:42:05" (2/3) ... [2018-01-24 11:42:05,894 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11f9a032 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:42:05, skipping insertion in model container [2018-01-24 11:42:05,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:42:05" (3/3) ... [2018-01-24 11:42:05,896 INFO L105 eAbstractionObserver]: Analyzing ICFG cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-01-24 11:42:05,903 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 11:42:05,909 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-24 11:42:05,953 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 11:42:05,953 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 11:42:05,953 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 11:42:05,954 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 11:42:05,954 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 11:42:05,954 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 11:42:05,954 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 11:42:05,954 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 11:42:05,955 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 11:42:05,977 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2018-01-24 11:42:05,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 11:42:05,984 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:42:05,985 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:42:05,986 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-24 11:42:05,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1779029996, now seen corresponding path program 1 times [2018-01-24 11:42:05,993 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:42:05,994 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:42:06,042 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:42:06,042 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:42:06,043 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:42:06,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:42:06,103 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:42:06,214 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-24 11:42:06,217 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:42:06,217 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 11:42:06,219 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 11:42:06,234 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 11:42:06,235 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 11:42:06,237 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 4 states. [2018-01-24 11:42:06,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:42:06,441 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2018-01-24 11:42:06,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 11:42:06,444 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-24 11:42:06,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:42:06,455 INFO L225 Difference]: With dead ends: 83 [2018-01-24 11:42:06,455 INFO L226 Difference]: Without dead ends: 57 [2018-01-24 11:42:06,458 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:42:06,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-24 11:42:06,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-01-24 11:42:06,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-24 11:42:06,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2018-01-24 11:42:06,494 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 13 [2018-01-24 11:42:06,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:42:06,494 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2018-01-24 11:42:06,495 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 11:42:06,495 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2018-01-24 11:42:06,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 11:42:06,495 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:42:06,496 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:42:06,496 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-24 11:42:06,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1779029997, now seen corresponding path program 1 times [2018-01-24 11:42:06,496 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:42:06,496 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:42:06,497 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:42:06,498 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:42:06,498 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:42:06,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:42:06,517 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:42:06,718 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-24 11:42:06,718 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:42:06,719 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 11:42:06,720 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 11:42:06,720 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 11:42:06,721 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-24 11:42:06,721 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand 6 states. [2018-01-24 11:42:06,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:42:06,878 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2018-01-24 11:42:06,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 11:42:06,878 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-01-24 11:42:06,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:42:06,879 INFO L225 Difference]: With dead ends: 57 [2018-01-24 11:42:06,879 INFO L226 Difference]: Without dead ends: 56 [2018-01-24 11:42:06,880 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-24 11:42:06,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-01-24 11:42:06,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-01-24 11:42:06,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-24 11:42:06,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2018-01-24 11:42:06,886 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 13 [2018-01-24 11:42:06,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:42:06,886 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2018-01-24 11:42:06,886 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 11:42:06,886 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2018-01-24 11:42:06,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 11:42:06,887 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:42:06,887 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:42:06,887 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-24 11:42:06,887 INFO L82 PathProgramCache]: Analyzing trace with hash -684644977, now seen corresponding path program 1 times [2018-01-24 11:42:06,887 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:42:06,887 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:42:06,888 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:42:06,888 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:42:06,888 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:42:06,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:42:06,901 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:42:06,932 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-24 11:42:06,932 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:42:06,932 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 11:42:06,933 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 11:42:06,933 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 11:42:06,933 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 11:42:06,933 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand 4 states. [2018-01-24 11:42:06,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:42:06,985 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2018-01-24 11:42:06,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 11:42:06,986 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 11:42:06,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:42:06,987 INFO L225 Difference]: With dead ends: 56 [2018-01-24 11:42:06,987 INFO L226 Difference]: Without dead ends: 55 [2018-01-24 11:42:06,987 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:42:06,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-24 11:42:06,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-01-24 11:42:06,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-24 11:42:06,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2018-01-24 11:42:06,993 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 14 [2018-01-24 11:42:06,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:42:06,993 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2018-01-24 11:42:06,993 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 11:42:06,993 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2018-01-24 11:42:06,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 11:42:06,994 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:42:06,994 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:42:06,994 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-24 11:42:06,994 INFO L82 PathProgramCache]: Analyzing trace with hash -684644976, now seen corresponding path program 1 times [2018-01-24 11:42:06,994 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:42:06,994 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:42:06,995 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:42:06,995 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:42:06,995 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:42:07,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:42:07,005 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:42:07,079 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-24 11:42:07,080 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:42:07,080 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 11:42:07,080 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 11:42:07,080 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 11:42:07,080 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:42:07,081 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand 5 states. [2018-01-24 11:42:07,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:42:07,135 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2018-01-24 11:42:07,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 11:42:07,136 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 11:42:07,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:42:07,137 INFO L225 Difference]: With dead ends: 55 [2018-01-24 11:42:07,137 INFO L226 Difference]: Without dead ends: 54 [2018-01-24 11:42:07,137 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-24 11:42:07,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-24 11:42:07,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-24 11:42:07,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-24 11:42:07,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2018-01-24 11:42:07,144 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 14 [2018-01-24 11:42:07,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:42:07,144 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2018-01-24 11:42:07,145 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 11:42:07,145 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2018-01-24 11:42:07,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 11:42:07,146 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:42:07,146 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:42:07,146 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-24 11:42:07,146 INFO L82 PathProgramCache]: Analyzing trace with hash 518960417, now seen corresponding path program 1 times [2018-01-24 11:42:07,146 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:42:07,146 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:42:07,147 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:42:07,148 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:42:07,148 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:42:07,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:42:07,164 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:42:07,225 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-24 11:42:07,226 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:42:07,226 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 11:42:07,226 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 11:42:07,226 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 11:42:07,226 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:42:07,226 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand 5 states. [2018-01-24 11:42:07,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:42:07,302 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-01-24 11:42:07,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 11:42:07,302 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-01-24 11:42:07,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:42:07,303 INFO L225 Difference]: With dead ends: 54 [2018-01-24 11:42:07,303 INFO L226 Difference]: Without dead ends: 51 [2018-01-24 11:42:07,304 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 11:42:07,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-24 11:42:07,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-24 11:42:07,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-24 11:42:07,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2018-01-24 11:42:07,309 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 22 [2018-01-24 11:42:07,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:42:07,309 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2018-01-24 11:42:07,309 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 11:42:07,309 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-01-24 11:42:07,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 11:42:07,310 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:42:07,310 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:42:07,310 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-24 11:42:07,310 INFO L82 PathProgramCache]: Analyzing trace with hash 518960418, now seen corresponding path program 1 times [2018-01-24 11:42:07,310 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:42:07,310 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:42:07,311 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:42:07,311 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:42:07,311 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:42:07,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:42:07,329 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:42:07,443 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-24 11:42:07,443 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:42:07,443 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 11:42:07,444 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 11:42:07,444 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 11:42:07,444 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 11:42:07,444 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 8 states. [2018-01-24 11:42:07,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:42:07,557 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2018-01-24 11:42:07,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 11:42:07,557 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-01-24 11:42:07,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:42:07,560 INFO L225 Difference]: With dead ends: 77 [2018-01-24 11:42:07,560 INFO L226 Difference]: Without dead ends: 74 [2018-01-24 11:42:07,560 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-01-24 11:42:07,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-24 11:42:07,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 61. [2018-01-24 11:42:07,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-24 11:42:07,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2018-01-24 11:42:07,568 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 22 [2018-01-24 11:42:07,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:42:07,568 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 73 transitions. [2018-01-24 11:42:07,568 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 11:42:07,568 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2018-01-24 11:42:07,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 11:42:07,569 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:42:07,569 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:42:07,569 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-24 11:42:07,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1092096233, now seen corresponding path program 1 times [2018-01-24 11:42:07,570 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:42:07,570 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:42:07,571 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:42:07,571 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:42:07,571 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:42:07,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:42:07,584 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:42:07,618 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-24 11:42:07,618 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:42:07,618 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 11:42:07,619 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 11:42:07,619 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 11:42:07,619 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:42:07,619 INFO L87 Difference]: Start difference. First operand 61 states and 73 transitions. Second operand 5 states. [2018-01-24 11:42:07,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:42:07,696 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2018-01-24 11:42:07,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 11:42:07,696 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-01-24 11:42:07,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:42:07,697 INFO L225 Difference]: With dead ends: 61 [2018-01-24 11:42:07,697 INFO L226 Difference]: Without dead ends: 59 [2018-01-24 11:42:07,698 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 11:42:07,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-24 11:42:07,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-01-24 11:42:07,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-24 11:42:07,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2018-01-24 11:42:07,705 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 23 [2018-01-24 11:42:07,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:42:07,706 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2018-01-24 11:42:07,706 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 11:42:07,706 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2018-01-24 11:42:07,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 11:42:07,707 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:42:07,707 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:42:07,707 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-24 11:42:07,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1092096232, now seen corresponding path program 1 times [2018-01-24 11:42:07,708 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:42:07,708 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:42:07,708 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:42:07,708 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:42:07,708 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:42:07,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:42:07,722 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:42:07,838 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-24 11:42:07,838 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:42:07,838 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 11:42:07,838 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 11:42:07,839 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 11:42:07,839 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-24 11:42:07,839 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand 8 states. [2018-01-24 11:42:07,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:42:07,975 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2018-01-24 11:42:07,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 11:42:07,976 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-01-24 11:42:07,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:42:07,977 INFO L225 Difference]: With dead ends: 70 [2018-01-24 11:42:07,977 INFO L226 Difference]: Without dead ends: 68 [2018-01-24 11:42:07,978 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-24 11:42:07,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-24 11:42:07,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 61. [2018-01-24 11:42:07,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-24 11:42:07,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2018-01-24 11:42:07,985 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 23 [2018-01-24 11:42:07,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:42:07,986 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2018-01-24 11:42:07,986 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 11:42:07,986 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2018-01-24 11:42:07,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 11:42:07,987 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:42:07,987 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:42:07,987 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-24 11:42:07,988 INFO L82 PathProgramCache]: Analyzing trace with hash -2118091962, now seen corresponding path program 1 times [2018-01-24 11:42:07,988 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:42:07,988 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:42:07,989 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:42:07,989 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:42:07,989 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:42:08,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:42:08,004 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:42:08,136 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-24 11:42:08,136 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:42:08,136 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 11:42:08,136 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 11:42:08,137 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 11:42:08,137 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 11:42:08,137 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand 6 states. [2018-01-24 11:42:08,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:42:08,348 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2018-01-24 11:42:08,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 11:42:08,348 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-01-24 11:42:08,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:42:08,349 INFO L225 Difference]: With dead ends: 61 [2018-01-24 11:42:08,349 INFO L226 Difference]: Without dead ends: 46 [2018-01-24 11:42:08,350 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-24 11:42:08,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-24 11:42:08,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-01-24 11:42:08,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-24 11:42:08,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-01-24 11:42:08,355 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 26 [2018-01-24 11:42:08,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:42:08,356 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-01-24 11:42:08,356 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 11:42:08,356 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-01-24 11:42:08,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 11:42:08,356 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:42:08,356 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:42:08,356 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-24 11:42:08,357 INFO L82 PathProgramCache]: Analyzing trace with hash 487859445, now seen corresponding path program 1 times [2018-01-24 11:42:08,357 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:42:08,357 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:42:08,357 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:42:08,358 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:42:08,358 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:42:08,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:42:08,369 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:42:08,389 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:42:08,389 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:42:08,389 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 11:42:08,390 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 11:42:08,390 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 11:42:08,390 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 11:42:08,390 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 3 states. [2018-01-24 11:42:08,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:42:08,401 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2018-01-24 11:42:08,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 11:42:08,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-01-24 11:42:08,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:42:08,402 INFO L225 Difference]: With dead ends: 69 [2018-01-24 11:42:08,402 INFO L226 Difference]: Without dead ends: 47 [2018-01-24 11:42:08,403 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 11:42:08,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-01-24 11:42:08,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-01-24 11:42:08,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-24 11:42:08,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-01-24 11:42:08,409 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 28 [2018-01-24 11:42:08,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:42:08,409 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-01-24 11:42:08,409 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 11:42:08,410 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-01-24 11:42:08,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 11:42:08,410 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:42:08,411 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:42:08,411 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-24 11:42:08,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1854244690, now seen corresponding path program 1 times [2018-01-24 11:42:08,411 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:42:08,411 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:42:08,412 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:42:08,412 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:42:08,412 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:42:08,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:42:08,425 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:42:08,463 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:42:08,463 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:42:08,464 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 11:42:08,464 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 11:42:08,464 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 11:42:08,465 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 11:42:08,465 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 3 states. [2018-01-24 11:42:08,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:42:08,479 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2018-01-24 11:42:08,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 11:42:08,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-01-24 11:42:08,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:42:08,480 INFO L225 Difference]: With dead ends: 68 [2018-01-24 11:42:08,480 INFO L226 Difference]: Without dead ends: 47 [2018-01-24 11:42:08,480 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 11:42:08,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-01-24 11:42:08,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-01-24 11:42:08,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-24 11:42:08,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2018-01-24 11:42:08,485 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 31 [2018-01-24 11:42:08,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:42:08,486 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2018-01-24 11:42:08,486 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 11:42:08,486 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2018-01-24 11:42:08,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 11:42:08,487 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:42:08,487 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:42:08,487 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-24 11:42:08,487 INFO L82 PathProgramCache]: Analyzing trace with hash 2022484201, now seen corresponding path program 1 times [2018-01-24 11:42:08,488 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:42:08,488 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:42:08,489 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:42:08,489 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:42:08,489 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:42:08,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:42:08,507 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:42:08,885 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:42:08,885 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:42:08,886 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-24 11:42:08,886 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 11:42:08,886 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 11:42:08,886 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-01-24 11:42:08,886 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 12 states. [2018-01-24 11:42:09,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:42:09,104 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2018-01-24 11:42:09,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 11:42:09,104 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2018-01-24 11:42:09,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:42:09,106 INFO L225 Difference]: With dead ends: 89 [2018-01-24 11:42:09,106 INFO L226 Difference]: Without dead ends: 47 [2018-01-24 11:42:09,106 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2018-01-24 11:42:09,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-01-24 11:42:09,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-01-24 11:42:09,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-24 11:42:09,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2018-01-24 11:42:09,112 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 33 [2018-01-24 11:42:09,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:42:09,112 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2018-01-24 11:42:09,112 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 11:42:09,112 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2018-01-24 11:42:09,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 11:42:09,113 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:42:09,113 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:42:09,114 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-24 11:42:09,114 INFO L82 PathProgramCache]: Analyzing trace with hash -349255061, now seen corresponding path program 1 times [2018-01-24 11:42:09,114 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:42:09,114 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:42:09,115 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:42:09,115 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:42:09,115 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:42:09,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:42:09,133 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:42:09,429 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:42:09,429 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:42:09,429 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-24 11:42:09,441 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:42:09,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:42:09,485 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:42:09,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-24 11:42:09,534 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:42:09,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:42:09,538 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 11:42:09,592 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:42:09,593 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:42:09,595 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-24 11:42:09,595 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:42:09,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:42:09,598 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-24 11:42:09,724 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-24 11:42:09,728 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-24 11:42:09,728 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:42:09,732 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:42:09,740 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-24 11:42:09,740 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-01-24 11:42:09,788 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-24 11:42:09,791 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-24 11:42:09,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:42:09,815 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:42:09,831 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-24 11:42:09,831 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-01-24 11:42:10,056 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-24 11:42:10,074 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-24 11:42:10,074 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 11:42:10,082 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-24 11:42:10,083 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 11:42:10,086 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:42:10,097 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-24 11:42:10,098 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:48, output treesize:33 [2018-01-24 11:42:10,193 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:42:10,215 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:42:10,215 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 23 [2018-01-24 11:42:10,216 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-24 11:42:10,216 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-24 11:42:10,216 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=494, Unknown=0, NotChecked=0, Total=552 [2018-01-24 11:42:10,216 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 24 states. [2018-01-24 11:42:10,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:42:10,925 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2018-01-24 11:42:10,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 11:42:10,925 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 33 [2018-01-24 11:42:10,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:42:10,926 INFO L225 Difference]: With dead ends: 69 [2018-01-24 11:42:10,926 INFO L226 Difference]: Without dead ends: 66 [2018-01-24 11:42:10,926 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=165, Invalid=957, Unknown=0, NotChecked=0, Total=1122 [2018-01-24 11:42:10,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-24 11:42:10,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2018-01-24 11:42:10,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-24 11:42:10,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-01-24 11:42:10,932 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 33 [2018-01-24 11:42:10,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:42:10,932 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2018-01-24 11:42:10,932 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-24 11:42:10,932 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-01-24 11:42:10,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 11:42:10,933 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:42:10,934 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:42:10,934 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-24 11:42:10,934 INFO L82 PathProgramCache]: Analyzing trace with hash 2057994991, now seen corresponding path program 1 times [2018-01-24 11:42:10,934 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:42:10,934 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:42:10,935 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:42:10,935 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:42:10,935 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:42:10,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:42:10,951 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:42:11,145 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:42:11,145 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:42:11,145 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-24 11:42:11,150 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:42:11,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:42:11,169 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:42:11,174 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-24 11:42:11,175 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-24 11:42:11,176 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:42:11,177 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:42:11,181 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-24 11:42:11,182 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-24 11:42:11,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 29 [2018-01-24 11:42:11,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 23 [2018-01-24 11:42:11,528 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 11:42:11,546 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 25 treesize of output 18 [2018-01-24 11:42:11,547 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 11:42:11,563 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 18 treesize of output 16 [2018-01-24 11:42:11,564 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-24 11:42:11,575 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-24 11:42:11,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:42:11,590 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:45, output treesize:33 [2018-01-24 11:42:11,665 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:42:11,687 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:42:11,687 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 23 [2018-01-24 11:42:11,687 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-24 11:42:11,687 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-24 11:42:11,688 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=494, Unknown=0, NotChecked=0, Total=552 [2018-01-24 11:42:11,688 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 24 states. [2018-01-24 11:42:12,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:42:12,483 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2018-01-24 11:42:12,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 11:42:12,484 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 34 [2018-01-24 11:42:12,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:42:12,485 INFO L225 Difference]: With dead ends: 66 [2018-01-24 11:42:12,485 INFO L226 Difference]: Without dead ends: 60 [2018-01-24 11:42:12,486 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=169, Invalid=1021, Unknown=0, NotChecked=0, Total=1190 [2018-01-24 11:42:12,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-24 11:42:12,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2018-01-24 11:42:12,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-24 11:42:12,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2018-01-24 11:42:12,493 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 34 [2018-01-24 11:42:12,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:42:12,494 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2018-01-24 11:42:12,494 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-24 11:42:12,494 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-01-24 11:42:12,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-24 11:42:12,495 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:42:12,495 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:42:12,495 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-24 11:42:12,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1216715776, now seen corresponding path program 2 times [2018-01-24 11:42:12,495 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:42:12,496 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:42:12,496 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:42:12,496 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:42:12,496 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:42:12,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:42:12,515 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:42:12,918 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:42:12,918 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:42:12,918 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-24 11:42:12,926 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 11:42:12,941 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:42:12,948 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:42:12,950 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 11:42:12,954 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:42:12,957 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-24 11:42:12,958 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:42:12,962 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-24 11:42:12,963 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:42:12,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:42:12,966 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 11:42:12,999 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:42:13,000 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-24 11:42:13,000 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:42:13,007 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:42:13,007 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:42:13,008 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-24 11:42:13,008 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:42:13,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:42:13,035 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-24 11:42:13,098 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-24 11:42:13,100 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-24 11:42:13,100 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:42:13,102 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:42:13,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:42:13,107 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-01-24 11:42:13,133 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-24 11:42:13,134 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-24 11:42:13,135 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:42:13,138 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:42:13,144 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-24 11:42:13,144 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:35 [2018-01-24 11:42:13,369 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-24 11:42:13,371 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-24 11:42:13,371 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:42:13,379 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-24 11:42:13,380 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-24 11:42:13,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:42:13,391 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-24 11:42:13,392 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:54, output treesize:49 [2018-01-24 11:42:13,483 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:42:13,508 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:42:13,508 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2018-01-24 11:42:13,508 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-24 11:42:13,508 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-24 11:42:13,509 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=595, Unknown=0, NotChecked=0, Total=650 [2018-01-24 11:42:13,509 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 26 states. [2018-01-24 11:42:14,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:42:14,724 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-01-24 11:42:14,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-24 11:42:14,724 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 44 [2018-01-24 11:42:14,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:42:14,725 INFO L225 Difference]: With dead ends: 60 [2018-01-24 11:42:14,725 INFO L226 Difference]: Without dead ends: 57 [2018-01-24 11:42:14,726 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=208, Invalid=1352, Unknown=0, NotChecked=0, Total=1560 [2018-01-24 11:42:14,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-24 11:42:14,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2018-01-24 11:42:14,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-24 11:42:14,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2018-01-24 11:42:14,733 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 44 [2018-01-24 11:42:14,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:42:14,733 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2018-01-24 11:42:14,733 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-24 11:42:14,733 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2018-01-24 11:42:14,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-24 11:42:14,734 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:42:14,734 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:42:14,734 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-24 11:42:14,734 INFO L82 PathProgramCache]: Analyzing trace with hash -936516614, now seen corresponding path program 2 times [2018-01-24 11:42:14,734 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:42:14,734 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:42:14,735 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:42:14,735 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 11:42:14,735 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:42:14,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:42:14,750 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:42:15,348 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:42:15,349 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:42:15,349 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-24 11:42:15,355 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 11:42:15,369 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:42:15,377 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:42:15,380 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 11:42:15,383 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:42:15,389 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-24 11:42:15,389 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:42:15,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:42:15,403 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 11:42:15,509 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-24 11:42:15,511 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-24 11:42:15,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:42:15,513 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:42:15,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:42:15,517 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-01-24 11:42:15,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 31 [2018-01-24 11:42:15,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 25 [2018-01-24 11:42:15,777 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 11:42:15,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-01-24 11:42:15,793 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 11:42:15,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-01-24 11:42:15,795 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 11:42:15,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 27 [2018-01-24 11:42:15,817 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-01-24 11:42:15,828 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-24 11:42:15,842 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-24 11:42:15,843 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:49, output treesize:49 [2018-01-24 11:42:15,935 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:42:15,957 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:42:15,957 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2018-01-24 11:42:15,957 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-24 11:42:15,957 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-24 11:42:15,958 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=633, Unknown=0, NotChecked=0, Total=702 [2018-01-24 11:42:15,958 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 27 states. [2018-01-24 11:42:17,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:42:17,091 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-01-24 11:42:17,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-24 11:42:17,091 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 45 [2018-01-24 11:42:17,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:42:17,091 INFO L225 Difference]: With dead ends: 57 [2018-01-24 11:42:17,091 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 11:42:17,092 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=270, Invalid=1710, Unknown=0, NotChecked=0, Total=1980 [2018-01-24 11:42:17,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 11:42:17,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 11:42:17,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 11:42:17,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 11:42:17,093 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2018-01-24 11:42:17,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:42:17,093 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 11:42:17,093 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-24 11:42:17,093 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 11:42:17,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 11:42:17,097 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 11:42:17,588 WARN L146 SmtUtils]: Spent 356ms on a formula simplification. DAG size of input: 101 DAG size of output 73 [2018-01-24 11:42:25,877 WARN L146 SmtUtils]: Spent 8286ms on a formula simplification. DAG size of input: 191 DAG size of output 146 [2018-01-24 11:42:25,881 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 569) no Hoare annotation was computed. [2018-01-24 11:42:25,881 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 569) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 11:42:25,881 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 569) no Hoare annotation was computed. [2018-01-24 11:42:25,882 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 569) the Hoare annotation is: true [2018-01-24 11:42:25,882 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 569) no Hoare annotation was computed. [2018-01-24 11:42:25,882 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 569) the Hoare annotation is: true [2018-01-24 11:42:25,882 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 569) no Hoare annotation was computed. [2018-01-24 11:42:25,882 INFO L401 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 569) no Hoare annotation was computed. [2018-01-24 11:42:25,882 INFO L401 ceAbstractionStarter]: For program point L565'''(line 565) no Hoare annotation was computed. [2018-01-24 11:42:25,882 INFO L401 ceAbstractionStarter]: For program point L561'(lines 561 563) no Hoare annotation was computed. [2018-01-24 11:42:25,882 INFO L401 ceAbstractionStarter]: For program point L564(line 564) no Hoare annotation was computed. [2018-01-24 11:42:25,882 INFO L397 ceAbstractionStarter]: At program point L568(line 568) the Hoare annotation is: (let ((.cse5 (select |#length| main_~nondetString1~4.base)) (.cse18 (select |#length| main_~nondetString2~4.base))) (let ((.cse2 (select |#memory_int| main_~nondetString2~4.base)) (.cse0 (= main_~length1~4 (select |#length| |main_#t~malloc13.base|))) (.cse3 (= 1 (select |#valid| |main_#t~malloc14.base|))) (.cse4 (= 1 (select |#valid| main_~nondetString1~4.base))) (.cse1 (select |#length| |main_#t~malloc14.base|)) (.cse6 (not (= main_~nondetString1~4.base main_~nondetString2~4.base))) (.cse7 (<= 1 main_~length2~4)) (.cse8 (= main_~nondetString2~4.offset 0)) (.cse9 (= |old(#valid)| (store (store |#valid| |main_#t~malloc13.base| (select (store |#valid| |main_#t~malloc13.base| 0) |main_#t~malloc13.base|)) |main_#t~malloc14.base| 0))) (.cse10 (= main_~length2~4 .cse18)) (.cse11 (= 0 |main_#t~malloc13.offset|)) (.cse12 (<= (+ main_~nondetString1~4.offset 1) .cse5)) (.cse13 (= 0 |main_#t~malloc14.offset|)) (.cse14 (= 1 (select |#valid| main_~nondetString2~4.base))) (.cse15 (= 1 (select |#valid| |main_#t~malloc13.base|))) (.cse16 (not (= |main_#t~malloc13.base| |main_#t~malloc14.base|))) (.cse17 (not (= main_~nondetString1~4.base |main_#t~malloc14.base|)))) (or (and .cse0 (= main_~length2~4 .cse1) (= 0 (select (select (store |#memory_int| main_~nondetString2~4.base (store .cse2 (+ main_~length2~4 main_~nondetString2~4.offset (- 1)) 0)) main_~nondetString1~4.base) main_~nondetString1~4.offset)) .cse3 .cse4 (= main_~length1~4 .cse5) .cse6 .cse7 .cse8 (<= main_~length1~4 1) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= 1 (+ main_~length1~4 main_~nondetString1~4.offset))) (and (= (select .cse2 (+ .cse18 main_~nondetString2~4.offset (- 1))) 0) .cse0 (= main_~nondetString1~4.offset 0) .cse3 .cse4 (= .cse1 main_~length2~4) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= .cse5 main_~length1~4) (= (select (select |#memory_int| main_~nondetString1~4.base) (+ main_~nondetString1~4.offset .cse5 (- 1))) 0) .cse15 .cse16 .cse17)))) [2018-01-24 11:42:25,882 INFO L401 ceAbstractionStarter]: For program point L567(line 567) no Hoare annotation was computed. [2018-01-24 11:42:25,882 INFO L401 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-01-24 11:42:25,883 INFO L401 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-01-24 11:42:25,883 INFO L401 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 569) no Hoare annotation was computed. [2018-01-24 11:42:25,883 INFO L401 ceAbstractionStarter]: For program point mainErr2RequiresViolation(lines 1 569) no Hoare annotation was computed. [2018-01-24 11:42:25,883 INFO L401 ceAbstractionStarter]: For program point L558''(lines 558 560) no Hoare annotation was computed. [2018-01-24 11:42:25,883 INFO L401 ceAbstractionStarter]: For program point L566'(line 566) no Hoare annotation was computed. [2018-01-24 11:42:25,883 INFO L401 ceAbstractionStarter]: For program point L568'(line 568) no Hoare annotation was computed. [2018-01-24 11:42:25,883 INFO L401 ceAbstractionStarter]: For program point mainErr3RequiresViolation(lines 1 569) no Hoare annotation was computed. [2018-01-24 11:42:25,883 INFO L401 ceAbstractionStarter]: For program point L564'(line 564) no Hoare annotation was computed. [2018-01-24 11:42:25,883 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 555 569) no Hoare annotation was computed. [2018-01-24 11:42:25,883 INFO L401 ceAbstractionStarter]: For program point mainErr4EnsuresViolation(lines 555 569) no Hoare annotation was computed. [2018-01-24 11:42:25,883 INFO L401 ceAbstractionStarter]: For program point L558(lines 558 560) no Hoare annotation was computed. [2018-01-24 11:42:25,883 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 555 569) no Hoare annotation was computed. [2018-01-24 11:42:25,883 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 555 569) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 11:42:25,883 INFO L401 ceAbstractionStarter]: For program point L564''(line 564) no Hoare annotation was computed. [2018-01-24 11:42:25,883 INFO L401 ceAbstractionStarter]: For program point L565'(line 565) no Hoare annotation was computed. [2018-01-24 11:42:25,884 INFO L401 ceAbstractionStarter]: For program point L565''(line 565) no Hoare annotation was computed. [2018-01-24 11:42:25,884 INFO L401 ceAbstractionStarter]: For program point cstrncmpErr1RequiresViolation(lines 1 569) no Hoare annotation was computed. [2018-01-24 11:42:25,884 INFO L401 ceAbstractionStarter]: For program point L546(line 546) no Hoare annotation was computed. [2018-01-24 11:42:25,884 INFO L401 ceAbstractionStarter]: For program point L545(lines 545 550) no Hoare annotation was computed. [2018-01-24 11:42:25,884 INFO L401 ceAbstractionStarter]: For program point L543(lines 543 544) no Hoare annotation was computed. [2018-01-24 11:42:25,884 INFO L401 ceAbstractionStarter]: For program point cstrncmpErr0RequiresViolation(lines 1 569) no Hoare annotation was computed. [2018-01-24 11:42:25,884 INFO L401 ceAbstractionStarter]: For program point L546''''(line 546) no Hoare annotation was computed. [2018-01-24 11:42:25,884 INFO L401 ceAbstractionStarter]: For program point cstrncmpErr3RequiresViolation(lines 1 569) no Hoare annotation was computed. [2018-01-24 11:42:25,884 INFO L401 ceAbstractionStarter]: For program point cstrncmpErr9RequiresViolation(lines 1 569) no Hoare annotation was computed. [2018-01-24 11:42:25,884 INFO L401 ceAbstractionStarter]: For program point L545''(line 545) no Hoare annotation was computed. [2018-01-24 11:42:25,885 INFO L401 ceAbstractionStarter]: For program point cstrncmpErr6RequiresViolation(lines 1 569) no Hoare annotation was computed. [2018-01-24 11:42:25,885 INFO L401 ceAbstractionStarter]: For program point cstrncmpErr5RequiresViolation(lines 1 569) no Hoare annotation was computed. [2018-01-24 11:42:25,885 INFO L401 ceAbstractionStarter]: For program point cstrncmpErr7RequiresViolation(lines 1 569) no Hoare annotation was computed. [2018-01-24 11:42:25,885 INFO L401 ceAbstractionStarter]: For program point L553''(line 553) no Hoare annotation was computed. [2018-01-24 11:42:25,885 INFO L401 ceAbstractionStarter]: For program point L545'''''''''(lines 545 550) no Hoare annotation was computed. [2018-01-24 11:42:25,885 INFO L401 ceAbstractionStarter]: For program point L545''''(line 545) no Hoare annotation was computed. [2018-01-24 11:42:25,885 INFO L401 ceAbstractionStarter]: For program point cstrncmpErr4RequiresViolation(lines 1 569) no Hoare annotation was computed. [2018-01-24 11:42:25,885 INFO L401 ceAbstractionStarter]: For program point cstrncmpErr8RequiresViolation(lines 1 569) no Hoare annotation was computed. [2018-01-24 11:42:25,885 INFO L401 ceAbstractionStarter]: For program point cstrncmpEXIT(lines 540 554) no Hoare annotation was computed. [2018-01-24 11:42:25,885 INFO L401 ceAbstractionStarter]: For program point L545'''(line 545) no Hoare annotation was computed. [2018-01-24 11:42:25,885 INFO L401 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-01-24 11:42:25,885 INFO L401 ceAbstractionStarter]: For program point L552(line 552) no Hoare annotation was computed. [2018-01-24 11:42:25,885 INFO L401 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-01-24 11:42:25,885 INFO L401 ceAbstractionStarter]: For program point L552'(line 552) no Hoare annotation was computed. [2018-01-24 11:42:25,886 INFO L404 ceAbstractionStarter]: At program point cstrncmpENTRY(lines 540 554) the Hoare annotation is: true [2018-01-24 11:42:25,886 INFO L401 ceAbstractionStarter]: For program point L545''''''(line 545) no Hoare annotation was computed. [2018-01-24 11:42:25,886 INFO L401 ceAbstractionStarter]: For program point cstrncmpErr2RequiresViolation(lines 1 569) no Hoare annotation was computed. [2018-01-24 11:42:25,886 INFO L401 ceAbstractionStarter]: For program point L546''(line 546) no Hoare annotation was computed. [2018-01-24 11:42:25,886 INFO L401 ceAbstractionStarter]: For program point L545'(line 545) no Hoare annotation was computed. [2018-01-24 11:42:25,886 INFO L397 ceAbstractionStarter]: At program point L545''''''''(lines 545 550) the Hoare annotation is: (let ((.cse11 (select |#length| cstrncmp_~s1.base))) (let ((.cse14 (not (= 0 |cstrncmp_#in~s1.offset|))) (.cse5 (not (= 1 (select |#valid| |cstrncmp_#in~s2.base|)))) (.cse6 (< (select |#length| |cstrncmp_#in~s2.base|) 1)) (.cse7 (not (= (select |#valid| |cstrncmp_#in~s1.base|) 1))) (.cse15 (not (= 0 |cstrncmp_#in~s2.offset|))) (.cse0 (= cstrncmp_~s2.offset 0)) (.cse1 (= cstrncmp_~s1.offset 0)) (.cse2 (= 1 (select |#valid| cstrncmp_~s1.base))) (.cse3 (<= 1 .cse11)) (.cse12 (select |#length| cstrncmp_~s2.base)) (.cse4 (= 1 (select |#valid| cstrncmp_~s2.base)))) (and (let ((.cse8 (exists ((v_main_~nondetString1~4.offset_BEFORE_CALL_2 Int)) (and (<= 0 v_main_~nondetString1~4.offset_BEFORE_CALL_2) (<= (+ v_main_~nondetString1~4.offset_BEFORE_CALL_2 1) cstrncmp_~s1.offset) (= 0 (select (select |#memory_int| cstrncmp_~s1.base) (+ v_main_~nondetString1~4.offset_BEFORE_CALL_2 (select |#length| cstrncmp_~s1.base) (- 1)))) (<= v_main_~nondetString1~4.offset_BEFORE_CALL_2 0)))) (.cse9 (<= (+ cstrncmp_~s2.offset 1) .cse12)) (.cse10 (exists ((v_main_~nondetString2~4.offset_BEFORE_CALL_2 Int)) (and (= 0 (select (select |#memory_int| cstrncmp_~s2.base) (+ v_main_~nondetString2~4.offset_BEFORE_CALL_2 (select |#length| cstrncmp_~s2.base) (- 1)))) (<= 0 v_main_~nondetString2~4.offset_BEFORE_CALL_2) (<= (+ v_main_~nondetString2~4.offset_BEFORE_CALL_2 1) cstrncmp_~s2.offset) (<= v_main_~nondetString2~4.offset_BEFORE_CALL_2 0)))) (.cse13 (<= (+ cstrncmp_~s1.offset 1) .cse11))) (or (and (exists ((v_main_~nondetString2~4.offset_BEFORE_CALL_2 Int)) (and (= 0 (select (select |#memory_int| cstrncmp_~s2.base) (+ v_main_~nondetString2~4.offset_BEFORE_CALL_2 (select |#length| cstrncmp_~s2.base) (- 1)))) (<= 0 v_main_~nondetString2~4.offset_BEFORE_CALL_2) (<= v_main_~nondetString2~4.offset_BEFORE_CALL_2 cstrncmp_~s2.offset) (<= v_main_~nondetString2~4.offset_BEFORE_CALL_2 0))) .cse0 .cse1 (exists ((v_main_~nondetString1~4.offset_BEFORE_CALL_2 Int)) (and (<= 0 v_main_~nondetString1~4.offset_BEFORE_CALL_2) (<= v_main_~nondetString1~4.offset_BEFORE_CALL_2 cstrncmp_~s1.offset) (= 0 (select (select |#memory_int| cstrncmp_~s1.base) (+ v_main_~nondetString1~4.offset_BEFORE_CALL_2 (select |#length| cstrncmp_~s1.base) (- 1)))) (<= v_main_~nondetString1~4.offset_BEFORE_CALL_2 0))) .cse2 .cse3 (exists ((main_~length2~4 Int) (v_main_~nondetString2~4.offset_BEFORE_CALL_1 Int)) (and (= (select (select |#memory_int| cstrncmp_~s2.base) (+ main_~length2~4 v_main_~nondetString2~4.offset_BEFORE_CALL_1 (- 1))) 0) (<= (+ main_~length2~4 v_main_~nondetString2~4.offset_BEFORE_CALL_1) (select |#length| cstrncmp_~s2.base)) (<= cstrncmp_~s2.offset v_main_~nondetString2~4.offset_BEFORE_CALL_1) (<= 1 main_~length2~4))) .cse4) .cse5 .cse6 (not (exists ((main_~nondetString2~4.offset Int) (main_~nondetString2~4.base Int)) (and (= 0 (select (select |#memory_int| main_~nondetString2~4.base) (+ main_~nondetString2~4.offset (select |#length| main_~nondetString2~4.base) (- 1)))) (not (= main_~nondetString2~4.base |cstrncmp_#in~s1.base|))))) .cse7 (and .cse8 .cse9 .cse2 .cse10 (or (<= (+ cstrncmp_~s1.offset 2) .cse11) (= 1 cstrncmp_~s1.offset)) (or (<= (+ cstrncmp_~s2.offset 2) .cse12) (= 1 cstrncmp_~s2.offset)) .cse13 .cse4) (and (<= 2 cstrncmp_~s2.offset) .cse8 (<= 2 cstrncmp_~s1.offset) .cse9 .cse2 .cse10 .cse13 .cse4) .cse14 (not (exists ((main_~length1~4 Int) (v_main_~nondetString1~4.offset_BEFORE_CALL_1 Int)) (and (<= (+ main_~length1~4 v_main_~nondetString1~4.offset_BEFORE_CALL_1) (select |#length| |cstrncmp_#in~s1.base|)) (= (select (select |#memory_int| |cstrncmp_#in~s1.base|) (+ main_~length1~4 v_main_~nondetString1~4.offset_BEFORE_CALL_1 (- 1))) 0) (<= 1 main_~length1~4) (<= |cstrncmp_#in~s1.offset| v_main_~nondetString1~4.offset_BEFORE_CALL_1)))) (not (exists ((v_main_~nondetString2~4.offset_BEFORE_CALL_2 Int)) (and (= 0 (select (select |#memory_int| |cstrncmp_#in~s2.base|) (+ v_main_~nondetString2~4.offset_BEFORE_CALL_2 (select |#length| |cstrncmp_#in~s2.base|) (- 1)))) (<= v_main_~nondetString2~4.offset_BEFORE_CALL_2 |cstrncmp_#in~s2.offset|) (<= 0 v_main_~nondetString2~4.offset_BEFORE_CALL_2) (<= v_main_~nondetString2~4.offset_BEFORE_CALL_2 0)))) (not (exists ((v_main_~nondetString1~4.offset_BEFORE_CALL_2 Int)) (and (<= 0 v_main_~nondetString1~4.offset_BEFORE_CALL_2) (<= v_main_~nondetString1~4.offset_BEFORE_CALL_2 |cstrncmp_#in~s1.offset|) (= 0 (select (select |#memory_int| |cstrncmp_#in~s1.base|) (+ v_main_~nondetString1~4.offset_BEFORE_CALL_2 (select |#length| |cstrncmp_#in~s1.base|) (- 1)))) (<= v_main_~nondetString1~4.offset_BEFORE_CALL_2 0)))) .cse15)) (or (< (select |#length| |cstrncmp_#in~s1.base|) 1) .cse14 .cse5 (not (= 0 (select (select |#memory_int| |cstrncmp_#in~s1.base|) |cstrncmp_#in~s1.offset|))) .cse6 .cse7 .cse15 (and .cse0 .cse1 .cse2 .cse3 (<= 1 .cse12) (= 0 (select (select |#memory_int| cstrncmp_~s1.base) cstrncmp_~s1.offset)) .cse4))))) [2018-01-24 11:42:25,886 INFO L401 ceAbstractionStarter]: For program point L546'''(line 546) no Hoare annotation was computed. [2018-01-24 11:42:25,886 INFO L401 ceAbstractionStarter]: For program point cstrncmpFINAL(lines 540 554) no Hoare annotation was computed. [2018-01-24 11:42:25,897 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,898 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,898 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,899 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,899 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,899 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,900 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,900 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,900 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 11:42:25,900 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:42:25,901 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 11:42:25,901 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:42:25,901 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:42:25,901 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 11:42:25,901 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-24 11:42:25,902 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-24 11:42:25,902 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-24 11:42:25,902 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-24 11:42:25,902 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,903 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,903 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,903 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,904 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,904 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,904 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,904 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,905 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,905 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,906 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,906 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,906 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,906 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,907 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,907 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,907 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 11:42:25,907 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:42:25,908 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 11:42:25,908 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:42:25,908 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 11:42:25,908 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:42:25,909 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,909 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,909 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,909 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,910 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,910 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,910 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,910 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,913 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:42:25,913 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:25,914 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:42:25,914 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:25,914 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:25,914 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:42:25,914 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:25,915 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:25,915 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:42:25,915 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:25,915 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:42:25,915 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:25,916 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:25,916 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:42:25,916 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:25,916 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:25,916 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:25,917 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:25,917 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:42:25,917 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:25,917 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:25,918 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:42:25,918 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:25,918 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:25,918 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:25,918 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:42:25,918 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:42:25,918 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:25,919 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:42:25,919 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:25,919 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:25,919 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:42:25,919 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:25,919 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:25,919 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:25,920 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:42:25,933 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,933 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,934 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,934 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,934 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,934 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,935 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,935 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,935 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 11:42:25,936 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:42:25,936 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 11:42:25,936 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:42:25,936 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:42:25,937 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 11:42:25,937 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-24 11:42:25,937 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-24 11:42:25,937 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-24 11:42:25,938 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-24 11:42:25,938 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,938 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,939 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,939 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,939 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,939 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,940 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,940 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,940 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,941 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,941 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,941 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,941 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,942 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,942 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,942 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,943 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 11:42:25,943 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:42:25,943 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 11:42:25,943 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:42:25,943 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 11:42:25,944 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:42:25,944 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,944 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,944 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,945 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,945 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,945 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,945 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,945 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,946 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:42:25,946 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:25,947 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:42:25,947 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:25,947 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:25,947 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:42:25,948 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:25,948 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:25,948 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:42:25,948 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:25,949 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:42:25,949 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:25,949 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:25,950 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:42:25,950 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:25,950 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:25,950 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:25,950 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:25,951 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:42:25,951 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:25,951 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:25,951 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:42:25,951 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:25,951 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:25,952 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:25,952 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:42:25,952 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:42:25,952 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:25,952 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:42:25,952 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:25,952 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:25,953 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:42:25,953 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:25,953 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:25,953 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:25,953 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:42:25,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 11:42:25 BoogieIcfgContainer [2018-01-24 11:42:25,956 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 11:42:25,957 INFO L168 Benchmark]: Toolchain (without parser) took 20624.28 ms. Allocated memory was 301.5 MB in the beginning and 593.5 MB in the end (delta: 292.0 MB). Free memory was 261.5 MB in the beginning and 425.1 MB in the end (delta: -163.6 MB). Peak memory consumption was 247.1 MB. Max. memory is 5.3 GB. [2018-01-24 11:42:25,958 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 301.5 MB. Free memory is still 267.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 11:42:25,958 INFO L168 Benchmark]: CACSL2BoogieTranslator took 218.35 ms. Allocated memory is still 301.5 MB. Free memory was 260.5 MB in the beginning and 250.3 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. [2018-01-24 11:42:25,958 INFO L168 Benchmark]: Boogie Preprocessor took 34.84 ms. Allocated memory is still 301.5 MB. Free memory was 250.3 MB in the beginning and 248.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 11:42:25,959 INFO L168 Benchmark]: RCFGBuilder took 297.05 ms. Allocated memory is still 301.5 MB. Free memory was 248.3 MB in the beginning and 228.6 MB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 5.3 GB. [2018-01-24 11:42:25,959 INFO L168 Benchmark]: TraceAbstraction took 20065.86 ms. Allocated memory was 301.5 MB in the beginning and 593.5 MB in the end (delta: 292.0 MB). Free memory was 228.6 MB in the beginning and 425.1 MB in the end (delta: -196.5 MB). Peak memory consumption was 214.2 MB. Max. memory is 5.3 GB. [2018-01-24 11:42:25,961 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 301.5 MB. Free memory is still 267.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 218.35 ms. Allocated memory is still 301.5 MB. Free memory was 260.5 MB in the beginning and 250.3 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.84 ms. Allocated memory is still 301.5 MB. Free memory was 250.3 MB in the beginning and 248.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 297.05 ms. Allocated memory is still 301.5 MB. Free memory was 248.3 MB in the beginning and 228.6 MB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 20065.86 ms. Allocated memory was 301.5 MB in the beginning and 593.5 MB in the end (delta: 292.0 MB). Free memory was 228.6 MB in the beginning and 425.1 MB in the end (delta: -196.5 MB). Peak memory consumption was 214.2 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_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_1,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.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_1,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.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - InvariantResult [Line: 545]: Loop Invariant [2018-01-24 11:42:25,972 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,972 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,972 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,973 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,973 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,973 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,973 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,974 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,974 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 11:42:25,974 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:42:25,974 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 11:42:25,975 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:42:25,975 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:42:25,975 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 11:42:25,975 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-24 11:42:25,976 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-24 11:42:25,976 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-24 11:42:25,976 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-24 11:42:25,976 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,976 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,977 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,977 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,977 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,977 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,978 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,978 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,978 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,978 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,979 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,979 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,979 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,979 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,979 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,979 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,979 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 11:42:25,980 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:42:25,980 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 11:42:25,980 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:42:25,980 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 11:42:25,980 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:42:25,981 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,981 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,981 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,981 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,981 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,981 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,981 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,982 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,982 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:42:25,982 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:25,983 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:42:25,983 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:25,983 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:25,983 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:42:25,983 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:25,984 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:25,984 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:42:25,984 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:25,984 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:42:25,984 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:25,984 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:25,984 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:42:25,985 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:25,985 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:25,985 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:25,985 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:25,985 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:42:25,985 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:25,985 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:25,986 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:42:25,986 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:25,986 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:25,986 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:25,986 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:42:25,987 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:42:25,987 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:25,987 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:42:25,987 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:25,987 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:25,987 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:42:25,987 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:25,987 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:25,987 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:25,988 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:42:25,991 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,992 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,992 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,992 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,992 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,992 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,993 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,993 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,993 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 11:42:25,993 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:42:25,993 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 11:42:25,993 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:42:25,994 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:42:25,994 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 11:42:25,994 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-24 11:42:25,994 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-24 11:42:25,994 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-24 11:42:25,994 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-24 11:42:25,995 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,995 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,995 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,995 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,995 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,996 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,996 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,996 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,996 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,997 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,997 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,997 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,998 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,998 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,998 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,998 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,998 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 11:42:25,999 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:42:25,999 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 11:42:25,999 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:42:25,999 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 11:42:25,999 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:42:25,999 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:25,999 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:26,000 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:26,000 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:26,000 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:26,000 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:26,000 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:26,000 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:42:26,001 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:42:26,001 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:26,001 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:42:26,001 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:26,001 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:26,002 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:42:26,002 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:26,002 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:26,002 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:42:26,002 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:26,002 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:42:26,002 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:26,003 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:26,003 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:42:26,003 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:26,003 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:26,003 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:26,003 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:26,003 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:42:26,003 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:26,004 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:26,004 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:42:26,004 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:26,004 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:26,004 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:26,004 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:42:26,004 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:42:26,004 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:26,005 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:42:26,005 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:26,005 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:26,005 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:42:26,005 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:26,005 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:26,005 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:42:26,005 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((((((((((((((((((\exists v_main_~nondetString2~4.offset_BEFORE_CALL_2 : int :: ((0 == unknown-#memory_int-unknown[s2][v_main_~nondetString2~4.offset_BEFORE_CALL_2 + unknown-#length-unknown[s2] + -1] && 0 <= v_main_~nondetString2~4.offset_BEFORE_CALL_2) && v_main_~nondetString2~4.offset_BEFORE_CALL_2 <= s2) && v_main_~nondetString2~4.offset_BEFORE_CALL_2 <= 0) && s2 == 0) && s1 == 0) && (\exists v_main_~nondetString1~4.offset_BEFORE_CALL_2 : int :: ((0 <= v_main_~nondetString1~4.offset_BEFORE_CALL_2 && v_main_~nondetString1~4.offset_BEFORE_CALL_2 <= s1) && 0 == unknown-#memory_int-unknown[s1][v_main_~nondetString1~4.offset_BEFORE_CALL_2 + unknown-#length-unknown[s1] + -1]) && v_main_~nondetString1~4.offset_BEFORE_CALL_2 <= 0)) && 1 == \valid[s1]) && 1 <= unknown-#length-unknown[s1]) && (\exists main_~length2~4 : int, v_main_~nondetString2~4.offset_BEFORE_CALL_1 : int :: ((unknown-#memory_int-unknown[s2][main_~length2~4 + v_main_~nondetString2~4.offset_BEFORE_CALL_1 + -1] == 0 && main_~length2~4 + v_main_~nondetString2~4.offset_BEFORE_CALL_1 <= unknown-#length-unknown[s2]) && s2 <= v_main_~nondetString2~4.offset_BEFORE_CALL_1) && 1 <= main_~length2~4)) && 1 == \valid[s2]) || !(1 == \valid[s2])) || unknown-#length-unknown[s2] < 1) || !(\exists main_~nondetString2~4.offset : int, main_~nondetString2~4.base : int :: 0 == unknown-#memory_int-unknown[main_~nondetString2~4.base][main_~nondetString2~4.offset + unknown-#length-unknown[main_~nondetString2~4.base] + -1] && !(main_~nondetString2~4.base == s1))) || !(\valid[s1] == 1)) || ((((((((\exists v_main_~nondetString1~4.offset_BEFORE_CALL_2 : int :: ((0 <= v_main_~nondetString1~4.offset_BEFORE_CALL_2 && v_main_~nondetString1~4.offset_BEFORE_CALL_2 + 1 <= s1) && 0 == unknown-#memory_int-unknown[s1][v_main_~nondetString1~4.offset_BEFORE_CALL_2 + unknown-#length-unknown[s1] + -1]) && v_main_~nondetString1~4.offset_BEFORE_CALL_2 <= 0) && s2 + 1 <= unknown-#length-unknown[s2]) && 1 == \valid[s1]) && (\exists v_main_~nondetString2~4.offset_BEFORE_CALL_2 : int :: ((0 == unknown-#memory_int-unknown[s2][v_main_~nondetString2~4.offset_BEFORE_CALL_2 + unknown-#length-unknown[s2] + -1] && 0 <= v_main_~nondetString2~4.offset_BEFORE_CALL_2) && v_main_~nondetString2~4.offset_BEFORE_CALL_2 + 1 <= s2) && v_main_~nondetString2~4.offset_BEFORE_CALL_2 <= 0)) && (s1 + 2 <= unknown-#length-unknown[s1] || 1 == s1)) && (s2 + 2 <= unknown-#length-unknown[s2] || 1 == s2)) && s1 + 1 <= unknown-#length-unknown[s1]) && 1 == \valid[s2])) || (((((((2 <= s2 && (\exists v_main_~nondetString1~4.offset_BEFORE_CALL_2 : int :: ((0 <= v_main_~nondetString1~4.offset_BEFORE_CALL_2 && v_main_~nondetString1~4.offset_BEFORE_CALL_2 + 1 <= s1) && 0 == unknown-#memory_int-unknown[s1][v_main_~nondetString1~4.offset_BEFORE_CALL_2 + unknown-#length-unknown[s1] + -1]) && v_main_~nondetString1~4.offset_BEFORE_CALL_2 <= 0)) && 2 <= s1) && s2 + 1 <= unknown-#length-unknown[s2]) && 1 == \valid[s1]) && (\exists v_main_~nondetString2~4.offset_BEFORE_CALL_2 : int :: ((0 == unknown-#memory_int-unknown[s2][v_main_~nondetString2~4.offset_BEFORE_CALL_2 + unknown-#length-unknown[s2] + -1] && 0 <= v_main_~nondetString2~4.offset_BEFORE_CALL_2) && v_main_~nondetString2~4.offset_BEFORE_CALL_2 + 1 <= s2) && v_main_~nondetString2~4.offset_BEFORE_CALL_2 <= 0)) && s1 + 1 <= unknown-#length-unknown[s1]) && 1 == \valid[s2])) || !(0 == s1)) || !(\exists main_~length1~4 : int, v_main_~nondetString1~4.offset_BEFORE_CALL_1 : int :: ((main_~length1~4 + v_main_~nondetString1~4.offset_BEFORE_CALL_1 <= unknown-#length-unknown[s1] && unknown-#memory_int-unknown[s1][main_~length1~4 + v_main_~nondetString1~4.offset_BEFORE_CALL_1 + -1] == 0) && 1 <= main_~length1~4) && s1 <= v_main_~nondetString1~4.offset_BEFORE_CALL_1)) || !(\exists v_main_~nondetString2~4.offset_BEFORE_CALL_2 : int :: ((0 == unknown-#memory_int-unknown[s2][v_main_~nondetString2~4.offset_BEFORE_CALL_2 + unknown-#length-unknown[s2] + -1] && v_main_~nondetString2~4.offset_BEFORE_CALL_2 <= s2) && 0 <= v_main_~nondetString2~4.offset_BEFORE_CALL_2) && v_main_~nondetString2~4.offset_BEFORE_CALL_2 <= 0)) || !(\exists v_main_~nondetString1~4.offset_BEFORE_CALL_2 : int :: ((0 <= v_main_~nondetString1~4.offset_BEFORE_CALL_2 && v_main_~nondetString1~4.offset_BEFORE_CALL_2 <= s1) && 0 == unknown-#memory_int-unknown[s1][v_main_~nondetString1~4.offset_BEFORE_CALL_2 + unknown-#length-unknown[s1] + -1]) && v_main_~nondetString1~4.offset_BEFORE_CALL_2 <= 0)) || !(0 == s2)) && (((((((unknown-#length-unknown[s1] < 1 || !(0 == s1)) || !(1 == \valid[s2])) || !(0 == unknown-#memory_int-unknown[s1][s1])) || unknown-#length-unknown[s2] < 1) || !(\valid[s1] == 1)) || !(0 == s2)) || ((((((s2 == 0 && s1 == 0) && 1 == \valid[s1]) && 1 <= unknown-#length-unknown[s1]) && 1 <= unknown-#length-unknown[s2]) && 0 == unknown-#memory_int-unknown[s1][s1]) && 1 == \valid[s2])) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 61 locations, 15 error locations. SAFE Result, 19.9s OverallTime, 16 OverallIterations, 3 TraceHistogramMax, 5.2s AutomataDifference, 0.0s DeadEndRemovalTime, 8.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 670 SDtfs, 1030 SDslu, 2548 SDs, 0 SdLazy, 2256 SolverSat, 128 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 344 GetRequests, 129 SyntacticMatches, 3 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 897 ImplicationChecksByTransitivity, 6.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 32 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 14 NumberOfFragments, 702 HoareAnnotationTreeSize, 9 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 1161 FormulaSimplificationTreeSizeReductionInter, 8.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 574 NumberOfCodeBlocks, 574 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 554 ConstructedInterpolants, 73 QuantifiedInterpolants, 252398 SizeOfPredicates, 41 NumberOfNonLiveVariables, 654 ConjunctsInSsa, 117 ConjunctsInUnsatCore, 20 InterpolantComputations, 12 PerfectInterpolantSequences, 29/109 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrncmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_11-42-26-010.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrncmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_11-42-26-010.csv Received shutdown request...