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/openbsd_cstrncmp-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 11:47:01,296 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 11:47:01,297 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 11:47:01,312 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 11:47:01,312 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 11:47:01,313 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 11:47:01,314 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 11:47:01,316 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 11:47:01,318 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 11:47:01,319 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 11:47:01,319 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 11:47:01,319 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 11:47:01,320 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 11:47:01,321 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 11:47:01,322 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 11:47:01,325 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 11:47:01,327 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 11:47:01,329 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 11:47:01,330 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 11:47:01,331 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 11:47:01,334 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 11:47:01,334 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 11:47:01,334 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 11:47:01,335 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 11:47:01,336 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 11:47:01,337 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 11:47:01,338 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 11:47:01,338 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 11:47:01,338 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 11:47:01,339 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 11:47:01,339 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 11:47:01,340 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:47:01,350 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 11:47:01,350 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 11:47:01,351 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 11:47:01,351 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 11:47:01,351 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 11:47:01,351 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 11:47:01,352 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 11:47:01,352 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 11:47:01,352 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 11:47:01,353 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 11:47:01,353 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 11:47:01,353 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 11:47:01,353 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 11:47:01,353 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 11:47:01,354 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 11:47:01,354 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 11:47:01,354 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 11:47:01,354 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 11:47:01,354 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 11:47:01,355 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 11:47:01,355 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 11:47:01,355 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 11:47:01,355 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 11:47:01,355 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 11:47:01,356 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 11:47:01,356 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 11:47:01,356 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 11:47:01,356 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 11:47:01,356 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 11:47:01,357 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 11:47:01,357 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 11:47:01,357 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 11:47:01,358 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 11:47:01,358 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 11:47:01,393 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 11:47:01,405 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 11:47:01,409 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 11:47:01,411 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 11:47:01,411 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 11:47:01,412 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-01-24 11:47:01,581 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 11:47:01,586 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 11:47:01,587 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 11:47:01,587 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 11:47:01,592 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 11:47:01,593 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:47:01" (1/1) ... [2018-01-24 11:47:01,596 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27f336ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:47:01, skipping insertion in model container [2018-01-24 11:47:01,596 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:47:01" (1/1) ... [2018-01-24 11:47:01,610 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 11:47:01,647 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 11:47:01,766 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 11:47:01,781 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 11:47:01,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:47:01 WrapperNode [2018-01-24 11:47:01,787 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 11:47:01,788 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 11:47:01,788 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 11:47:01,788 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 11:47:01,799 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:47:01" (1/1) ... [2018-01-24 11:47:01,799 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:47:01" (1/1) ... [2018-01-24 11:47:01,812 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:47:01" (1/1) ... [2018-01-24 11:47:01,812 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:47:01" (1/1) ... [2018-01-24 11:47:01,817 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:47:01" (1/1) ... [2018-01-24 11:47:01,819 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:47:01" (1/1) ... [2018-01-24 11:47:01,821 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:47:01" (1/1) ... [2018-01-24 11:47:01,822 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 11:47:01,823 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 11:47:01,823 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 11:47:01,823 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 11:47:01,824 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:47:01" (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:47:01,875 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 11:47:01,875 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 11:47:01,875 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncmp [2018-01-24 11:47:01,875 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 11:47:01,875 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 11:47:01,876 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 11:47:01,876 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 11:47:01,876 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 11:47:01,876 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 11:47:01,876 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 11:47:01,876 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncmp [2018-01-24 11:47:01,877 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 11:47:01,877 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 11:47:01,877 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 11:47:02,124 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 11:47:02,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:47:02 BoogieIcfgContainer [2018-01-24 11:47:02,125 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 11:47:02,126 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 11:47:02,126 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 11:47:02,128 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 11:47:02,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 11:47:01" (1/3) ... [2018-01-24 11:47:02,129 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70b3abca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:47:02, skipping insertion in model container [2018-01-24 11:47:02,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:47:01" (2/3) ... [2018-01-24 11:47:02,130 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70b3abca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:47:02, skipping insertion in model container [2018-01-24 11:47:02,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:47:02" (3/3) ... [2018-01-24 11:47:02,132 INFO L105 eAbstractionObserver]: Analyzing ICFG openbsd_cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-01-24 11:47:02,141 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 11:47:02,148 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-24 11:47:02,187 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 11:47:02,188 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 11:47:02,188 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 11:47:02,188 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 11:47:02,188 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 11:47:02,188 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 11:47:02,188 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 11:47:02,188 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 11:47:02,189 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 11:47:02,205 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2018-01-24 11:47:02,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 11:47:02,211 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:47:02,213 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:47:02,213 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-24 11:47:02,217 INFO L82 PathProgramCache]: Analyzing trace with hash -417514722, now seen corresponding path program 1 times [2018-01-24 11:47:02,219 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:47:02,219 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:47:02,263 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:02,263 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:47:02,263 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:02,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:47:02,320 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:47:02,435 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:47:02,437 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:47:02,437 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 11:47:02,439 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 11:47:02,450 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 11:47:02,450 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 11:47:02,452 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 4 states. [2018-01-24 11:47:02,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:47:02,654 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2018-01-24 11:47:02,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 11:47:02,656 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-24 11:47:02,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:47:02,663 INFO L225 Difference]: With dead ends: 71 [2018-01-24 11:47:02,663 INFO L226 Difference]: Without dead ends: 54 [2018-01-24 11:47:02,667 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:47:02,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-24 11:47:02,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-24 11:47:02,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-24 11:47:02,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-01-24 11:47:02,696 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 13 [2018-01-24 11:47:02,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:47:02,696 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-01-24 11:47:02,696 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 11:47:02,696 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-01-24 11:47:02,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 11:47:02,697 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:47:02,697 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:47:02,697 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-24 11:47:02,697 INFO L82 PathProgramCache]: Analyzing trace with hash -417514721, now seen corresponding path program 1 times [2018-01-24 11:47:02,697 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:47:02,698 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:47:02,698 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:02,698 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:47:02,699 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:02,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:47:02,713 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:47:02,866 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:47:02,867 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:47:02,867 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 11:47:02,869 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 11:47:02,869 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 11:47:02,869 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-24 11:47:02,870 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 6 states. [2018-01-24 11:47:02,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:47:02,938 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-01-24 11:47:02,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 11:47:02,938 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-01-24 11:47:02,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:47:02,939 INFO L225 Difference]: With dead ends: 54 [2018-01-24 11:47:02,939 INFO L226 Difference]: Without dead ends: 53 [2018-01-24 11:47:02,940 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-24 11:47:02,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-24 11:47:02,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-01-24 11:47:02,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-24 11:47:02,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2018-01-24 11:47:02,947 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 13 [2018-01-24 11:47:02,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:47:02,947 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2018-01-24 11:47:02,948 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 11:47:02,948 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2018-01-24 11:47:02,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 11:47:02,948 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:47:02,949 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:47:02,949 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-24 11:47:02,949 INFO L82 PathProgramCache]: Analyzing trace with hash -58054499, now seen corresponding path program 1 times [2018-01-24 11:47:02,949 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:47:02,949 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:47:02,950 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:02,951 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:47:02,951 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:02,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:47:02,966 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:47:02,992 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:47:02,993 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:47:02,993 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 11:47:02,993 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 11:47:02,994 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 11:47:02,994 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 11:47:02,994 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 4 states. [2018-01-24 11:47:03,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:47:03,108 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2018-01-24 11:47:03,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 11:47:03,109 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 11:47:03,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:47:03,110 INFO L225 Difference]: With dead ends: 53 [2018-01-24 11:47:03,110 INFO L226 Difference]: Without dead ends: 52 [2018-01-24 11:47:03,110 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:47:03,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-24 11:47:03,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-24 11:47:03,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-24 11:47:03,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-01-24 11:47:03,116 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 14 [2018-01-24 11:47:03,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:47:03,116 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-01-24 11:47:03,116 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 11:47:03,116 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-01-24 11:47:03,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 11:47:03,116 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:47:03,117 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:47:03,117 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-24 11:47:03,117 INFO L82 PathProgramCache]: Analyzing trace with hash -58054498, now seen corresponding path program 1 times [2018-01-24 11:47:03,117 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:47:03,117 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:47:03,118 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:03,118 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:47:03,118 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:03,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:47:03,127 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:47:03,189 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:47:03,189 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:47:03,189 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 11:47:03,190 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 11:47:03,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 11:47:03,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:47:03,190 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 5 states. [2018-01-24 11:47:03,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:47:03,233 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2018-01-24 11:47:03,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 11:47:03,233 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 11:47:03,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:47:03,234 INFO L225 Difference]: With dead ends: 52 [2018-01-24 11:47:03,234 INFO L226 Difference]: Without dead ends: 51 [2018-01-24 11:47:03,234 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:47:03,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-24 11:47:03,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-24 11:47:03,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-24 11:47:03,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-01-24 11:47:03,239 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 14 [2018-01-24 11:47:03,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:47:03,239 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-01-24 11:47:03,239 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 11:47:03,239 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-01-24 11:47:03,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 11:47:03,240 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:47:03,240 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] [2018-01-24 11:47:03,240 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-24 11:47:03,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1465356832, now seen corresponding path program 1 times [2018-01-24 11:47:03,240 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:47:03,240 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:47:03,241 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:03,241 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:47:03,241 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:03,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:47:03,259 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:47:03,370 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:47:03,370 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:47:03,370 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 11:47:03,370 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 11:47:03,370 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 11:47:03,371 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 11:47:03,371 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 8 states. [2018-01-24 11:47:03,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:47:03,515 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2018-01-24 11:47:03,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 11:47:03,516 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-01-24 11:47:03,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:47:03,519 INFO L225 Difference]: With dead ends: 70 [2018-01-24 11:47:03,519 INFO L226 Difference]: Without dead ends: 68 [2018-01-24 11:47:03,519 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-01-24 11:47:03,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-24 11:47:03,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 57. [2018-01-24 11:47:03,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-24 11:47:03,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2018-01-24 11:47:03,527 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 20 [2018-01-24 11:47:03,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:47:03,527 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2018-01-24 11:47:03,527 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 11:47:03,528 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2018-01-24 11:47:03,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 11:47:03,528 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:47:03,528 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] [2018-01-24 11:47:03,528 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-24 11:47:03,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1465356831, now seen corresponding path program 1 times [2018-01-24 11:47:03,529 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:47:03,529 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:47:03,530 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:03,530 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:47:03,530 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:03,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:47:03,543 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:47:03,574 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:47:03,574 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:47:03,574 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 11:47:03,575 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 11:47:03,575 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 11:47:03,575 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:47:03,575 INFO L87 Difference]: Start difference. First operand 57 states and 67 transitions. Second operand 5 states. [2018-01-24 11:47:03,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:47:03,624 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2018-01-24 11:47:03,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 11:47:03,624 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-24 11:47:03,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:47:03,625 INFO L225 Difference]: With dead ends: 57 [2018-01-24 11:47:03,625 INFO L226 Difference]: Without dead ends: 55 [2018-01-24 11:47:03,626 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:47:03,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-24 11:47:03,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-01-24 11:47:03,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-24 11:47:03,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2018-01-24 11:47:03,632 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 20 [2018-01-24 11:47:03,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:47:03,633 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2018-01-24 11:47:03,633 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 11:47:03,633 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2018-01-24 11:47:03,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 11:47:03,634 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:47:03,634 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:47:03,634 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-24 11:47:03,634 INFO L82 PathProgramCache]: Analyzing trace with hash -541357888, now seen corresponding path program 1 times [2018-01-24 11:47:03,634 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:47:03,635 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:47:03,635 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:03,636 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:47:03,636 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:03,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:47:03,650 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:47:03,694 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:47:03,694 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:47:03,695 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 11:47:03,695 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 11:47:03,695 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 11:47:03,696 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 11:47:03,696 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 6 states. [2018-01-24 11:47:03,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:47:03,773 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2018-01-24 11:47:03,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 11:47:03,774 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-01-24 11:47:03,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:47:03,774 INFO L225 Difference]: With dead ends: 55 [2018-01-24 11:47:03,775 INFO L226 Difference]: Without dead ends: 54 [2018-01-24 11:47:03,775 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-24 11:47:03,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-24 11:47:03,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-24 11:47:03,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-24 11:47:03,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2018-01-24 11:47:03,781 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 22 [2018-01-24 11:47:03,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:47:03,782 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2018-01-24 11:47:03,782 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 11:47:03,782 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2018-01-24 11:47:03,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 11:47:03,783 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:47:03,783 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:47:03,783 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-24 11:47:03,783 INFO L82 PathProgramCache]: Analyzing trace with hash -541357887, now seen corresponding path program 1 times [2018-01-24 11:47:03,784 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:47:03,784 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:47:03,785 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:03,785 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:47:03,785 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:03,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:47:03,798 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:47:03,920 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:47:03,920 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:47:03,921 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 11:47:03,921 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 11:47:03,921 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 11:47:03,922 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-24 11:47:03,922 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand 9 states. [2018-01-24 11:47:04,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:47:04,024 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2018-01-24 11:47:04,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 11:47:04,025 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-01-24 11:47:04,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:47:04,026 INFO L225 Difference]: With dead ends: 57 [2018-01-24 11:47:04,026 INFO L226 Difference]: Without dead ends: 56 [2018-01-24 11:47:04,026 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-01-24 11:47:04,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-01-24 11:47:04,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2018-01-24 11:47:04,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-24 11:47:04,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2018-01-24 11:47:04,033 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 22 [2018-01-24 11:47:04,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:47:04,035 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2018-01-24 11:47:04,035 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 11:47:04,035 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2018-01-24 11:47:04,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 11:47:04,036 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:47:04,036 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] [2018-01-24 11:47:04,036 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-24 11:47:04,036 INFO L82 PathProgramCache]: Analyzing trace with hash -553886463, now seen corresponding path program 1 times [2018-01-24 11:47:04,036 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:47:04,037 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:47:04,037 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:04,038 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:47:04,038 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:04,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:47:04,051 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:47:04,111 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:47:04,111 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:47:04,111 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 11:47:04,112 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 11:47:04,112 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 11:47:04,112 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 11:47:04,112 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 6 states. [2018-01-24 11:47:04,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:47:04,205 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2018-01-24 11:47:04,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 11:47:04,206 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-24 11:47:04,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:47:04,206 INFO L225 Difference]: With dead ends: 54 [2018-01-24 11:47:04,207 INFO L226 Difference]: Without dead ends: 53 [2018-01-24 11:47:04,207 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-24 11:47:04,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-24 11:47:04,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-01-24 11:47:04,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-24 11:47:04,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-01-24 11:47:04,212 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 24 [2018-01-24 11:47:04,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:47:04,212 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-01-24 11:47:04,212 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 11:47:04,213 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-01-24 11:47:04,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 11:47:04,213 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:47:04,213 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] [2018-01-24 11:47:04,214 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-24 11:47:04,214 INFO L82 PathProgramCache]: Analyzing trace with hash -553886462, now seen corresponding path program 1 times [2018-01-24 11:47:04,214 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:47:04,214 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:47:04,215 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:04,215 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:47:04,215 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:04,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:47:04,229 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:47:04,352 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:47:04,352 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:47:04,352 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 11:47:04,352 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 11:47:04,353 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 11:47:04,353 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-24 11:47:04,353 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 8 states. [2018-01-24 11:47:04,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:47:04,478 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2018-01-24 11:47:04,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 11:47:04,479 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-01-24 11:47:04,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:47:04,479 INFO L225 Difference]: With dead ends: 65 [2018-01-24 11:47:04,479 INFO L226 Difference]: Without dead ends: 64 [2018-01-24 11:47:04,480 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-01-24 11:47:04,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-24 11:47:04,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 54. [2018-01-24 11:47:04,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-24 11:47:04,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2018-01-24 11:47:04,486 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 24 [2018-01-24 11:47:04,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:47:04,487 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2018-01-24 11:47:04,487 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 11:47:04,487 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2018-01-24 11:47:04,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 11:47:04,488 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:47:04,488 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:47:04,488 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-24 11:47:04,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1181606150, now seen corresponding path program 1 times [2018-01-24 11:47:04,489 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:47:04,489 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:47:04,490 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:04,490 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:47:04,490 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:04,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:47:04,503 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:47:04,757 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:47:04,758 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:47:04,758 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 11:47:04,759 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 11:47:04,759 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 11:47:04,759 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 11:47:04,759 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 6 states. [2018-01-24 11:47:04,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:47:04,893 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2018-01-24 11:47:04,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 11:47:04,893 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-01-24 11:47:04,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:47:04,894 INFO L225 Difference]: With dead ends: 54 [2018-01-24 11:47:04,894 INFO L226 Difference]: Without dead ends: 43 [2018-01-24 11:47:04,894 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-24 11:47:04,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-01-24 11:47:04,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-01-24 11:47:04,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-24 11:47:04,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-01-24 11:47:04,898 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 26 [2018-01-24 11:47:04,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:47:04,898 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-01-24 11:47:04,898 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 11:47:04,898 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-01-24 11:47:04,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 11:47:04,899 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:47:04,899 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:47:04,899 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-24 11:47:04,899 INFO L82 PathProgramCache]: Analyzing trace with hash 290777922, now seen corresponding path program 1 times [2018-01-24 11:47:04,899 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:47:04,900 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:47:04,900 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:04,900 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:47:04,900 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:04,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:47:04,914 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:47:04,957 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:47:04,957 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:47:04,957 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 11:47:04,957 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 11:47:04,957 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 11:47:04,957 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 11:47:04,958 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 6 states. [2018-01-24 11:47:05,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:47:05,003 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2018-01-24 11:47:05,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 11:47:05,003 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-01-24 11:47:05,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:47:05,004 INFO L225 Difference]: With dead ends: 43 [2018-01-24 11:47:05,004 INFO L226 Difference]: Without dead ends: 42 [2018-01-24 11:47:05,004 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-24 11:47:05,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-01-24 11:47:05,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-01-24 11:47:05,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-24 11:47:05,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2018-01-24 11:47:05,008 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 26 [2018-01-24 11:47:05,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:47:05,008 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2018-01-24 11:47:05,008 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 11:47:05,008 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2018-01-24 11:47:05,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 11:47:05,009 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:47:05,009 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:47:05,009 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-24 11:47:05,009 INFO L82 PathProgramCache]: Analyzing trace with hash 290777923, now seen corresponding path program 1 times [2018-01-24 11:47:05,009 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:47:05,009 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:47:05,010 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:05,010 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:47:05,010 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:05,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:47:05,023 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:47:05,198 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:47:05,198 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:47:05,198 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 11:47:05,198 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 11:47:05,199 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 11:47:05,199 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-01-24 11:47:05,199 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 11 states. [2018-01-24 11:47:05,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:47:05,384 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2018-01-24 11:47:05,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 11:47:05,384 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2018-01-24 11:47:05,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:47:05,385 INFO L225 Difference]: With dead ends: 52 [2018-01-24 11:47:05,385 INFO L226 Difference]: Without dead ends: 48 [2018-01-24 11:47:05,385 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2018-01-24 11:47:05,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-24 11:47:05,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 41. [2018-01-24 11:47:05,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-24 11:47:05,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2018-01-24 11:47:05,389 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 26 [2018-01-24 11:47:05,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:47:05,389 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2018-01-24 11:47:05,389 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 11:47:05,390 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2018-01-24 11:47:05,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 11:47:05,390 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:47:05,390 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:47:05,390 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-24 11:47:05,390 INFO L82 PathProgramCache]: Analyzing trace with hash -716230416, now seen corresponding path program 1 times [2018-01-24 11:47:05,390 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:47:05,391 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:47:05,391 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:05,391 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:47:05,391 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:05,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:47:05,416 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:47:05,593 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:47:05,594 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:47:05,594 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-24 11:47:05,594 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 11:47:05,594 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 11:47:05,594 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-01-24 11:47:05,595 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 12 states. [2018-01-24 11:47:05,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:47:05,887 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2018-01-24 11:47:05,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 11:47:05,887 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2018-01-24 11:47:05,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:47:05,888 INFO L225 Difference]: With dead ends: 76 [2018-01-24 11:47:05,888 INFO L226 Difference]: Without dead ends: 41 [2018-01-24 11:47:05,889 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2018-01-24 11:47:05,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-24 11:47:05,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-01-24 11:47:05,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-24 11:47:05,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-01-24 11:47:05,893 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 29 [2018-01-24 11:47:05,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:47:05,894 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-01-24 11:47:05,894 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 11:47:05,894 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-01-24 11:47:05,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 11:47:05,895 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:47:05,895 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:47:05,895 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-24 11:47:05,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1773298546, now seen corresponding path program 1 times [2018-01-24 11:47:05,895 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:47:05,895 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:47:05,896 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:05,896 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:47:05,896 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:05,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:47:05,914 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:47:06,188 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:47:06,188 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:47:06,189 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:47:06,199 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:47:06,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:47:06,239 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:47:06,282 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:47:06,285 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:47:06,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:47:06,296 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 11:47:06,360 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:47:06,361 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:47:06,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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:47:06,363 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:47:06,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:47:06,366 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-24 11:47:06,400 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:47:06,407 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:47:06,407 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:47:06,408 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:47:06,414 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:47:06,414 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-01-24 11:47:06,473 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:47:06,476 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:47:06,476 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:47:06,482 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:47:06,493 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:47:06,494 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-01-24 11:47:06,729 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 30 treesize of output 28 [2018-01-24 11:47:06,746 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:47:06,770 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 11:47:06,781 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:47:06,781 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 11:47:06,784 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:47:06,797 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:47:06,798 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2018-01-24 11:47:06,846 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:47:06,867 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:47:06,868 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2018-01-24 11:47:06,868 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-24 11:47:06,868 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-24 11:47:06,868 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=451, Unknown=0, NotChecked=0, Total=506 [2018-01-24 11:47:06,868 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 23 states. [2018-01-24 11:47:09,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:47:09,518 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2018-01-24 11:47:09,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 11:47:09,518 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 29 [2018-01-24 11:47:09,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:47:09,519 INFO L225 Difference]: With dead ends: 56 [2018-01-24 11:47:09,519 INFO L226 Difference]: Without dead ends: 54 [2018-01-24 11:47:09,520 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=155, Invalid=900, Unknown=1, NotChecked=0, Total=1056 [2018-01-24 11:47:09,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-24 11:47:09,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2018-01-24 11:47:09,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 11:47:09,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-01-24 11:47:09,524 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 29 [2018-01-24 11:47:09,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:47:09,524 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-01-24 11:47:09,524 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-24 11:47:09,524 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-01-24 11:47:09,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 11:47:09,525 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:47:09,525 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:47:09,525 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-24 11:47:09,526 INFO L82 PathProgramCache]: Analyzing trace with hash -962114157, now seen corresponding path program 1 times [2018-01-24 11:47:09,526 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:47:09,526 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:47:09,526 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:09,527 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:47:09,527 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:09,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:47:09,543 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:47:09,737 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:47:09,737 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:47:09,737 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:47:09,744 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:47:09,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:47:09,770 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:47:09,776 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:47:09,778 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:47:09,778 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:47:09,779 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:47:09,784 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:47:09,784 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-24 11:47:10,072 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:47:10,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-01-24 11:47:10,076 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:47:10,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2018-01-24 11:47:10,104 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-24 11:47:10,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 25 [2018-01-24 11:47:10,140 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-24 11:47:10,152 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-24 11:47:10,170 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:47:10,171 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:49, output treesize:29 [2018-01-24 11:47:10,207 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:47:10,227 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:47:10,228 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 22 [2018-01-24 11:47:10,228 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-24 11:47:10,228 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-24 11:47:10,228 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2018-01-24 11:47:10,229 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 23 states. [2018-01-24 11:47:12,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:47:12,075 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2018-01-24 11:47:12,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 11:47:12,076 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 31 [2018-01-24 11:47:12,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:47:12,076 INFO L225 Difference]: With dead ends: 51 [2018-01-24 11:47:12,076 INFO L226 Difference]: Without dead ends: 50 [2018-01-24 11:47:12,077 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=138, Invalid=982, Unknown=2, NotChecked=0, Total=1122 [2018-01-24 11:47:12,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-24 11:47:12,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-01-24 11:47:12,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 11:47:12,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2018-01-24 11:47:12,083 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 31 [2018-01-24 11:47:12,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:47:12,084 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2018-01-24 11:47:12,084 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-24 11:47:12,084 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2018-01-24 11:47:12,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 11:47:12,085 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:47:12,085 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:47:12,085 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-24 11:47:12,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1173736108, now seen corresponding path program 1 times [2018-01-24 11:47:12,085 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:47:12,086 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:47:12,086 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:12,087 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:47:12,087 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:12,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:47:12,098 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:47:12,214 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:47:12,214 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:47:12,214 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:47:12,222 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:47:12,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:47:12,255 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:47:12,306 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:47:12,326 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:47:12,327 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 10 [2018-01-24 11:47:12,327 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 11:47:12,327 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 11:47:12,327 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-01-24 11:47:12,327 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand 11 states. [2018-01-24 11:47:12,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:47:12,434 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2018-01-24 11:47:12,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 11:47:12,434 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2018-01-24 11:47:12,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:47:12,435 INFO L225 Difference]: With dead ends: 50 [2018-01-24 11:47:12,435 INFO L226 Difference]: Without dead ends: 48 [2018-01-24 11:47:12,435 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2018-01-24 11:47:12,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-24 11:47:12,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-01-24 11:47:12,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-24 11:47:12,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-01-24 11:47:12,442 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 33 [2018-01-24 11:47:12,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:47:12,442 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-01-24 11:47:12,442 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 11:47:12,442 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-01-24 11:47:12,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-24 11:47:12,443 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:47:12,443 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, 1] [2018-01-24 11:47:12,443 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-24 11:47:12,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1615722261, now seen corresponding path program 1 times [2018-01-24 11:47:12,444 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:47:12,444 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:47:12,444 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:12,445 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:47:12,445 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:12,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:47:12,456 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:47:12,585 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:47:12,585 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:47:12,585 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:47:12,591 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:47:12,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:47:12,613 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:47:12,647 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:47:12,667 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 11:47:12,668 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 13 [2018-01-24 11:47:12,668 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-24 11:47:12,668 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-24 11:47:12,669 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-01-24 11:47:12,669 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 14 states. [2018-01-24 11:47:12,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:47:12,862 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2018-01-24 11:47:12,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 11:47:12,862 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2018-01-24 11:47:12,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:47:12,863 INFO L225 Difference]: With dead ends: 46 [2018-01-24 11:47:12,863 INFO L226 Difference]: Without dead ends: 42 [2018-01-24 11:47:12,863 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2018-01-24 11:47:12,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-01-24 11:47:12,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-01-24 11:47:12,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-24 11:47:12,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-01-24 11:47:12,868 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 35 [2018-01-24 11:47:12,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:47:12,868 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-01-24 11:47:12,869 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-24 11:47:12,869 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-01-24 11:47:12,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-24 11:47:12,869 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:47:12,870 INFO L322 BasicCegarLoop]: trace histogram [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:47:12,870 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-24 11:47:12,870 INFO L82 PathProgramCache]: Analyzing trace with hash -48907298, now seen corresponding path program 2 times [2018-01-24 11:47:12,870 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:47:12,870 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:47:12,871 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:12,871 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:47:12,871 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:12,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:47:12,893 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:47:13,410 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:47:13,410 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:47:13,410 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:47:13,415 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 11:47:13,426 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:47:13,434 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:47:13,437 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 11:47:13,440 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:47:13,443 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:47:13,443 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:47:13,448 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:47:13,448 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:47:13,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:47:13,451 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 11:47:13,486 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:47:13,487 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:47:13,487 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:47:13,494 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:47:13,495 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:47:13,495 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:47:13,496 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:47:13,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:47:13,500 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-24 11:47:13,537 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:47:13,539 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:47:13,540 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:47:13,541 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:47:13,547 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:47:13,548 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-01-24 11:47:13,575 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:47:13,577 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:47:13,577 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:47:13,581 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:47:13,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-24 11:47:13,588 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2018-01-24 11:47:13,995 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 34 treesize of output 32 [2018-01-24 11:47:13,997 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:47:13,997 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:47:14,006 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 15 [2018-01-24 11:47:14,006 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-24 11:47:14,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:47:14,018 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:47:14,018 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:52, output treesize:37 [2018-01-24 11:47:14,101 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:47:14,121 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:47:14,122 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 28 [2018-01-24 11:47:14,122 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-24 11:47:14,122 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-24 11:47:14,123 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=739, Unknown=0, NotChecked=0, Total=812 [2018-01-24 11:47:14,123 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 29 states. [2018-01-24 11:47:15,150 WARN L146 SmtUtils]: Spent 266ms on a formula simplification. DAG size of input: 56 DAG size of output 46 [2018-01-24 11:47:15,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:47:15,554 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2018-01-24 11:47:15,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-24 11:47:15,554 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 38 [2018-01-24 11:47:15,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:47:15,555 INFO L225 Difference]: With dead ends: 43 [2018-01-24 11:47:15,555 INFO L226 Difference]: Without dead ends: 42 [2018-01-24 11:47:15,555 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=210, Invalid=1512, Unknown=0, NotChecked=0, Total=1722 [2018-01-24 11:47:15,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-01-24 11:47:15,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-01-24 11:47:15,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-24 11:47:15,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-01-24 11:47:15,560 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2018-01-24 11:47:15,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:47:15,560 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-01-24 11:47:15,560 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-24 11:47:15,560 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-01-24 11:47:15,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-24 11:47:15,561 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:47:15,561 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:47:15,561 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-24 11:47:15,561 INFO L82 PathProgramCache]: Analyzing trace with hash 244726527, now seen corresponding path program 2 times [2018-01-24 11:47:15,561 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:47:15,561 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:47:15,562 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:15,562 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 11:47:15,562 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:15,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:47:15,580 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:47:16,066 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:47:16,066 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:47:16,066 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:47:16,075 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 11:47:16,091 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:47:16,100 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:47:16,103 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 11:47:16,107 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:47:16,110 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:47:16,110 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:47:16,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:47:16,114 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 11:47:16,151 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:47:16,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-24 11:47:16,153 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:47:16,154 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:47:16,159 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:47:16,159 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2018-01-24 11:47:16,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 33 [2018-01-24 11:47:16,453 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 29 treesize of output 22 [2018-01-24 11:47:16,454 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:47:16,468 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 22 treesize of output 20 [2018-01-24 11:47:16,468 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-24 11:47:16,494 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 25 treesize of output 29 [2018-01-24 11:47:16,495 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-24 11:47:16,505 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-24 11:47:16,519 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:47:16,519 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:37 [2018-01-24 11:47:16,563 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:47:16,583 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:47:16,583 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2018-01-24 11:47:16,584 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-24 11:47:16,584 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-24 11:47:16,584 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=679, Unknown=0, NotChecked=0, Total=756 [2018-01-24 11:47:16,584 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 28 states. [2018-01-24 11:47:17,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:47:17,480 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2018-01-24 11:47:17,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 11:47:17,593 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 40 [2018-01-24 11:47:17,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:47:17,594 INFO L225 Difference]: With dead ends: 42 [2018-01-24 11:47:17,594 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 11:47:17,595 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=232, Invalid=1574, Unknown=0, NotChecked=0, Total=1806 [2018-01-24 11:47:17,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 11:47:17,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 11:47:17,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 11:47:17,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 11:47:17,597 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2018-01-24 11:47:17,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:47:17,597 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 11:47:17,597 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-24 11:47:17,597 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 11:47:17,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 11:47:17,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 11:47:17,983 WARN L146 SmtUtils]: Spent 268ms on a formula simplification. DAG size of input: 107 DAG size of output 84 [2018-01-24 11:47:20,574 WARN L146 SmtUtils]: Spent 2587ms on a formula simplification. DAG size of input: 181 DAG size of output 135 [2018-01-24 11:47:21,610 WARN L146 SmtUtils]: Spent 1034ms on a formula simplification. DAG size of input: 114 DAG size of output 1 [2018-01-24 11:47:21,614 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 567) no Hoare annotation was computed. [2018-01-24 11:47:21,614 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 567) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 11:47:21,614 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 567) no Hoare annotation was computed. [2018-01-24 11:47:21,615 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 567) the Hoare annotation is: true [2018-01-24 11:47:21,615 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 567) no Hoare annotation was computed. [2018-01-24 11:47:21,615 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 567) the Hoare annotation is: true [2018-01-24 11:47:21,615 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 567) no Hoare annotation was computed. [2018-01-24 11:47:21,615 INFO L401 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-24 11:47:21,615 INFO L401 ceAbstractionStarter]: For program point L564(line 564) no Hoare annotation was computed. [2018-01-24 11:47:21,615 INFO L401 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-01-24 11:47:21,615 INFO L401 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-01-24 11:47:21,615 INFO L401 ceAbstractionStarter]: For program point L563'(line 563) no Hoare annotation was computed. [2018-01-24 11:47:21,616 INFO L397 ceAbstractionStarter]: At program point L566(line 566) the Hoare annotation is: (let ((.cse4 (select |#length| main_~nondetString1~4.base))) (let ((.cse0 (= 0 |main_#t~malloc11.offset|)) (.cse1 (= 1 (select |#valid| |main_#t~malloc11.base|))) (.cse2 (= 1 (select |#valid| main_~nondetString1~4.base))) (.cse3 (= 1 (select |#valid| |main_#t~malloc12.base|))) (.cse5 (<= 1 main_~length2~4)) (.cse6 (= main_~nondetString2~4.offset 0)) (.cse7 (= main_~length1~4 (select |#length| |main_#t~malloc11.base|))) (.cse8 (= main_~length2~4 (select |#length| main_~nondetString2~4.base))) (.cse9 (<= (+ main_~nondetString1~4.offset 1) .cse4)) (.cse10 (= 0 |main_#t~malloc12.offset|)) (.cse11 (= 1 (select |#valid| main_~nondetString2~4.base))) (.cse12 (= main_~length2~4 (select |#length| |main_#t~malloc12.base|))) (.cse13 (not (= |main_#t~malloc11.base| |main_#t~malloc12.base|))) (.cse14 (= (store (store |#valid| |main_#t~malloc12.base| 0) |main_#t~malloc11.base| (select (store |#valid| |main_#t~malloc11.base| 0) |main_#t~malloc11.base|)) |old(#valid)|))) (or (and .cse0 (= 0 (select (select (store |#memory_int| main_~nondetString2~4.base (store (select |#memory_int| main_~nondetString2~4.base) (+ main_~length2~4 main_~nondetString2~4.offset (- 1)) 0)) main_~nondetString1~4.base) main_~nondetString1~4.offset)) .cse1 .cse2 .cse3 (= main_~length1~4 .cse4) (not (= main_~nondetString1~4.base main_~nondetString2~4.base)) .cse5 .cse6 (<= main_~length1~4 1) .cse7 .cse8 .cse9 .cse10 (not (= main_~nondetString1~4.base |main_#t~malloc12.base|)) .cse11 .cse12 .cse13 (= (+ main_~length1~4 main_~nondetString1~4.offset) 1) .cse14) (and (exists ((main_~nondetString2~4.offset Int)) (and (= (select (select |#memory_int| main_~nondetString2~4.base) (+ (select |#length| main_~nondetString2~4.base) main_~nondetString2~4.offset (- 1))) 0) (<= main_~nondetString2~4.offset 0) (<= 0 main_~nondetString2~4.offset))) .cse0 (not (= |main_#t~malloc12.base| main_~nondetString1~4.base)) (= main_~nondetString1~4.offset 0) .cse1 (exists ((main_~nondetString1~4.offset Int)) (and (<= main_~nondetString1~4.offset 0) (= (select (select |#memory_int| main_~nondetString1~4.base) (+ main_~nondetString1~4.offset (select |#length| main_~nondetString1~4.base) (- 1))) 0) (<= 0 main_~nondetString1~4.offset))) .cse2 .cse3 (not (= main_~nondetString2~4.base main_~nondetString1~4.base)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= .cse4 main_~length1~4) .cse13 .cse14)))) [2018-01-24 11:47:21,616 INFO L401 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-01-24 11:47:21,616 INFO L401 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-24 11:47:21,616 INFO L401 ceAbstractionStarter]: For program point mainErr2RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-24 11:47:21,616 INFO L401 ceAbstractionStarter]: For program point L566'(line 566) no Hoare annotation was computed. [2018-01-24 11:47:21,616 INFO L401 ceAbstractionStarter]: For program point L556''(lines 556 558) no Hoare annotation was computed. [2018-01-24 11:47:21,616 INFO L401 ceAbstractionStarter]: For program point mainErr3RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-24 11:47:21,616 INFO L401 ceAbstractionStarter]: For program point L562'(line 562) no Hoare annotation was computed. [2018-01-24 11:47:21,616 INFO L401 ceAbstractionStarter]: For program point L564'(line 564) no Hoare annotation was computed. [2018-01-24 11:47:21,616 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 553 567) no Hoare annotation was computed. [2018-01-24 11:47:21,616 INFO L401 ceAbstractionStarter]: For program point L556(lines 556 558) no Hoare annotation was computed. [2018-01-24 11:47:21,616 INFO L401 ceAbstractionStarter]: For program point mainErr4EnsuresViolation(lines 553 567) no Hoare annotation was computed. [2018-01-24 11:47:21,616 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 553 567) no Hoare annotation was computed. [2018-01-24 11:47:21,617 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 553 567) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 11:47:21,617 INFO L401 ceAbstractionStarter]: For program point L562''(line 562) no Hoare annotation was computed. [2018-01-24 11:47:21,617 INFO L401 ceAbstractionStarter]: For program point L563''(line 563) no Hoare annotation was computed. [2018-01-24 11:47:21,617 INFO L401 ceAbstractionStarter]: For program point L563'''(line 563) no Hoare annotation was computed. [2018-01-24 11:47:21,617 INFO L401 ceAbstractionStarter]: For program point L559'(lines 559 561) no Hoare annotation was computed. [2018-01-24 11:47:21,617 INFO L401 ceAbstractionStarter]: For program point cstrncmpErr1RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-24 11:47:21,617 INFO L401 ceAbstractionStarter]: For program point L546(line 546) no Hoare annotation was computed. [2018-01-24 11:47:21,617 INFO L401 ceAbstractionStarter]: For program point L545(lines 545 550) no Hoare annotation was computed. [2018-01-24 11:47:21,617 INFO L401 ceAbstractionStarter]: For program point cstrncmpErr5RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-24 11:47:21,617 INFO L401 ceAbstractionStarter]: For program point L543(lines 543 544) no Hoare annotation was computed. [2018-01-24 11:47:21,617 INFO L401 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-01-24 11:47:21,617 INFO L401 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-01-24 11:47:21,617 INFO L401 ceAbstractionStarter]: For program point cstrncmpErr7RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-24 11:47:21,617 INFO L401 ceAbstractionStarter]: For program point cstrncmpErr0RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-24 11:47:21,618 INFO L401 ceAbstractionStarter]: For program point L545''''(lines 545 550) no Hoare annotation was computed. [2018-01-24 11:47:21,618 INFO L401 ceAbstractionStarter]: For program point L546'(line 546) no Hoare annotation was computed. [2018-01-24 11:47:21,618 INFO L401 ceAbstractionStarter]: For program point cstrncmpErr4RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-24 11:47:21,618 INFO L401 ceAbstractionStarter]: For program point L547'''(line 547) no Hoare annotation was computed. [2018-01-24 11:47:21,618 INFO L401 ceAbstractionStarter]: For program point L548'(line 548) no Hoare annotation was computed. [2018-01-24 11:47:21,618 INFO L401 ceAbstractionStarter]: For program point cstrncmpErr8RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-24 11:47:21,618 INFO L401 ceAbstractionStarter]: For program point cstrncmpEXIT(lines 540 552) no Hoare annotation was computed. [2018-01-24 11:47:21,618 INFO L397 ceAbstractionStarter]: At program point L545'''(lines 545 550) the Hoare annotation is: (let ((.cse13 (select |#length| cstrncmp_~s1.base))) (let ((.cse1 (= 1 (select |#valid| cstrncmp_~s1.base))) (.cse2 (= 0 cstrncmp_~s2.offset)) (.cse3 (<= 1 .cse13)) (.cse14 (select |#length| cstrncmp_~s2.base)) (.cse4 (= 0 cstrncmp_~s1.offset)) (.cse6 (= 1 (select |#valid| cstrncmp_~s2.base))) (.cse10 (not (= 0 |cstrncmp_#in~s1.offset|))) (.cse7 (not (= 1 (select |#valid| |cstrncmp_#in~s2.base|)))) (.cse8 (< (select |#length| |cstrncmp_#in~s2.base|) 1)) (.cse9 (not (= (select |#valid| |cstrncmp_#in~s1.base|) 1))) (.cse15 (not (= 0 |cstrncmp_#in~s2.offset|)))) (and (let ((.cse0 (exists ((main_~nondetString1~4.offset Int)) (and (= 0 (select (select |#memory_int| cstrncmp_~s1.base) (+ main_~nondetString1~4.offset (select |#length| cstrncmp_~s1.base) (- 1)))) (<= main_~nondetString1~4.offset 0) (<= 0 main_~nondetString1~4.offset)))) (.cse11 (<= (+ cstrncmp_~s2.offset 1) .cse14)) (.cse5 (exists ((main_~nondetString2~4.offset Int)) (and (= 0 (select (select |#memory_int| cstrncmp_~s2.base) (+ main_~nondetString2~4.offset (select |#length| cstrncmp_~s2.base) (- 1)))) (<= main_~nondetString2~4.offset 0) (<= 0 main_~nondetString2~4.offset)))) (.cse12 (<= (+ cstrncmp_~s1.offset 1) .cse13))) (or (and .cse0 .cse1 .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) .cse7 .cse8 (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|))))) .cse9 .cse10 (not (exists ((main_~length1~4 Int) (v_main_~nondetString1~4.offset_BEFORE_CALL_1 Int)) (and (<= (+ main_~length1~4 v_main_~nondetString1~4.offset_BEFORE_CALL_1) (select |#length| |cstrncmp_#in~s1.base|)) (= (select (select |#memory_int| |cstrncmp_#in~s1.base|) (+ main_~length1~4 v_main_~nondetString1~4.offset_BEFORE_CALL_1 (- 1))) 0) (<= 1 main_~length1~4) (<= |cstrncmp_#in~s1.offset| v_main_~nondetString1~4.offset_BEFORE_CALL_1)))) (and (<= 2 cstrncmp_~s2.offset) .cse0 (<= 2 cstrncmp_~s1.offset) .cse11 .cse1 .cse6 .cse5 .cse12) (and (<= 1 cstrncmp_~s1.offset) .cse0 .cse11 .cse1 (<= 1 cstrncmp_~s2.offset) (or (<= (+ cstrncmp_~s1.offset 2) .cse13) (= 1 cstrncmp_~s1.offset)) (or (<= (+ cstrncmp_~s2.offset 2) .cse14) (<= cstrncmp_~s2.offset 1)) .cse6 .cse5 .cse12) (not (exists ((main_~nondetString1~4.offset Int)) (and (= (select (select |#memory_int| |cstrncmp_#in~s1.base|) (+ main_~nondetString1~4.offset (select |#length| |cstrncmp_#in~s1.base|) (- 1))) 0) (<= main_~nondetString1~4.offset 0) (<= 0 main_~nondetString1~4.offset)))) (not (exists ((main_~nondetString2~4.offset Int)) (and (<= main_~nondetString2~4.offset 0) (= 0 (select (select |#memory_int| |cstrncmp_#in~s2.base|) (+ (select |#length| |cstrncmp_#in~s2.base|) main_~nondetString2~4.offset (- 1)))) (<= 0 main_~nondetString2~4.offset)))) .cse15)) (or (< (select |#length| |cstrncmp_#in~s1.base|) 1) (and .cse1 .cse2 .cse3 (<= 1 .cse14) (= 0 (select (select |#memory_int| cstrncmp_~s1.base) cstrncmp_~s1.offset)) .cse4 .cse6) .cse10 .cse7 (not (= 0 (select (select |#memory_int| |cstrncmp_#in~s1.base|) |cstrncmp_#in~s1.offset|))) .cse8 .cse9 .cse15)))) [2018-01-24 11:47:21,618 INFO L401 ceAbstractionStarter]: For program point cstrncmpErr3RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-24 11:47:21,618 INFO L404 ceAbstractionStarter]: At program point cstrncmpENTRY(lines 540 552) the Hoare annotation is: true [2018-01-24 11:47:21,618 INFO L401 ceAbstractionStarter]: For program point cstrncmpErr9RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-24 11:47:21,619 INFO L401 ceAbstractionStarter]: For program point cstrncmpErr2RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-24 11:47:21,619 INFO L401 ceAbstractionStarter]: For program point L546''(line 546) no Hoare annotation was computed. [2018-01-24 11:47:21,619 INFO L401 ceAbstractionStarter]: For program point L545'(lines 545 550) no Hoare annotation was computed. [2018-01-24 11:47:21,619 INFO L401 ceAbstractionStarter]: For program point L546'''(line 546) no Hoare annotation was computed. [2018-01-24 11:47:21,619 INFO L401 ceAbstractionStarter]: For program point L547'(line 547) no Hoare annotation was computed. [2018-01-24 11:47:21,619 INFO L401 ceAbstractionStarter]: For program point cstrncmpErr6RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-24 11:47:21,619 INFO L401 ceAbstractionStarter]: For program point cstrncmpFINAL(lines 540 552) no Hoare annotation was computed. [2018-01-24 11:47:21,619 INFO L401 ceAbstractionStarter]: For program point L547''(line 547) no Hoare annotation was computed. [2018-01-24 11:47:21,629 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-24 11:47:21,630 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-24 11:47:21,630 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-24 11:47:21,631 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 11:47:21,631 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:47:21,631 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 11:47:21,631 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:47:21,632 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:47:21,632 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 11:47:21,632 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-24 11:47:21,632 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-24 11:47:21,633 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-24 11:47:21,633 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-24 11:47:21,633 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-24 11:47:21,634 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-24 11:47:21,634 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-24 11:47:21,634 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 11:47:21,634 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:47:21,635 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 11:47:21,635 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:47:21,635 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 11:47:21,635 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:47:21,636 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-24 11:47:21,636 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-24 11:47:21,636 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-24 11:47:21,637 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-24 11:47:21,637 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-24 11:47:21,637 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-24 11:47:21,637 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-24 11:47:21,638 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-24 11:47:21,638 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-24 11:47:21,639 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-24 11:47:21,639 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-24 11:47:21,639 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-24 11:47:21,639 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-24 11:47:21,640 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-24 11:47:21,640 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-24 11:47:21,640 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-24 11:47:21,640 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-24 11:47:21,640 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-24 11:47:21,643 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:21,644 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,644 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,644 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:21,644 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,645 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:21,645 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,645 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,646 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:21,646 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,646 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,646 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:21,647 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:21,647 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,647 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,648 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:21,648 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,648 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,648 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:21,649 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,649 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,649 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,649 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,650 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:21,650 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,650 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,650 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:21,651 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,651 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:21,651 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,651 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,652 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,652 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,652 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:21,652 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:21,652 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,664 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-24 11:47:21,665 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-24 11:47:21,665 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-24 11:47:21,665 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 11:47:21,666 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:47:21,666 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 11:47:21,666 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:47:21,666 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:47:21,667 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 11:47:21,667 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-24 11:47:21,667 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-24 11:47:21,667 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-24 11:47:21,668 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-24 11:47:21,668 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-24 11:47:21,668 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-24 11:47:21,668 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-24 11:47:21,669 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 11:47:21,669 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:47:21,669 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 11:47:21,669 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:47:21,670 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 11:47:21,670 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:47:21,670 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-24 11:47:21,670 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-24 11:47:21,671 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-24 11:47:21,671 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-24 11:47:21,671 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-24 11:47:21,671 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-24 11:47:21,672 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-24 11:47:21,672 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-24 11:47:21,672 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-24 11:47:21,673 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-24 11:47:21,673 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-24 11:47:21,673 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-24 11:47:21,673 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-24 11:47:21,674 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-24 11:47:21,674 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-24 11:47:21,674 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-24 11:47:21,674 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-24 11:47:21,675 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-24 11:47:21,675 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:21,676 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,676 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,676 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:21,676 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,677 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:21,677 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,677 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,677 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:21,678 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,678 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,678 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:21,678 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:21,679 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,679 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,679 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:21,679 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,680 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,680 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:21,680 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,680 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,681 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,681 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,681 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:21,681 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,682 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,682 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:21,682 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,682 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:21,682 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,683 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,683 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,683 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,683 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:21,683 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:21,684 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 11:47:21 BoogieIcfgContainer [2018-01-24 11:47:21,687 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 11:47:21,688 INFO L168 Benchmark]: Toolchain (without parser) took 20106.07 ms. Allocated memory was 305.1 MB in the beginning and 584.6 MB in the end (delta: 279.4 MB). Free memory was 265.1 MB in the beginning and 470.3 MB in the end (delta: -205.2 MB). Peak memory consumption was 221.5 MB. Max. memory is 5.3 GB. [2018-01-24 11:47:21,689 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 305.1 MB. Free memory is still 271.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 11:47:21,690 INFO L168 Benchmark]: CACSL2BoogieTranslator took 200.35 ms. Allocated memory is still 305.1 MB. Free memory was 264.1 MB in the beginning and 254.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-24 11:47:21,690 INFO L168 Benchmark]: Boogie Preprocessor took 34.52 ms. Allocated memory is still 305.1 MB. Free memory was 254.1 MB in the beginning and 252.1 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:47:21,690 INFO L168 Benchmark]: RCFGBuilder took 302.33 ms. Allocated memory is still 305.1 MB. Free memory was 252.1 MB in the beginning and 232.1 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 5.3 GB. [2018-01-24 11:47:21,691 INFO L168 Benchmark]: TraceAbstraction took 19561.26 ms. Allocated memory was 305.1 MB in the beginning and 584.6 MB in the end (delta: 279.4 MB). Free memory was 232.1 MB in the beginning and 470.3 MB in the end (delta: -238.2 MB). Peak memory consumption was 188.5 MB. Max. memory is 5.3 GB. [2018-01-24 11:47:21,693 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.27 ms. Allocated memory is still 305.1 MB. Free memory is still 271.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 200.35 ms. Allocated memory is still 305.1 MB. Free memory was 264.1 MB in the beginning and 254.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.52 ms. Allocated memory is still 305.1 MB. Free memory was 254.1 MB in the beginning and 252.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 302.33 ms. Allocated memory is still 305.1 MB. Free memory was 252.1 MB in the beginning and 232.1 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 19561.26 ms. Allocated memory was 305.1 MB in the beginning and 584.6 MB in the end (delta: 279.4 MB). Free memory was 232.1 MB in the beginning and 470.3 MB in the end (delta: -238.2 MB). Peak memory consumption was 188.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,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.offset,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.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.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~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[main_~nondetString1~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,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.offset,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_~nondetString1~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,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.offset,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_~nondetString1~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,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.offset,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_~nondetString1~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,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.offset,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.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.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~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[main_~nondetString1~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,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.offset,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_~nondetString1~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,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.offset,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_~nondetString1~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,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.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #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 #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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #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 #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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 553]: 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:47:21,706 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-24 11:47:21,706 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-24 11:47:21,706 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-24 11:47:21,707 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 11:47:21,707 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:47:21,707 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 11:47:21,707 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:47:21,708 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:47:21,708 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 11:47:21,708 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-24 11:47:21,708 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-24 11:47:21,709 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-24 11:47:21,709 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-24 11:47:21,709 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-24 11:47:21,709 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-24 11:47:21,710 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-24 11:47:21,710 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 11:47:21,710 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:47:21,710 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 11:47:21,711 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:47:21,711 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 11:47:21,711 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:47:21,711 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-24 11:47:21,712 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-24 11:47:21,712 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-24 11:47:21,712 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-24 11:47:21,712 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-24 11:47:21,712 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-24 11:47:21,713 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-24 11:47:21,713 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-24 11:47:21,713 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-24 11:47:21,714 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-24 11:47:21,714 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-24 11:47:21,714 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-24 11:47:21,714 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-24 11:47:21,714 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-24 11:47:21,715 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-24 11:47:21,715 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-24 11:47:21,715 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-24 11:47:21,715 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-24 11:47:21,716 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:21,716 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,716 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,717 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:21,717 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,717 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:21,717 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,718 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,718 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:21,718 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,718 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,718 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:21,719 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:21,719 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,719 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,719 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:21,720 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,720 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,720 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:21,720 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,720 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,721 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,721 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,721 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:21,721 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,721 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,722 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:21,722 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,722 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:21,722 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,722 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,723 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,723 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,723 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:21,723 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:21,723 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,727 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-24 11:47:21,727 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-24 11:47:21,728 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-24 11:47:21,728 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 11:47:21,728 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:47:21,729 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 11:47:21,729 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:47:21,729 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:47:21,729 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 11:47:21,730 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-24 11:47:21,730 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-24 11:47:21,730 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-24 11:47:21,730 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-24 11:47:21,731 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-24 11:47:21,731 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-24 11:47:21,731 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-24 11:47:21,731 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 11:47:21,732 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:47:21,732 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 11:47:21,732 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:47:21,732 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 11:47:21,732 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:47:21,733 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-24 11:47:21,733 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-24 11:47:21,733 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-24 11:47:21,733 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-24 11:47:21,734 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-24 11:47:21,734 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-24 11:47:21,734 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-24 11:47:21,734 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-24 11:47:21,734 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-24 11:47:21,735 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-24 11:47:21,735 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-24 11:47:21,735 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-24 11:47:21,735 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-24 11:47:21,736 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-24 11:47:21,736 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~4.offset,QUANTIFIED] [2018-01-24 11:47:21,736 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-24 11:47:21,736 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-24 11:47:21,736 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-24 11:47:21,737 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:21,737 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,737 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,737 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:21,738 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,738 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:21,738 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,738 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,739 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:21,739 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,739 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,739 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:21,740 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:21,740 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,740 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,740 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:21,740 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,741 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,741 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:21,741 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,741 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,742 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,742 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,742 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:21,742 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,742 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,743 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:21,743 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,743 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:21,743 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,743 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,743 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,744 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:21,744 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:21,744 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:21,744 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((((((((((((\exists main_~nondetString1~4.offset : int :: (0 == unknown-#memory_int-unknown[s1][main_~nondetString1~4.offset + unknown-#length-unknown[s1] + -1] && main_~nondetString1~4.offset <= 0) && 0 <= main_~nondetString1~4.offset) && 1 == \valid[s1]) && 0 == s2) && 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)) && 0 == s1) && (\exists main_~nondetString2~4.offset : int :: (0 == unknown-#memory_int-unknown[s2][main_~nondetString2~4.offset + unknown-#length-unknown[s2] + -1] && main_~nondetString2~4.offset <= 0) && 0 <= main_~nondetString2~4.offset)) && 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)) || !(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)) || (((((((2 <= s2 && (\exists main_~nondetString1~4.offset : int :: (0 == unknown-#memory_int-unknown[s1][main_~nondetString1~4.offset + unknown-#length-unknown[s1] + -1] && main_~nondetString1~4.offset <= 0) && 0 <= main_~nondetString1~4.offset)) && 2 <= s1) && s2 + 1 <= unknown-#length-unknown[s2]) && 1 == \valid[s1]) && 1 == \valid[s2]) && (\exists main_~nondetString2~4.offset : int :: (0 == unknown-#memory_int-unknown[s2][main_~nondetString2~4.offset + unknown-#length-unknown[s2] + -1] && main_~nondetString2~4.offset <= 0) && 0 <= main_~nondetString2~4.offset)) && s1 + 1 <= unknown-#length-unknown[s1])) || (((((((((1 <= s1 && (\exists main_~nondetString1~4.offset : int :: (0 == unknown-#memory_int-unknown[s1][main_~nondetString1~4.offset + unknown-#length-unknown[s1] + -1] && main_~nondetString1~4.offset <= 0) && 0 <= main_~nondetString1~4.offset)) && s2 + 1 <= unknown-#length-unknown[s2]) && 1 == \valid[s1]) && 1 <= s2) && (s1 + 2 <= unknown-#length-unknown[s1] || 1 == s1)) && (s2 + 2 <= unknown-#length-unknown[s2] || s2 <= 1)) && 1 == \valid[s2]) && (\exists main_~nondetString2~4.offset : int :: (0 == unknown-#memory_int-unknown[s2][main_~nondetString2~4.offset + unknown-#length-unknown[s2] + -1] && main_~nondetString2~4.offset <= 0) && 0 <= main_~nondetString2~4.offset)) && s1 + 1 <= unknown-#length-unknown[s1])) || !(\exists main_~nondetString1~4.offset : int :: (unknown-#memory_int-unknown[s1][main_~nondetString1~4.offset + unknown-#length-unknown[s1] + -1] == 0 && main_~nondetString1~4.offset <= 0) && 0 <= main_~nondetString1~4.offset)) || !(\exists main_~nondetString2~4.offset : int :: (main_~nondetString2~4.offset <= 0 && 0 == unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + main_~nondetString2~4.offset + -1]) && 0 <= main_~nondetString2~4.offset)) || !(0 == s2)) && (((((((unknown-#length-unknown[s1] < 1 || ((((((1 == \valid[s1] && 0 == s2) && 1 <= unknown-#length-unknown[s1]) && 1 <= unknown-#length-unknown[s2]) && 0 == unknown-#memory_int-unknown[s1][s1]) && 0 == s1) && 1 == \valid[s2])) || !(0 == s1)) || !(1 == \valid[s2])) || !(0 == unknown-#memory_int-unknown[s1][s1])) || unknown-#length-unknown[s2] < 1) || !(\valid[s1] == 1)) || !(0 == s2)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 58 locations, 15 error locations. SAFE Result, 19.4s OverallTime, 20 OverallIterations, 3 TraceHistogramMax, 8.9s AutomataDifference, 0.0s DeadEndRemovalTime, 4.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 697 SDtfs, 1063 SDslu, 2946 SDs, 0 SdLazy, 2697 SolverSat, 176 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 468 GetRequests, 182 SyntacticMatches, 3 SemanticMatches, 283 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 997 ImplicationChecksByTransitivity, 8.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred 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, 20 MinimizatonAttempts, 37 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 13 NumberOfFragments, 692 HoareAnnotationTreeSize, 9 FomulaSimplifications, 118 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 1099 FormulaSimplificationTreeSizeReductionInter, 3.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 705 NumberOfCodeBlocks, 705 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 679 ConstructedInterpolants, 60 QuantifiedInterpolants, 205111 SizeOfPredicates, 55 NumberOfNonLiveVariables, 1013 ConjunctsInSsa, 189 ConjunctsInUnsatCore, 26 InterpolantComputations, 15 PerfectInterpolantSequences, 25/96 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/openbsd_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-47-21-751.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_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-47-21-751.csv Received shutdown request...