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_preciseopt.epf -i ../../../trunk/examples/svcomp/array-memsafety/rec_strlen-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 02:47:44,143 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 02:47:44,148 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 02:47:44,169 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 02:47:44,169 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 02:47:44,170 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 02:47:44,172 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 02:47:44,182 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 02:47:44,184 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 02:47:44,185 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 02:47:44,186 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 02:47:44,187 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 02:47:44,188 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 02:47:44,189 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 02:47:44,190 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 02:47:44,193 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 02:47:44,195 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 02:47:44,198 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 02:47:44,199 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 02:47:44,201 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 02:47:44,203 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 02:47:44,204 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 02:47:44,204 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 02:47:44,205 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 02:47:44,206 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 02:47:44,208 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 02:47:44,208 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 02:47:44,209 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 02:47:44,209 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 02:47:44,209 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 02:47:44,210 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 02:47:44,210 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_preciseopt.epf [2018-01-25 02:47:44,221 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 02:47:44,221 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 02:47:44,222 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 02:47:44,222 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 02:47:44,222 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 02:47:44,222 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 02:47:44,223 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-25 02:47:44,223 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 02:47:44,223 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 02:47:44,223 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 02:47:44,223 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 02:47:44,224 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 02:47:44,224 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 02:47:44,224 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 02:47:44,224 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 02:47:44,224 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 02:47:44,224 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 02:47:44,225 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 02:47:44,225 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 02:47:44,225 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 02:47:44,225 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 02:47:44,225 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 02:47:44,225 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 02:47:44,226 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 02:47:44,226 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 02:47:44,226 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 02:47:44,226 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 02:47:44,226 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 02:47:44,227 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 02:47:44,227 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 02:47:44,227 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 02:47:44,227 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 02:47:44,227 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 02:47:44,227 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 02:47:44,227 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 02:47:44,228 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 02:47:44,228 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 02:47:44,263 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 02:47:44,276 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 02:47:44,282 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 02:47:44,287 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 02:47:44,287 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 02:47:44,288 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/rec_strlen-alloca_true-valid-memsafety_true-termination.i [2018-01-25 02:47:44,507 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 02:47:44,514 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 02:47:44,515 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 02:47:44,515 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 02:47:44,526 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 02:47:44,528 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 02:47:44" (1/1) ... [2018-01-25 02:47:44,532 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@119836e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:47:44, skipping insertion in model container [2018-01-25 02:47:44,532 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 02:47:44" (1/1) ... [2018-01-25 02:47:44,568 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 02:47:44,609 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 02:47:44,736 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 02:47:44,754 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 02:47:44,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:47:44 WrapperNode [2018-01-25 02:47:44,763 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 02:47:44,764 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 02:47:44,764 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 02:47:44,764 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 02:47:44,783 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:47:44" (1/1) ... [2018-01-25 02:47:44,783 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:47:44" (1/1) ... [2018-01-25 02:47:44,794 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:47:44" (1/1) ... [2018-01-25 02:47:44,794 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:47:44" (1/1) ... [2018-01-25 02:47:44,797 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:47:44" (1/1) ... [2018-01-25 02:47:44,799 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:47:44" (1/1) ... [2018-01-25 02:47:44,799 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:47:44" (1/1) ... [2018-01-25 02:47:44,801 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 02:47:44,801 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 02:47:44,801 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 02:47:44,802 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 02:47:44,802 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:47:44" (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 02:47:44,857 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 02:47:44,857 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 02:47:44,857 INFO L136 BoogieDeclarations]: Found implementation of procedure strlen_rec [2018-01-25 02:47:44,857 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 02:47:44,858 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 02:47:44,858 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 02:47:44,858 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 02:47:44,858 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 02:47:44,858 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 02:47:44,858 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 02:47:44,859 INFO L128 BoogieDeclarations]: Found specification of procedure strlen_rec [2018-01-25 02:47:44,859 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 02:47:44,859 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 02:47:44,859 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 02:47:45,021 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 02:47:45,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 02:47:45 BoogieIcfgContainer [2018-01-25 02:47:45,022 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 02:47:45,022 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 02:47:45,023 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 02:47:45,025 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 02:47:45,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 02:47:44" (1/3) ... [2018-01-25 02:47:45,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c52d229 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 02:47:45, skipping insertion in model container [2018-01-25 02:47:45,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:47:44" (2/3) ... [2018-01-25 02:47:45,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c52d229 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 02:47:45, skipping insertion in model container [2018-01-25 02:47:45,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 02:47:45" (3/3) ... [2018-01-25 02:47:45,028 INFO L105 eAbstractionObserver]: Analyzing ICFG rec_strlen-alloca_true-valid-memsafety_true-termination.i [2018-01-25 02:47:45,035 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 02:47:45,041 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-01-25 02:47:45,090 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 02:47:45,091 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 02:47:45,091 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 02:47:45,091 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 02:47:45,091 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 02:47:45,091 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 02:47:45,091 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 02:47:45,092 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 02:47:45,092 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 02:47:45,118 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-01-25 02:47:45,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-25 02:47:45,125 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:47:45,126 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:47:45,127 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, strlen_recErr1RequiresViolation, strlen_recErr0RequiresViolation]=== [2018-01-25 02:47:45,132 INFO L82 PathProgramCache]: Analyzing trace with hash -407257815, now seen corresponding path program 1 times [2018-01-25 02:47:45,135 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:47:45,200 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:47:45,200 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:47:45,200 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:47:45,200 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:47:45,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:47:45,278 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:47:45,538 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 02:47:45,542 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:47:45,542 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 02:47:45,542 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:47:45,546 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 02:47:45,562 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 02:47:45,563 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:47:45,566 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 5 states. [2018-01-25 02:47:45,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:47:45,772 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2018-01-25 02:47:45,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:47:45,774 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-01-25 02:47:45,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:47:45,787 INFO L225 Difference]: With dead ends: 30 [2018-01-25 02:47:45,787 INFO L226 Difference]: Without dead ends: 26 [2018-01-25 02:47:45,791 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:47:45,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-01-25 02:47:45,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-01-25 02:47:45,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-01-25 02:47:45,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-01-25 02:47:45,835 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 10 [2018-01-25 02:47:45,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:47:45,835 INFO L432 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-01-25 02:47:45,835 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 02:47:45,835 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-01-25 02:47:45,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-25 02:47:45,836 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:47:45,836 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:47:45,836 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, strlen_recErr1RequiresViolation, strlen_recErr0RequiresViolation]=== [2018-01-25 02:47:45,836 INFO L82 PathProgramCache]: Analyzing trace with hash -407257816, now seen corresponding path program 1 times [2018-01-25 02:47:45,836 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:47:45,837 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:47:45,837 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:47:45,838 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:47:45,838 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:47:45,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:47:45,850 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:47:45,880 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 02:47:45,881 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:47:45,881 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 02:47:45,881 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:47:45,883 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 02:47:45,884 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 02:47:45,884 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 02:47:45,884 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 4 states. [2018-01-25 02:47:45,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:47:45,947 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2018-01-25 02:47:45,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 02:47:45,947 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-01-25 02:47:45,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:47:45,948 INFO L225 Difference]: With dead ends: 26 [2018-01-25 02:47:45,948 INFO L226 Difference]: Without dead ends: 25 [2018-01-25 02:47:45,950 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 02:47:45,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-01-25 02:47:45,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-01-25 02:47:45,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-01-25 02:47:45,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-01-25 02:47:45,955 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 10 [2018-01-25 02:47:45,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:47:45,956 INFO L432 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-01-25 02:47:45,956 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 02:47:45,956 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-01-25 02:47:45,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 02:47:45,956 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:47:45,956 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:47:45,957 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, strlen_recErr1RequiresViolation, strlen_recErr0RequiresViolation]=== [2018-01-25 02:47:45,957 INFO L82 PathProgramCache]: Analyzing trace with hash 665022209, now seen corresponding path program 1 times [2018-01-25 02:47:45,957 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:47:45,958 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:47:45,958 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:47:45,959 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:47:45,959 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:47:45,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:47:45,974 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:47:46,032 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 02:47:46,032 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:47:46,032 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 02:47:46,032 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:47:46,033 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 02:47:46,033 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 02:47:46,033 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:47:46,034 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 5 states. [2018-01-25 02:47:46,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:47:46,088 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-01-25 02:47:46,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 02:47:46,089 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-01-25 02:47:46,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:47:46,089 INFO L225 Difference]: With dead ends: 25 [2018-01-25 02:47:46,090 INFO L226 Difference]: Without dead ends: 24 [2018-01-25 02:47:46,090 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 02:47:46,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-01-25 02:47:46,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-01-25 02:47:46,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-01-25 02:47:46,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-01-25 02:47:46,094 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 13 [2018-01-25 02:47:46,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:47:46,094 INFO L432 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-01-25 02:47:46,094 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 02:47:46,095 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-01-25 02:47:46,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 02:47:46,095 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:47:46,095 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:47:46,095 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, strlen_recErr1RequiresViolation, strlen_recErr0RequiresViolation]=== [2018-01-25 02:47:46,095 INFO L82 PathProgramCache]: Analyzing trace with hash 665022210, now seen corresponding path program 1 times [2018-01-25 02:47:46,095 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:47:46,096 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:47:46,096 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:47:46,096 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:47:46,097 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:47:46,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:47:46,110 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:47:46,210 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 02:47:46,210 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:47:46,210 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 02:47:46,210 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:47:46,210 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 02:47:46,211 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 02:47:46,211 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-25 02:47:46,211 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 8 states. [2018-01-25 02:47:46,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:47:46,370 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-01-25 02:47:46,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 02:47:46,371 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-01-25 02:47:46,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:47:46,372 INFO L225 Difference]: With dead ends: 32 [2018-01-25 02:47:46,372 INFO L226 Difference]: Without dead ends: 31 [2018-01-25 02:47:46,373 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 02:47:46,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-01-25 02:47:46,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-01-25 02:47:46,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-01-25 02:47:46,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-01-25 02:47:46,378 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 13 [2018-01-25 02:47:46,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:47:46,379 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-01-25 02:47:46,379 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 02:47:46,379 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-01-25 02:47:46,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 02:47:46,379 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:47:46,380 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:47:46,380 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, strlen_recErr1RequiresViolation, strlen_recErr0RequiresViolation]=== [2018-01-25 02:47:46,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1167971539, now seen corresponding path program 1 times [2018-01-25 02:47:46,380 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:47:46,381 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:47:46,381 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:47:46,381 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:47:46,381 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:47:46,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:47:46,399 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:47:46,649 WARN L146 SmtUtils]: Spent 155ms on a formula simplification. DAG size of input: 19 DAG size of output 10 [2018-01-25 02:47:46,909 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 02:47:46,910 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:47:46,910 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 02:47:46,910 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:47:46,911 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 02:47:46,911 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 02:47:46,911 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-25 02:47:46,912 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 9 states. [2018-01-25 02:47:47,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:47:47,107 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2018-01-25 02:47:47,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 02:47:47,107 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-01-25 02:47:47,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:47:47,108 INFO L225 Difference]: With dead ends: 62 [2018-01-25 02:47:47,108 INFO L226 Difference]: Without dead ends: 45 [2018-01-25 02:47:47,109 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-01-25 02:47:47,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-25 02:47:47,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2018-01-25 02:47:47,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-25 02:47:47,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-01-25 02:47:47,119 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 17 [2018-01-25 02:47:47,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:47:47,119 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-01-25 02:47:47,119 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 02:47:47,119 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-01-25 02:47:47,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 02:47:47,120 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:47:47,120 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:47:47,120 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, strlen_recErr1RequiresViolation, strlen_recErr0RequiresViolation]=== [2018-01-25 02:47:47,121 INFO L82 PathProgramCache]: Analyzing trace with hash -466906961, now seen corresponding path program 1 times [2018-01-25 02:47:47,121 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:47:47,121 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:47:47,122 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:47:47,122 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:47:47,122 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:47:47,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:47:47,136 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:47:47,327 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 02:47:47,327 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:47:47,328 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 02:47:47,328 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 18 with the following transitions: [2018-01-25 02:47:47,330 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [10], [12], [13], [14], [23], [24], [26], [30], [34], [35], [36], [38], [40] [2018-01-25 02:47:47,382 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 02:47:47,382 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 02:47:51,574 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 02:47:51,576 INFO L268 AbstractInterpreter]: Visited 16 different actions 31 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 16 variables. [2018-01-25 02:47:51,621 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 02:47:51,622 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:47:51,622 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 02:47:51,640 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:47:51,641 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:47:51,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:47:51,683 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:47:51,736 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 02:47:51,740 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 02:47:51,740 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:47:51,743 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:47:51,750 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 02:47:51,751 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-25 02:47:51,903 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 02:47:51,922 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 02:47:51,923 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 02:47:51,936 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 02:47:51,967 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 02:47:51,967 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-01-25 02:47:52,143 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 02:47:52,143 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:47:52,524 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 02:47:52,525 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:47:52,538 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 02:47:52,566 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 02:47:52,567 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 02:47:52,569 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:47:52,577 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 02:47:52,578 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-01-25 02:47:52,585 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 02:47:52,611 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:47:52,612 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 02:47:52,615 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:47:52,615 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:47:52,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:47:52,654 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:47:52,666 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 02:47:52,667 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:47:52,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:47:52,674 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-25 02:47:52,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 02:47:52,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-25 02:47:52,728 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:47:52,730 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:47:52,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:47:52,741 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-25 02:47:52,947 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 02:47:52,958 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 17 [2018-01-25 02:47:52,959 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 02:47:52,976 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 02:47:52,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 02:47:52,992 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:31 [2018-01-25 02:47:53,071 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 02:47:53,071 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:47:53,151 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 02:47:53,161 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 02:47:53,161 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:47:53,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:47:53,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:47:53,168 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-01-25 02:47:53,253 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 02:47:53,255 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 02:47:53,255 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9, 11, 11] total 34 [2018-01-25 02:47:53,255 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 02:47:53,256 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-25 02:47:53,256 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-25 02:47:53,257 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1062, Unknown=0, NotChecked=0, Total=1190 [2018-01-25 02:47:53,257 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 17 states. [2018-01-25 02:47:53,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:47:53,733 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-01-25 02:47:53,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-25 02:47:53,734 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2018-01-25 02:47:53,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:47:53,737 INFO L225 Difference]: With dead ends: 50 [2018-01-25 02:47:53,737 INFO L226 Difference]: Without dead ends: 49 [2018-01-25 02:47:53,738 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 38 SyntacticMatches, 6 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=221, Invalid=1585, Unknown=0, NotChecked=0, Total=1806 [2018-01-25 02:47:53,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-25 02:47:53,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-01-25 02:47:53,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-25 02:47:53,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-01-25 02:47:53,747 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 17 [2018-01-25 02:47:53,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:47:53,747 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-01-25 02:47:53,747 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-25 02:47:53,747 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-01-25 02:47:53,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-25 02:47:53,748 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:47:53,748 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:47:53,748 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, strlen_recErr1RequiresViolation, strlen_recErr0RequiresViolation]=== [2018-01-25 02:47:53,749 INFO L82 PathProgramCache]: Analyzing trace with hash -847794598, now seen corresponding path program 2 times [2018-01-25 02:47:53,749 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:47:53,749 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:47:53,750 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:47:53,750 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:47:53,750 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:47:53,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:47:53,767 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:47:54,113 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:47:54,113 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:47:54,113 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 02:47:54,114 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 02:47:54,114 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 02:47:54,114 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:47:54,114 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 02:47:54,137 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 02:47:54,138 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 02:47:54,148 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 02:47:54,153 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 02:47:54,156 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 02:47:54,159 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:47:54,189 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 02:47:54,194 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 02:47:54,195 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:47:54,197 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:47:54,203 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 02:47:54,204 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-25 02:47:55,135 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 28 treesize of output 22 [2018-01-25 02:47:55,148 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:47:55,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 31 [2018-01-25 02:47:55,168 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 02:47:55,196 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 02:47:55,294 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 02:47:55,295 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:43 [2018-01-25 02:47:55,411 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:47:55,411 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:47:55,824 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 02:47:55,824 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:47:55,843 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 02:47:55,862 INFO L682 Elim1Store]: detected equality via solver [2018-01-25 02:47:55,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-25 02:47:55,864 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 02:47:55,868 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:47:55,875 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 02:47:55,876 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:50, output treesize:10 [2018-01-25 02:47:55,895 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:47:55,917 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:47:55,917 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 02:47:55,920 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 02:47:55,920 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 02:47:55,931 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 02:47:55,942 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 02:47:55,955 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 02:47:55,960 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:47:55,964 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 02:47:55,965 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:47:55,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:47:55,968 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 02:47:55,982 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 02:47:55,985 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 02:47:55,985 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:47:55,987 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:47:55,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:47:55,988 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-25 02:47:56,192 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 02:47:56,198 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 02:47:56,199 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 02:47:56,201 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 02:47:56,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 02:47:56,207 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2018-01-25 02:47:56,249 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:47:56,249 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:47:56,598 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 02:47:56,607 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 02:47:56,607 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:47:56,609 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:47:56,615 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 02:47:56,616 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:35 [2018-01-25 02:47:56,716 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:47:56,718 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 02:47:56,718 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13, 13, 13] total 46 [2018-01-25 02:47:56,718 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 02:47:56,719 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-25 02:47:56,719 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-25 02:47:56,720 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=2005, Unknown=1, NotChecked=0, Total=2162 [2018-01-25 02:47:56,720 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 22 states. [2018-01-25 02:48:02,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:48:02,097 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2018-01-25 02:48:02,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-25 02:48:02,097 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2018-01-25 02:48:02,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:48:02,098 INFO L225 Difference]: With dead ends: 56 [2018-01-25 02:48:02,098 INFO L226 Difference]: Without dead ends: 55 [2018-01-25 02:48:02,100 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 683 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=424, Invalid=3735, Unknown=1, NotChecked=0, Total=4160 [2018-01-25 02:48:02,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-25 02:48:02,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 46. [2018-01-25 02:48:02,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-25 02:48:02,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-01-25 02:48:02,107 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 21 [2018-01-25 02:48:02,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:48:02,108 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-01-25 02:48:02,108 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-25 02:48:02,108 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-01-25 02:48:02,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 02:48:02,108 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:48:02,108 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:48:02,109 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, strlen_recErr1RequiresViolation, strlen_recErr0RequiresViolation]=== [2018-01-25 02:48:02,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1711563014, now seen corresponding path program 1 times [2018-01-25 02:48:02,109 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:48:02,110 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:48:02,110 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 02:48:02,110 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:48:02,110 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:48:02,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:48:02,120 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:48:02,157 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 02:48:02,157 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:48:02,157 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 02:48:02,157 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:48:02,158 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 02:48:02,158 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 02:48:02,158 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 02:48:02,158 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 4 states. [2018-01-25 02:48:02,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:48:02,195 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2018-01-25 02:48:02,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 02:48:02,195 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-01-25 02:48:02,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:48:02,196 INFO L225 Difference]: With dead ends: 46 [2018-01-25 02:48:02,196 INFO L226 Difference]: Without dead ends: 0 [2018-01-25 02:48:02,196 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 02:48:02,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-25 02:48:02,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-25 02:48:02,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-25 02:48:02,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-25 02:48:02,197 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2018-01-25 02:48:02,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:48:02,197 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-25 02:48:02,197 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 02:48:02,197 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-25 02:48:02,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-25 02:48:02,201 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-25 02:48:03,191 WARN L146 SmtUtils]: Spent 894ms on a formula simplification. DAG size of input: 130 DAG size of output 93 [2018-01-25 02:48:03,238 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 554) no Hoare annotation was computed. [2018-01-25 02:48:03,239 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 554) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 02:48:03,239 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 554) no Hoare annotation was computed. [2018-01-25 02:48:03,239 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 554) the Hoare annotation is: true [2018-01-25 02:48:03,239 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 554) no Hoare annotation was computed. [2018-01-25 02:48:03,239 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 554) the Hoare annotation is: true [2018-01-25 02:48:03,239 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 554) no Hoare annotation was computed. [2018-01-25 02:48:03,239 INFO L401 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 554) no Hoare annotation was computed. [2018-01-25 02:48:03,239 INFO L401 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-01-25 02:48:03,239 INFO L401 ceAbstractionStarter]: For program point L552(line 552) no Hoare annotation was computed. [2018-01-25 02:48:03,239 INFO L401 ceAbstractionStarter]: For program point L551'(line 551) no Hoare annotation was computed. [2018-01-25 02:48:03,239 INFO L401 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-01-25 02:48:03,240 INFO L397 ceAbstractionStarter]: At program point L552'(line 552) the Hoare annotation is: (let ((.cse0 (select |#length| main_~nondetString1~3.base))) (and (= main_~length1~3 .cse0) (= 1 (select |#valid| |main_#t~malloc3.base|)) (= |old(#valid)| (store |#valid| |main_#t~malloc3.base| 0)) (= 1 (select |#valid| main_~nondetString1~3.base)) (= 0 |main_#t~malloc3.offset|) (exists ((main_~length1~3 Int)) (and (<= (+ main_~length1~3 main_~nondetString1~3.offset) (select |#length| main_~nondetString1~3.base)) (<= 1 main_~length1~3) (= 0 (select (select |#memory_int| main_~nondetString1~3.base) (+ main_~length1~3 main_~nondetString1~3.offset (- 1)))))) (= 0 main_~nondetString1~3.offset) (let ((.cse1 (+ main_~nondetString1~3.offset .cse0))) (or (= 0 (select (select |#memory_int| main_~nondetString1~3.base) 1)) (<= 3 .cse1) (<= .cse1 1))) (= main_~length1~3 (select |#length| |main_#t~malloc3.base|)))) [2018-01-25 02:48:03,240 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 546 554) no Hoare annotation was computed. [2018-01-25 02:48:03,240 INFO L401 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 546 554) no Hoare annotation was computed. [2018-01-25 02:48:03,240 INFO L401 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 554) no Hoare annotation was computed. [2018-01-25 02:48:03,240 INFO L401 ceAbstractionStarter]: For program point L548(lines 548 550) no Hoare annotation was computed. [2018-01-25 02:48:03,240 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 546 554) no Hoare annotation was computed. [2018-01-25 02:48:03,240 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 546 554) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 02:48:03,240 INFO L401 ceAbstractionStarter]: For program point L551''(line 551) no Hoare annotation was computed. [2018-01-25 02:48:03,240 INFO L401 ceAbstractionStarter]: For program point L548''(lines 548 550) no Hoare annotation was computed. [2018-01-25 02:48:03,240 INFO L401 ceAbstractionStarter]: For program point strlen_recFINAL(lines 540 545) no Hoare annotation was computed. [2018-01-25 02:48:03,240 INFO L401 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-01-25 02:48:03,240 INFO L401 ceAbstractionStarter]: For program point L541'(line 541) no Hoare annotation was computed. [2018-01-25 02:48:03,241 INFO L401 ceAbstractionStarter]: For program point strlen_recErr1RequiresViolation(lines 1 554) no Hoare annotation was computed. [2018-01-25 02:48:03,241 INFO L404 ceAbstractionStarter]: At program point strlen_recENTRY(lines 540 545) the Hoare annotation is: true [2018-01-25 02:48:03,241 INFO L401 ceAbstractionStarter]: For program point strlen_recErr0RequiresViolation(lines 1 554) no Hoare annotation was computed. [2018-01-25 02:48:03,241 INFO L401 ceAbstractionStarter]: For program point L544'(line 544) no Hoare annotation was computed. [2018-01-25 02:48:03,241 INFO L397 ceAbstractionStarter]: At program point L544(line 544) the Hoare annotation is: (let ((.cse9 (select |#memory_int| strlen_rec_~p.base)) (.cse5 (select |#memory_int| |strlen_rec_#in~p.base|))) (let ((.cse0 (not (exists ((main_~length1~3 Int) (v_main_~nondetString1~3.offset_BEFORE_CALL_4 Int)) (and (<= |strlen_rec_#in~p.offset| (+ v_main_~nondetString1~3.offset_BEFORE_CALL_4 1)) (<= (+ main_~length1~3 v_main_~nondetString1~3.offset_BEFORE_CALL_4) (select |#length| |strlen_rec_#in~p.base|)) (<= 1 main_~length1~3) (= 0 (select (select |#memory_int| |strlen_rec_#in~p.base|) (+ main_~length1~3 v_main_~nondetString1~3.offset_BEFORE_CALL_4 (- 1)))))))) (.cse2 (= (select .cse5 (+ |strlen_rec_#in~p.offset| (- 1))) 0)) (.cse1 (not (= (select |#valid| |strlen_rec_#in~p.base|) 1))) (.cse7 (not (= (select .cse9 strlen_rec_~p.offset) 0))) (.cse8 (= 1 (select |#valid| strlen_rec_~p.base))) (.cse3 (let ((.cse10 (select |#length| |strlen_rec_#in~p.base|))) (and (< .cse10 3) (not (= 0 (select .cse5 1))) (< 1 .cse10)))) (.cse4 (not (= 0 |strlen_rec_#in~p.offset|))) (.cse6 (not (exists ((main_~length1~3 Int) (v_main_~nondetString1~3.offset_BEFORE_CALL_2 Int)) (and (<= |strlen_rec_#in~p.offset| v_main_~nondetString1~3.offset_BEFORE_CALL_2) (<= (+ main_~length1~3 v_main_~nondetString1~3.offset_BEFORE_CALL_2) (select |#length| |strlen_rec_#in~p.base|)) (= (select (select |#memory_int| |strlen_rec_#in~p.base|) (+ main_~length1~3 v_main_~nondetString1~3.offset_BEFORE_CALL_2 (- 1))) 0) (<= 1 main_~length1~3)))))) (and (or .cse0 (<= 2 strlen_rec_~p.offset) (< |strlen_rec_#in~p.offset| 2) .cse1 .cse2) (or .cse1 .cse3 .cse4 (not (= 0 (select .cse5 |strlen_rec_#in~p.offset|))) .cse6) (or .cse0 (and (<= 1 strlen_rec_~p.offset) .cse7 .cse8 (not (= (select .cse9 (+ strlen_rec_~p.offset (- 1))) 0)) (exists ((main_~length1~3 Int) (v_main_~nondetString1~3.offset_BEFORE_CALL_4 Int)) (and (<= (+ main_~length1~3 v_main_~nondetString1~3.offset_BEFORE_CALL_4) (select |#length| strlen_rec_~p.base)) (<= strlen_rec_~p.offset (+ v_main_~nondetString1~3.offset_BEFORE_CALL_4 1)) (= 0 (select (select |#memory_int| strlen_rec_~p.base) (+ main_~length1~3 v_main_~nondetString1~3.offset_BEFORE_CALL_4 (- 1)))) (<= 1 main_~length1~3)))) .cse1 (< |strlen_rec_#in~p.offset| 1) .cse2) (or .cse1 (and .cse7 .cse8 (exists ((main_~length1~3 Int) (v_main_~nondetString1~3.offset_BEFORE_CALL_2 Int)) (and (<= (+ main_~length1~3 v_main_~nondetString1~3.offset_BEFORE_CALL_2) (select |#length| strlen_rec_~p.base)) (<= strlen_rec_~p.offset v_main_~nondetString1~3.offset_BEFORE_CALL_2) (= 0 (select (select |#memory_int| strlen_rec_~p.base) (+ main_~length1~3 v_main_~nondetString1~3.offset_BEFORE_CALL_2 (- 1)))) (<= 1 main_~length1~3))) (= strlen_rec_~p.offset 0)) .cse3 .cse4 .cse6)))) [2018-01-25 02:48:03,241 INFO L401 ceAbstractionStarter]: For program point strlen_recEXIT(lines 540 545) no Hoare annotation was computed. [2018-01-25 02:48:03,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 02:48:03 BoogieIcfgContainer [2018-01-25 02:48:03,244 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 02:48:03,245 INFO L168 Benchmark]: Toolchain (without parser) took 18737.43 ms. Allocated memory was 303.6 MB in the beginning and 961.0 MB in the end (delta: 657.5 MB). Free memory was 261.9 MB in the beginning and 901.5 MB in the end (delta: -639.6 MB). Peak memory consumption was 601.5 MB. Max. memory is 5.3 GB. [2018-01-25 02:48:03,245 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 303.6 MB. Free memory is still 267.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 02:48:03,245 INFO L168 Benchmark]: CACSL2BoogieTranslator took 248.94 ms. Allocated memory is still 303.6 MB. Free memory was 260.9 MB in the beginning and 250.8 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-25 02:48:03,246 INFO L168 Benchmark]: Boogie Preprocessor took 37.06 ms. Allocated memory is still 303.6 MB. Free memory was 250.8 MB in the beginning and 249.8 MB in the end (delta: 996.2 kB). Peak memory consumption was 996.2 kB. Max. memory is 5.3 GB. [2018-01-25 02:48:03,246 INFO L168 Benchmark]: RCFGBuilder took 220.61 ms. Allocated memory is still 303.6 MB. Free memory was 249.8 MB in the beginning and 236.0 MB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 5.3 GB. [2018-01-25 02:48:03,246 INFO L168 Benchmark]: TraceAbstraction took 18221.57 ms. Allocated memory was 303.6 MB in the beginning and 961.0 MB in the end (delta: 657.5 MB). Free memory was 236.0 MB in the beginning and 901.5 MB in the end (delta: -665.5 MB). Peak memory consumption was 575.6 MB. Max. memory is 5.3 GB. [2018-01-25 02:48:03,248 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 303.6 MB. Free memory is still 267.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 248.94 ms. Allocated memory is still 303.6 MB. Free memory was 260.9 MB in the beginning and 250.8 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 37.06 ms. Allocated memory is still 303.6 MB. Free memory was 250.8 MB in the beginning and 249.8 MB in the end (delta: 996.2 kB). Peak memory consumption was 996.2 kB. Max. memory is 5.3 GB. * RCFGBuilder took 220.61 ms. Allocated memory is still 303.6 MB. Free memory was 249.8 MB in the beginning and 236.0 MB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 18221.57 ms. Allocated memory was 303.6 MB in the beginning and 961.0 MB in the end (delta: 657.5 MB). Free memory was 236.0 MB in the beginning and 901.5 MB in the end (delta: -665.5 MB). Peak memory consumption was 575.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 15 LocStat_MAX_WEQGRAPH_SIZE : 4 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 96 LocStat_NO_SUPPORTING_DISEQUALITIES : 14 LocStat_NO_DISJUNCTIONS : -30 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 22 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 35 TransStat_NO_SUPPORTING_DISEQUALITIES : 3 TransStat_NO_DISJUNCTIONS : 23 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.821801 RENAME_VARIABLES(MILLISECONDS) : 0.017470 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.730577 PROJECTAWAY(MILLISECONDS) : 0.965302 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.207934 DISJOIN(MILLISECONDS) : 0.220644 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.039978 ADD_EQUALITY(MILLISECONDS) : 0.018215 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.019083 #CONJOIN_DISJUNCTIVE : 44 #RENAME_VARIABLES : 83 #UNFREEZE : 0 #CONJOIN : 80 #PROJECTAWAY : 66 #ADD_WEAK_EQUALITY : 5 #DISJOIN : 20 #RENAME_VARIABLES_DISJUNCTIVE : 79 #ADD_EQUALITY : 36 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 2 * 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: 546]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 30 locations, 5 error locations. SAFE Result, 18.1s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 6.6s AutomataDifference, 0.0s DeadEndRemovalTime, 1.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 176 SDtfs, 250 SDslu, 704 SDs, 0 SdLazy, 739 SolverSat, 120 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 239 GetRequests, 91 SyntacticMatches, 10 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1131 ImplicationChecksByTransitivity, 6.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 4.2s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 16 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 19 PreInvPairs, 20 NumberOfFragments, 406 HoareAnnotationTreeSize, 19 FomulaSimplifications, 118 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 968 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 197 NumberOfCodeBlocks, 197 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 257 ConstructedInterpolants, 20 QuantifiedInterpolants, 41980 SizeOfPredicates, 47 NumberOfNonLiveVariables, 338 ConjunctsInSsa, 121 ConjunctsInUnsatCore, 16 InterpolantComputations, 6 PerfectInterpolantSequences, 6/52 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/rec_strlen-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_02-48-03-259.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/rec_strlen-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_02-48-03-259.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/rec_strlen-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_02-48-03-259.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/rec_strlen-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_02-48-03-259.csv Received shutdown request...