java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf -i ../../../trunk/examples/svcomp/array-memsafety/strreplace-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 05:32:08,732 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 05:32:08,734 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 05:32:08,746 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 05:32:08,747 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 05:32:08,748 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 05:32:08,749 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 05:32:08,751 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 05:32:08,753 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 05:32:08,754 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 05:32:08,755 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 05:32:08,755 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 05:32:08,756 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 05:32:08,758 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 05:32:08,759 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 05:32:08,761 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 05:32:08,764 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 05:32:08,766 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 05:32:08,767 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 05:32:08,768 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 05:32:08,771 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 05:32:08,771 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 05:32:08,771 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 05:32:08,772 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 05:32:08,773 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 05:32:08,774 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 05:32:08,775 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 05:32:08,775 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 05:32:08,776 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 05:32:08,776 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 05:32:08,776 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 05:32:08,777 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf [2018-01-25 05:32:08,785 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 05:32:08,785 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 05:32:08,786 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 05:32:08,786 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 05:32:08,786 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 05:32:08,786 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 05:32:08,786 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 05:32:08,787 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 05:32:08,787 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 05:32:08,787 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 05:32:08,787 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 05:32:08,787 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 05:32:08,788 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 05:32:08,788 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 05:32:08,788 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 05:32:08,788 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 05:32:08,788 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 05:32:08,788 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 05:32:08,788 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 05:32:08,788 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 05:32:08,789 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 05:32:08,789 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 05:32:08,789 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 05:32:08,789 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 05:32:08,789 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 05:32:08,790 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 05:32:08,790 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 05:32:08,790 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 05:32:08,790 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 05:32:08,790 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 05:32:08,790 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 05:32:08,791 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 05:32:08,791 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 05:32:08,791 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 05:32:08,791 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 05:32:08,792 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 05:32:08,825 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 05:32:08,836 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 05:32:08,839 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 05:32:08,841 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 05:32:08,841 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 05:32:08,841 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/strreplace-alloca_true-valid-memsafety_true-termination.i [2018-01-25 05:32:08,999 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 05:32:09,005 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 05:32:09,005 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 05:32:09,006 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 05:32:09,011 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 05:32:09,012 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:32:08" (1/1) ... [2018-01-25 05:32:09,014 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c4ddec1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:32:09, skipping insertion in model container [2018-01-25 05:32:09,014 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:32:08" (1/1) ... [2018-01-25 05:32:09,027 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:32:09,066 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:32:09,176 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:32:09,193 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:32:09,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:32:09 WrapperNode [2018-01-25 05:32:09,201 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 05:32:09,201 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 05:32:09,202 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 05:32:09,202 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 05:32:09,218 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:32:09" (1/1) ... [2018-01-25 05:32:09,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:32:09" (1/1) ... [2018-01-25 05:32:09,227 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:32:09" (1/1) ... [2018-01-25 05:32:09,228 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:32:09" (1/1) ... [2018-01-25 05:32:09,232 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:32:09" (1/1) ... [2018-01-25 05:32:09,235 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:32:09" (1/1) ... [2018-01-25 05:32:09,236 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:32:09" (1/1) ... [2018-01-25 05:32:09,239 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 05:32:09,239 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 05:32:09,239 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 05:32:09,239 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 05:32:09,241 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:32:09" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 05:32:09,290 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 05:32:09,291 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 05:32:09,291 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrreplace [2018-01-25 05:32:09,291 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 05:32:09,291 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 05:32:09,291 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 05:32:09,291 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 05:32:09,292 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 05:32:09,292 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 05:32:09,292 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 05:32:09,292 INFO L128 BoogieDeclarations]: Found specification of procedure cstrreplace [2018-01-25 05:32:09,292 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 05:32:09,292 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 05:32:09,293 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 05:32:09,487 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 05:32:09,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:32:09 BoogieIcfgContainer [2018-01-25 05:32:09,488 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 05:32:09,489 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 05:32:09,489 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 05:32:09,491 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 05:32:09,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 05:32:08" (1/3) ... [2018-01-25 05:32:09,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e719d23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:32:09, skipping insertion in model container [2018-01-25 05:32:09,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:32:09" (2/3) ... [2018-01-25 05:32:09,493 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e719d23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:32:09, skipping insertion in model container [2018-01-25 05:32:09,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:32:09" (3/3) ... [2018-01-25 05:32:09,495 INFO L105 eAbstractionObserver]: Analyzing ICFG strreplace-alloca_true-valid-memsafety_true-termination.i [2018-01-25 05:32:09,502 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 05:32:09,508 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-25 05:32:09,555 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 05:32:09,555 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 05:32:09,555 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 05:32:09,555 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 05:32:09,555 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 05:32:09,555 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 05:32:09,555 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 05:32:09,555 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 05:32:09,556 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 05:32:09,570 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-01-25 05:32:09,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-25 05:32:09,576 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:32:09,577 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:32:09,577 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:32:09,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1004390414, now seen corresponding path program 1 times [2018-01-25 05:32:09,586 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:32:09,630 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:09,631 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:32:09,631 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:09,631 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:32:09,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:32:09,683 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:32:09,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:32:09,749 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:32:09,750 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:32:09,750 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:32:09,752 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:32:09,764 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:32:09,765 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:32:09,767 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 4 states. [2018-01-25 05:32:09,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:32:09,969 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2018-01-25 05:32:09,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:32:09,970 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-01-25 05:32:09,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:32:09,978 INFO L225 Difference]: With dead ends: 51 [2018-01-25 05:32:09,979 INFO L226 Difference]: Without dead ends: 36 [2018-01-25 05:32:09,982 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:32:09,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-25 05:32:10,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-01-25 05:32:10,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-25 05:32:10,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-01-25 05:32:10,012 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 10 [2018-01-25 05:32:10,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:32:10,013 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-01-25 05:32:10,013 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:32:10,013 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-01-25 05:32:10,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-25 05:32:10,013 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:32:10,014 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:32:10,014 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:32:10,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1004390413, now seen corresponding path program 1 times [2018-01-25 05:32:10,014 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:32:10,015 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:10,015 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:32:10,015 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:10,015 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:32:10,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:32:10,033 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:32:10,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:32:10,146 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:32:10,146 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:32:10,147 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:32:10,148 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:32:10,149 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:32:10,149 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:32:10,149 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 5 states. [2018-01-25 05:32:10,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:32:10,194 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-01-25 05:32:10,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:32:10,195 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-01-25 05:32:10,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:32:10,196 INFO L225 Difference]: With dead ends: 36 [2018-01-25 05:32:10,196 INFO L226 Difference]: Without dead ends: 35 [2018-01-25 05:32:10,197 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:32:10,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-01-25 05:32:10,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-01-25 05:32:10,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-01-25 05:32:10,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-01-25 05:32:10,203 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 10 [2018-01-25 05:32:10,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:32:10,204 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-01-25 05:32:10,204 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:32:10,204 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-01-25 05:32:10,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-25 05:32:10,205 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:32:10,205 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:32:10,205 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:32:10,205 INFO L82 PathProgramCache]: Analyzing trace with hash -104566583, now seen corresponding path program 1 times [2018-01-25 05:32:10,205 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:32:10,206 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:10,207 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:32:10,207 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:10,207 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:32:10,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:32:10,229 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:32:10,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:32:10,273 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:32:10,273 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:32:10,273 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:32:10,273 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:32:10,273 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:32:10,274 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:32:10,274 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 5 states. [2018-01-25 05:32:10,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:32:10,351 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-01-25 05:32:10,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:32:10,352 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-01-25 05:32:10,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:32:10,353 INFO L225 Difference]: With dead ends: 35 [2018-01-25 05:32:10,353 INFO L226 Difference]: Without dead ends: 32 [2018-01-25 05:32:10,354 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:32:10,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-01-25 05:32:10,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-01-25 05:32:10,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-01-25 05:32:10,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-01-25 05:32:10,360 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 15 [2018-01-25 05:32:10,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:32:10,360 INFO L432 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-01-25 05:32:10,361 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:32:10,361 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-01-25 05:32:10,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-25 05:32:10,361 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:32:10,362 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:32:10,362 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:32:10,362 INFO L82 PathProgramCache]: Analyzing trace with hash -104566582, now seen corresponding path program 1 times [2018-01-25 05:32:10,362 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:32:10,363 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:10,364 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:32:10,364 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:10,364 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:32:10,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:32:10,381 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:32:10,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:32:10,496 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:32:10,496 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 05:32:10,496 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:32:10,496 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 05:32:10,496 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 05:32:10,497 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:32:10,497 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 8 states. [2018-01-25 05:32:10,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:32:10,619 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2018-01-25 05:32:10,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 05:32:10,620 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-01-25 05:32:10,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:32:10,622 INFO L225 Difference]: With dead ends: 46 [2018-01-25 05:32:10,623 INFO L226 Difference]: Without dead ends: 43 [2018-01-25 05:32:10,623 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-25 05:32:10,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-01-25 05:32:10,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 38. [2018-01-25 05:32:10,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-25 05:32:10,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-01-25 05:32:10,628 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 15 [2018-01-25 05:32:10,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:32:10,629 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2018-01-25 05:32:10,629 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 05:32:10,629 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-01-25 05:32:10,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-25 05:32:10,630 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:32:10,630 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] [2018-01-25 05:32:10,630 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:32:10,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1089103921, now seen corresponding path program 1 times [2018-01-25 05:32:10,631 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:32:10,631 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:10,632 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:32:10,632 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:10,632 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:32:10,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:32:10,658 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:32:10,848 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-25 05:32:10,848 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:32:10,849 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 05:32:10,849 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:32:10,849 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 05:32:10,850 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 05:32:10,850 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-25 05:32:10,850 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 9 states. [2018-01-25 05:32:10,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:32:10,957 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2018-01-25 05:32:10,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 05:32:10,957 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-01-25 05:32:10,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:32:10,958 INFO L225 Difference]: With dead ends: 77 [2018-01-25 05:32:10,958 INFO L226 Difference]: Without dead ends: 55 [2018-01-25 05:32:10,959 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-01-25 05:32:10,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-25 05:32:10,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2018-01-25 05:32:10,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-25 05:32:10,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-01-25 05:32:10,966 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 21 [2018-01-25 05:32:10,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:32:10,966 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-01-25 05:32:10,966 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 05:32:10,966 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-01-25 05:32:10,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-25 05:32:10,967 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:32:10,967 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] [2018-01-25 05:32:10,967 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:32:10,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1925999697, now seen corresponding path program 1 times [2018-01-25 05:32:10,968 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:32:10,968 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:10,968 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:32:10,969 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:10,969 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:32:10,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:32:10,987 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:32:11,205 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-25 05:32:11,205 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:32:11,205 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:32:11,206 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-01-25 05:32:11,208 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [8], [10], [15], [16], [27], [29], [38], [43], [45], [46], [47], [50], [57], [58], [59], [61] [2018-01-25 05:32:11,254 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:32:11,254 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:32:11,731 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:32:11,732 INFO L268 AbstractInterpreter]: Visited 20 different actions 27 times. Merged at 7 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 25 variables. [2018-01-25 05:32:11,761 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:32:11,761 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:32:11,761 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:32:11,770 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:32:11,770 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:32:11,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:32:11,816 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:32:11,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-25 05:32:11,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-25 05:32:11,860 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:11,862 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:11,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-25 05:32:11,868 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-25 05:32:12,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-01-25 05:32:12,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-01-25 05:32:12,050 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 05:32:12,053 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:32:12,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:32:12,073 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-01-25 05:32:12,197 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-25 05:32:12,197 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:32:12,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-01-25 05:32:12,394 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:12,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-25 05:32:12,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-25 05:32:12,429 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:12,431 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:12,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:12,440 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-01-25 05:32:12,447 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-25 05:32:12,479 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:32:12,480 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:32:12,486 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:32:12,486 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:32:12,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:32:12,530 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:32:12,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 05:32:12,534 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:12,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:12,539 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-25 05:32:12,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-25 05:32:12,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-25 05:32:12,572 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:12,574 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:12,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:12,582 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-25 05:32:12,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-25 05:32:12,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 16 [2018-01-25 05:32:12,702 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 05:32:12,707 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:32:12,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:32:12,713 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:30 [2018-01-25 05:32:12,766 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-25 05:32:12,766 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:32:12,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-25 05:32:12,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-25 05:32:12,833 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:12,843 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:12,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:12,847 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-01-25 05:32:12,897 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-25 05:32:12,898 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:32:12,898 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8, 10, 10] total 31 [2018-01-25 05:32:12,898 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:32:12,899 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-25 05:32:12,899 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-25 05:32:12,899 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=873, Unknown=0, NotChecked=0, Total=992 [2018-01-25 05:32:12,900 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 16 states. [2018-01-25 05:32:14,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:32:14,514 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions. [2018-01-25 05:32:14,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-25 05:32:14,514 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2018-01-25 05:32:14,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:32:14,515 INFO L225 Difference]: With dead ends: 111 [2018-01-25 05:32:14,516 INFO L226 Difference]: Without dead ends: 108 [2018-01-25 05:32:14,516 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 58 SyntacticMatches, 5 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=247, Invalid=1559, Unknown=0, NotChecked=0, Total=1806 [2018-01-25 05:32:14,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-01-25 05:32:14,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 58. [2018-01-25 05:32:14,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-25 05:32:14,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2018-01-25 05:32:14,525 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 21 [2018-01-25 05:32:14,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:32:14,525 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2018-01-25 05:32:14,525 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-25 05:32:14,525 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2018-01-25 05:32:14,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 05:32:14,526 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:32:14,526 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:32:14,526 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:32:14,526 INFO L82 PathProgramCache]: Analyzing trace with hash 292485851, now seen corresponding path program 1 times [2018-01-25 05:32:14,526 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:32:14,527 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:14,527 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:32:14,527 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:14,527 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:32:14,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:32:14,544 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:32:14,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:32:14,622 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:32:14,622 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:32:14,622 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:32:14,622 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:32:14,623 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:32:14,623 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:32:14,623 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand 4 states. [2018-01-25 05:32:14,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:32:14,692 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2018-01-25 05:32:14,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:32:14,692 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-01-25 05:32:14,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:32:14,693 INFO L225 Difference]: With dead ends: 58 [2018-01-25 05:32:14,693 INFO L226 Difference]: Without dead ends: 38 [2018-01-25 05:32:14,693 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:32:14,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-25 05:32:14,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-01-25 05:32:14,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-25 05:32:14,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-01-25 05:32:14,698 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 23 [2018-01-25 05:32:14,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:32:14,698 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-01-25 05:32:14,698 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:32:14,698 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-01-25 05:32:14,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 05:32:14,699 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:32:14,699 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:32:14,699 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:32:14,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1201761770, now seen corresponding path program 2 times [2018-01-25 05:32:14,700 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:32:14,700 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:14,700 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:32:14,701 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:14,701 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:32:14,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:32:14,718 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:32:14,959 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:32:14,960 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:32:14,960 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:32:14,960 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:32:14,960 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 05:32:14,960 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:32:14,960 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:32:14,965 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:32:14,965 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:32:14,980 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:32:14,985 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:32:14,987 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:32:14,990 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:32:14,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 05:32:14,994 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:14,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:14,997 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 05:32:15,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-25 05:32:15,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-25 05:32:15,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:15,045 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:15,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:15,052 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-01-25 05:32:15,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-25 05:32:15,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-01-25 05:32:15,226 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 05:32:15,229 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:32:15,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:32:15,239 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:49 [2018-01-25 05:32:15,300 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:32:15,300 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:32:15,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2018-01-25 05:32:15,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-25 05:32:15,577 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:15,584 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:15,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2018-01-25 05:32:15,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-25 05:32:15,617 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:15,624 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:15,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:32:15,639 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:81, output treesize:98 [2018-01-25 05:32:15,734 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:32:15,754 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:32:15,755 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:32:15,758 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:32:15,758 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:32:15,774 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:32:15,788 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:32:15,805 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:32:15,810 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:32:15,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 05:32:15,813 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:15,818 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:15,818 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 05:32:15,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-25 05:32:15,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-25 05:32:15,829 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:15,831 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:15,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:15,835 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-01-25 05:32:15,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-25 05:32:15,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-01-25 05:32:15,947 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 05:32:15,951 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:32:15,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:32:15,978 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:49 [2018-01-25 05:32:15,982 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:32:15,982 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:32:16,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-25 05:32:16,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-25 05:32:16,162 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:16,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:16,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:32:16,170 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:52 [2018-01-25 05:32:16,258 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:32:16,260 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:32:16,260 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10, 10, 10] total 34 [2018-01-25 05:32:16,260 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:32:16,261 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-25 05:32:16,261 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-25 05:32:16,261 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1067, Unknown=0, NotChecked=0, Total=1190 [2018-01-25 05:32:16,262 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 18 states. [2018-01-25 05:32:17,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:32:17,041 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2018-01-25 05:32:17,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-25 05:32:17,041 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 27 [2018-01-25 05:32:17,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:32:17,042 INFO L225 Difference]: With dead ends: 78 [2018-01-25 05:32:17,042 INFO L226 Difference]: Without dead ends: 58 [2018-01-25 05:32:17,043 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 79 SyntacticMatches, 6 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=329, Invalid=2023, Unknown=0, NotChecked=0, Total=2352 [2018-01-25 05:32:17,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-25 05:32:17,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 46. [2018-01-25 05:32:17,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-25 05:32:17,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-01-25 05:32:17,049 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 27 [2018-01-25 05:32:17,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:32:17,049 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-01-25 05:32:17,049 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-25 05:32:17,049 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-01-25 05:32:17,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-25 05:32:17,050 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:32:17,050 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:32:17,050 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:32:17,050 INFO L82 PathProgramCache]: Analyzing trace with hash 2006324798, now seen corresponding path program 1 times [2018-01-25 05:32:17,050 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:32:17,051 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:17,051 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 05:32:17,051 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:17,051 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:32:17,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:32:17,073 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:32:17,285 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:32:17,285 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:32:17,285 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:32:17,285 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 36 with the following transitions: [2018-01-25 05:32:17,286 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [8], [10], [15], [16], [21], [22], [25], [27], [29], [38], [43], [45], [46], [47], [50], [57], [58], [59], [61] [2018-01-25 05:32:17,287 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:32:17,287 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:32:26,975 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:32:26,975 INFO L268 AbstractInterpreter]: Visited 23 different actions 106 times. Merged at 10 different actions 75 times. Widened at 1 different actions 4 times. Found 10 fixpoints after 2 different actions. Largest state had 26 variables. [2018-01-25 05:32:26,977 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:32:26,977 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:32:26,977 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:32:26,984 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:32:26,984 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:32:27,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:32:27,005 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:32:27,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 05:32:27,008 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:27,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:27,011 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 05:32:27,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-01-25 05:32:27,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-25 05:32:27,019 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:27,021 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:27,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:27,022 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-25 05:32:27,092 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 23 treesize of output 18 [2018-01-25 05:32:27,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 27 [2018-01-25 05:32:27,102 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 05:32:27,109 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:32:27,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:32:27,119 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:27 [2018-01-25 05:32:27,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-01-25 05:32:27,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-25 05:32:27,240 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 05:32:27,251 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:32:27,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:32:27,272 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:57, output treesize:34 [2018-01-25 05:32:27,341 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:32:27,341 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:32:27,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-25 05:32:27,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-25 05:32:27,628 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:27,629 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:27,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:32:27,634 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:35 [2018-01-25 05:32:27,695 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:32:27,715 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:32:27,715 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:32:27,718 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:32:27,718 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:32:27,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:32:27,769 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:32:27,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 05:32:27,775 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:27,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:27,781 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 05:32:27,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-25 05:32:27,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-25 05:32:27,790 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:27,791 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:27,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:27,795 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-01-25 05:32:27,839 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 23 treesize of output 18 [2018-01-25 05:32:27,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 30 [2018-01-25 05:32:27,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 05:32:27,858 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:32:27,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:32:27,867 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:27 [2018-01-25 05:32:27,984 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-01-25 05:32:27,984 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:27,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-01-25 05:32:27,997 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 26 treesize of output 16 [2018-01-25 05:32:27,997 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-25 05:32:28,004 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:32:28,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:32:28,013 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:63, output treesize:34 [2018-01-25 05:32:28,019 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:32:28,020 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:32:28,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-25 05:32:28,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-25 05:32:28,225 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:28,227 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:28,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:32:28,233 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:52 [2018-01-25 05:32:28,319 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:32:28,321 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:32:28,321 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 12, 12, 12] total 42 [2018-01-25 05:32:28,321 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:32:28,321 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-25 05:32:28,322 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-25 05:32:28,322 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=1588, Unknown=0, NotChecked=0, Total=1806 [2018-01-25 05:32:28,322 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 21 states. [2018-01-25 05:32:28,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:32:28,832 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2018-01-25 05:32:28,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-25 05:32:28,833 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 35 [2018-01-25 05:32:28,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:32:28,833 INFO L225 Difference]: With dead ends: 48 [2018-01-25 05:32:28,833 INFO L226 Difference]: Without dead ends: 0 [2018-01-25 05:32:28,834 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 99 SyntacticMatches, 11 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 853 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=568, Invalid=2624, Unknown=0, NotChecked=0, Total=3192 [2018-01-25 05:32:28,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-25 05:32:28,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-25 05:32:28,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-25 05:32:28,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-25 05:32:28,835 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2018-01-25 05:32:28,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:32:28,835 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-25 05:32:28,835 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-25 05:32:28,835 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-25 05:32:28,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-25 05:32:28,838 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-25 05:32:28,879 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-25 05:32:29,241 WARN L146 SmtUtils]: Spent 320ms on a formula simplification. DAG size of input: 130 DAG size of output 72 [2018-01-25 05:32:29,328 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 561) no Hoare annotation was computed. [2018-01-25 05:32:29,328 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 561) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 05:32:29,328 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 561) no Hoare annotation was computed. [2018-01-25 05:32:29,328 INFO L397 ceAbstractionStarter]: At program point cstrreplaceENTRY(lines 540 552) the Hoare annotation is: (let ((.cse6 (select |#length| |cstrreplace_#in~s.base|))) (let ((.cse0 (not (= 1 (select |#valid| |cstrreplace_#in~s.base|)))) (.cse1 (< .cse6 1)) (.cse3 (not (= 0 |cstrreplace_#in~s.offset|))) (.cse4 (select |#memory_int| |cstrreplace_#in~s.base|)) (.cse2 (select |old(#memory_int)| |cstrreplace_#in~s.base|))) (and (or .cse0 .cse1 (not (= (select .cse2 |cstrreplace_#in~s.offset|) 0)) .cse3 (= 0 (select .cse4 |cstrreplace_#in~s.offset|))) (let ((.cse5 (+ .cse6 (- 1)))) (or .cse0 .cse1 .cse3 (= 0 (select .cse4 .cse5)) (not (= 0 (select .cse2 .cse5)))))))) [2018-01-25 05:32:29,329 INFO L397 ceAbstractionStarter]: At program point L544'''(lines 544 550) the Hoare annotation is: (let ((.cse3 (select |#length| |cstrreplace_#in~s.base|))) (let ((.cse0 (not (= 1 (select |#valid| |cstrreplace_#in~s.base|)))) (.cse1 (< .cse3 1)) (.cse2 (select |old(#memory_int)| |cstrreplace_#in~s.base|)) (.cse5 (= 1 (select |#valid| cstrreplace_~p~2.base))) (.cse4 (exists ((main_~length1~5 Int) (v_main_~nondetString1~5.offset_BEFORE_CALL_2 Int)) (and (<= (+ main_~length1~5 v_main_~nondetString1~5.offset_BEFORE_CALL_2) (select |#length| cstrreplace_~p~2.base)) (= 0 (select (select |#memory_int| cstrreplace_~p~2.base) (+ main_~length1~5 v_main_~nondetString1~5.offset_BEFORE_CALL_2 (- 1)))) (<= 1 main_~length1~5) (<= cstrreplace_~p~2.offset v_main_~nondetString1~5.offset_BEFORE_CALL_2))))) (and (or (< 0 |cstrreplace_#in~s.offset|) .cse0 .cse1 (< |cstrreplace_#in~s.offset| 0) (not (= 0 (select .cse2 (+ .cse3 (- 1))))) (and .cse4 (exists ((v_main_~nondetString1~5.offset_BEFORE_CALL_4 Int)) (and (<= 0 v_main_~nondetString1~5.offset_BEFORE_CALL_4) (= 0 (select (select |#memory_int| cstrreplace_~p~2.base) (+ (select |#length| cstrreplace_~p~2.base) v_main_~nondetString1~5.offset_BEFORE_CALL_4 (- 1)))) (<= v_main_~nondetString1~5.offset_BEFORE_CALL_4 0) (<= v_main_~nondetString1~5.offset_BEFORE_CALL_4 cstrreplace_~p~2.offset))) (exists ((v_main_~nondetString1~5.offset_BEFORE_CALL_4 Int)) (and (<= v_main_~nondetString1~5.offset_BEFORE_CALL_4 |cstrreplace_#in~s.offset|) (<= 0 v_main_~nondetString1~5.offset_BEFORE_CALL_4) (= 0 (select (select |#memory_int| |cstrreplace_#in~s.base|) (+ (select |#length| |cstrreplace_#in~s.base|) v_main_~nondetString1~5.offset_BEFORE_CALL_4 (- 1)))) (<= v_main_~nondetString1~5.offset_BEFORE_CALL_4 0))) .cse5)) (or .cse0 .cse1 (not (= (select .cse2 |cstrreplace_#in~s.offset|) 0)) (not (= 0 |cstrreplace_#in~s.offset|)) (and (= 0 (select (select |#memory_int| cstrreplace_~p~2.base) cstrreplace_~p~2.offset)) .cse5 (= 0 (select (select |#memory_int| |cstrreplace_#in~s.base|) |cstrreplace_#in~s.offset|)) .cse4 (= cstrreplace_~p~2.offset 0)))))) [2018-01-25 05:32:29,329 INFO L401 ceAbstractionStarter]: For program point cstrreplaceErr2RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-25 05:32:29,329 INFO L401 ceAbstractionStarter]: For program point L544''''(lines 544 550) no Hoare annotation was computed. [2018-01-25 05:32:29,329 INFO L401 ceAbstractionStarter]: For program point L546(line 546) no Hoare annotation was computed. [2018-01-25 05:32:29,329 INFO L401 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-01-25 05:32:29,329 INFO L401 ceAbstractionStarter]: For program point cstrreplaceFINAL(lines 540 552) no Hoare annotation was computed. [2018-01-25 05:32:29,329 INFO L401 ceAbstractionStarter]: For program point L544(lines 544 550) no Hoare annotation was computed. [2018-01-25 05:32:29,329 INFO L401 ceAbstractionStarter]: For program point cstrreplaceErr1RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-25 05:32:29,329 INFO L401 ceAbstractionStarter]: For program point L544'(line 544) no Hoare annotation was computed. [2018-01-25 05:32:29,329 INFO L401 ceAbstractionStarter]: For program point L546'(line 546) no Hoare annotation was computed. [2018-01-25 05:32:29,329 INFO L401 ceAbstractionStarter]: For program point cstrreplaceErr5RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-25 05:32:29,329 INFO L401 ceAbstractionStarter]: For program point L545'''(lines 545 548) no Hoare annotation was computed. [2018-01-25 05:32:29,329 INFO L401 ceAbstractionStarter]: For program point cstrreplaceErr0RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-25 05:32:29,330 INFO L401 ceAbstractionStarter]: For program point cstrreplaceErr4RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-25 05:32:29,330 INFO L401 ceAbstractionStarter]: For program point cstrreplaceEXIT(lines 540 552) no Hoare annotation was computed. [2018-01-25 05:32:29,330 INFO L401 ceAbstractionStarter]: For program point L545'(line 545) no Hoare annotation was computed. [2018-01-25 05:32:29,330 INFO L401 ceAbstractionStarter]: For program point cstrreplaceErr3RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-25 05:32:29,330 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 561) the Hoare annotation is: true [2018-01-25 05:32:29,330 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 561) no Hoare annotation was computed. [2018-01-25 05:32:29,330 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 561) the Hoare annotation is: true [2018-01-25 05:32:29,330 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 561) no Hoare annotation was computed. [2018-01-25 05:32:29,330 INFO L397 ceAbstractionStarter]: At program point L560(line 560) the Hoare annotation is: (let ((.cse0 (select |#length| main_~nondetString1~5.base))) (and (= 1 (select |#valid| main_~nondetString1~5.base)) (= 0 |main_#t~malloc6.offset|) (= main_~length1~5 .cse0) (<= 1 main_~length1~5) (= main_~length1~5 (select |#length| |main_#t~malloc6.base|)) (= 0 (select (select |#memory_int| main_~nondetString1~5.base) (+ .cse0 (+ main_~nondetString1~5.offset (- 1))))) (= 0 main_~nondetString1~5.offset) (= 1 (select |#valid| |main_#t~malloc6.base|)) (= (store |#valid| |main_#t~malloc6.base| (select (store |#valid| |main_#t~malloc6.base| 0) |main_#t~malloc6.base|)) |old(#valid)|))) [2018-01-25 05:32:29,330 INFO L401 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-25 05:32:29,330 INFO L401 ceAbstractionStarter]: For program point L560'(line 560) no Hoare annotation was computed. [2018-01-25 05:32:29,330 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 553 561) no Hoare annotation was computed. [2018-01-25 05:32:29,331 INFO L401 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 553 561) no Hoare annotation was computed. [2018-01-25 05:32:29,331 INFO L401 ceAbstractionStarter]: For program point L555(lines 555 557) no Hoare annotation was computed. [2018-01-25 05:32:29,331 INFO L401 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-25 05:32:29,331 INFO L401 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-01-25 05:32:29,331 INFO L401 ceAbstractionStarter]: For program point L558(line 558) no Hoare annotation was computed. [2018-01-25 05:32:29,331 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 553 561) no Hoare annotation was computed. [2018-01-25 05:32:29,331 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 553 561) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 05:32:29,331 INFO L401 ceAbstractionStarter]: For program point L558''(line 558) no Hoare annotation was computed. [2018-01-25 05:32:29,331 INFO L401 ceAbstractionStarter]: For program point L558'(line 558) no Hoare annotation was computed. [2018-01-25 05:32:29,331 INFO L401 ceAbstractionStarter]: For program point L555''(lines 555 557) no Hoare annotation was computed. [2018-01-25 05:32:29,331 INFO L401 ceAbstractionStarter]: For program point L559'(line 559) no Hoare annotation was computed. [2018-01-25 05:32:29,338 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:29,339 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:29,339 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:29,340 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:29,340 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:29,340 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:29,340 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:29,341 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:29,341 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:29,341 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:29,341 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:29,342 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:29,342 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:29,342 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:29,343 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:29,343 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:29,343 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:29,343 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:29,343 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:29,343 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:29,345 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:29,345 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:29,345 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:29,345 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:29,345 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:29,346 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:29,346 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:29,346 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:29,346 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:29,346 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:29,346 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:29,346 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:29,347 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:29,347 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:29,347 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:29,353 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:29,353 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:29,353 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:29,353 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:29,354 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:29,354 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:29,354 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:29,354 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:29,354 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:29,355 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:29,355 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:29,355 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:29,355 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:29,355 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:29,355 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:29,356 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:29,356 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:29,356 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:29,356 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:29,356 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:29,356 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:29,356 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:29,357 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:29,357 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:29,357 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:29,357 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:29,357 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:29,357 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:29,357 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:29,358 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:29,358 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:29,358 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:29,358 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:29,358 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:29,358 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:29,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 05:32:29 BoogieIcfgContainer [2018-01-25 05:32:29,361 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 05:32:29,362 INFO L168 Benchmark]: Toolchain (without parser) took 20361.60 ms. Allocated memory was 304.6 MB in the beginning and 1.0 GB in the end (delta: 740.3 MB). Free memory was 263.5 MB in the beginning and 367.9 MB in the end (delta: -104.4 MB). Peak memory consumption was 635.9 MB. Max. memory is 5.3 GB. [2018-01-25 05:32:29,362 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 304.6 MB. Free memory is still 269.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 05:32:29,363 INFO L168 Benchmark]: CACSL2BoogieTranslator took 195.71 ms. Allocated memory is still 304.6 MB. Free memory was 263.5 MB in the beginning and 253.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-25 05:32:29,363 INFO L168 Benchmark]: Boogie Preprocessor took 37.29 ms. Allocated memory is still 304.6 MB. Free memory was 253.6 MB in the beginning and 251.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 05:32:29,363 INFO L168 Benchmark]: RCFGBuilder took 249.12 ms. Allocated memory is still 304.6 MB. Free memory was 251.6 MB in the beginning and 234.6 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. [2018-01-25 05:32:29,364 INFO L168 Benchmark]: TraceAbstraction took 19871.49 ms. Allocated memory was 304.6 MB in the beginning and 1.0 GB in the end (delta: 740.3 MB). Free memory was 234.6 MB in the beginning and 367.9 MB in the end (delta: -133.3 MB). Peak memory consumption was 607.0 MB. Max. memory is 5.3 GB. [2018-01-25 05:32:29,365 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.14 ms. Allocated memory is still 304.6 MB. Free memory is still 269.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 195.71 ms. Allocated memory is still 304.6 MB. Free memory was 263.5 MB in the beginning and 253.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 37.29 ms. Allocated memory is still 304.6 MB. Free memory was 253.6 MB in the beginning and 251.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 249.12 ms. Allocated memory is still 304.6 MB. Free memory was 251.6 MB in the beginning and 234.6 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 19871.49 ms. Allocated memory was 304.6 MB in the beginning and 1.0 GB in the end (delta: 740.3 MB). Free memory was 234.6 MB in the beginning and 367.9 MB in the end (delta: -133.3 MB). Peak memory consumption was 607.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 19 LocStat_MAX_WEQGRAPH_SIZE : 4 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 178 LocStat_NO_SUPPORTING_DISEQUALITIES : 27 LocStat_NO_DISJUNCTIONS : -38 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 26 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 46 TransStat_NO_SUPPORTING_DISEQUALITIES : 4 TransStat_NO_DISJUNCTIONS : 27 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.067004 RENAME_VARIABLES(MILLISECONDS) : 0.381906 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.010984 PROJECTAWAY(MILLISECONDS) : 1.039503 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.162682 DISJOIN(MILLISECONDS) : 0.382779 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.417219 ADD_EQUALITY(MILLISECONDS) : 0.041238 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.015318 #CONJOIN_DISJUNCTIVE : 48 #RENAME_VARIABLES : 78 #UNFREEZE : 0 #CONJOIN : 86 #PROJECTAWAY : 67 #ADD_WEAK_EQUALITY : 5 #DISJOIN : 8 #RENAME_VARIABLES_DISJUNCTIVE : 75 #ADD_EQUALITY : 47 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 21 LocStat_MAX_WEQGRAPH_SIZE : 4 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 224 LocStat_NO_SUPPORTING_DISEQUALITIES : 22 LocStat_NO_DISJUNCTIONS : -42 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 29 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 50 TransStat_NO_SUPPORTING_DISEQUALITIES : 4 TransStat_NO_DISJUNCTIONS : 30 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 4.651764 RENAME_VARIABLES(MILLISECONDS) : 0.975379 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 4.606207 PROJECTAWAY(MILLISECONDS) : 6.369218 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.087503 DISJOIN(MILLISECONDS) : 1.472938 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 1.004399 ADD_EQUALITY(MILLISECONDS) : 0.030555 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.012015 #CONJOIN_DISJUNCTIVE : 201 #RENAME_VARIABLES : 396 #UNFREEZE : 0 #CONJOIN : 256 #PROJECTAWAY : 236 #ADD_WEAK_EQUALITY : 7 #DISJOIN : 68 #RENAME_VARIABLES_DISJUNCTIVE : 379 #ADD_EQUALITY : 52 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 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 - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - InvariantResult [Line: 544]: Loop Invariant [2018-01-25 05:32:29,374 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:29,375 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:29,375 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:29,375 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:29,375 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:29,376 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:29,376 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:29,376 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:29,376 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:29,376 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:29,376 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:29,377 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:29,377 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:29,377 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:29,377 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:29,378 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:29,378 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:29,378 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:29,378 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:29,378 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:29,379 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:29,379 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:29,379 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:29,379 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:29,379 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:29,380 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:29,380 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:29,380 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:29,380 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:29,380 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:29,381 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:29,381 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:29,381 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:29,381 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:29,381 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:29,384 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:29,384 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:29,384 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:29,384 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:29,384 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:29,385 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:29,385 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:29,385 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:29,385 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:29,385 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:29,386 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:29,386 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:29,386 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:29,386 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:29,387 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:29,387 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:29,387 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:29,387 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:29,387 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-25 05:32:29,387 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:32:29,388 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:29,388 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:29,388 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:29,388 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:29,388 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:29,389 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:29,389 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:29,389 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:29,389 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:29,389 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:29,390 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:29,390 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:29,390 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:32:29,390 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:29,390 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((((0 < s || !(1 == \valid[s])) || unknown-#length-unknown[s] < 1) || s < 0) || !(0 == \old(unknown-#memory_int-unknown)[s][unknown-#length-unknown[s] + -1])) || ((((\exists main_~length1~5 : int, v_main_~nondetString1~5.offset_BEFORE_CALL_2 : int :: ((main_~length1~5 + v_main_~nondetString1~5.offset_BEFORE_CALL_2 <= unknown-#length-unknown[p] && 0 == unknown-#memory_int-unknown[p][main_~length1~5 + v_main_~nondetString1~5.offset_BEFORE_CALL_2 + -1]) && 1 <= main_~length1~5) && p <= v_main_~nondetString1~5.offset_BEFORE_CALL_2) && (\exists v_main_~nondetString1~5.offset_BEFORE_CALL_4 : int :: ((0 <= v_main_~nondetString1~5.offset_BEFORE_CALL_4 && 0 == unknown-#memory_int-unknown[p][unknown-#length-unknown[p] + v_main_~nondetString1~5.offset_BEFORE_CALL_4 + -1]) && v_main_~nondetString1~5.offset_BEFORE_CALL_4 <= 0) && v_main_~nondetString1~5.offset_BEFORE_CALL_4 <= p)) && (\exists v_main_~nondetString1~5.offset_BEFORE_CALL_4 : int :: ((v_main_~nondetString1~5.offset_BEFORE_CALL_4 <= s && 0 <= v_main_~nondetString1~5.offset_BEFORE_CALL_4) && 0 == unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + v_main_~nondetString1~5.offset_BEFORE_CALL_4 + -1]) && v_main_~nondetString1~5.offset_BEFORE_CALL_4 <= 0)) && 1 == \valid[p])) && ((((!(1 == \valid[s]) || unknown-#length-unknown[s] < 1) || !(\old(unknown-#memory_int-unknown)[s][s] == 0)) || !(0 == s)) || ((((0 == unknown-#memory_int-unknown[p][p] && 1 == \valid[p]) && 0 == unknown-#memory_int-unknown[s][s]) && (\exists main_~length1~5 : int, v_main_~nondetString1~5.offset_BEFORE_CALL_2 : int :: ((main_~length1~5 + v_main_~nondetString1~5.offset_BEFORE_CALL_2 <= unknown-#length-unknown[p] && 0 == unknown-#memory_int-unknown[p][main_~length1~5 + v_main_~nondetString1~5.offset_BEFORE_CALL_2 + -1]) && 1 <= main_~length1~5) && p <= v_main_~nondetString1~5.offset_BEFORE_CALL_2)) && p == 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 40 locations, 9 error locations. SAFE Result, 19.7s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 3.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 242 SDtfs, 484 SDslu, 881 SDs, 0 SdLazy, 847 SolverSat, 162 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 444 GetRequests, 245 SyntacticMatches, 22 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1769 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 10.2s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 72 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 16 NumberOfFragments, 319 HoareAnnotationTreeSize, 9 FomulaSimplifications, 401 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 1015 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 343 NumberOfCodeBlocks, 343 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 488 ConstructedInterpolants, 71 QuantifiedInterpolants, 203282 SizeOfPredicates, 73 NumberOfNonLiveVariables, 712 ConjunctsInSsa, 198 ConjunctsInUnsatCore, 21 InterpolantComputations, 6 PerfectInterpolantSequences, 22/182 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/strreplace-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_05-32-29-396.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/strreplace-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_05-32-29-396.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/strreplace-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_05-32-29-396.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/strreplace-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-25_05-32-29-396.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/strreplace-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-25_05-32-29-396.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/strreplace-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_05-32-29-396.csv Received shutdown request...