java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/array-memsafety/rec_strlen-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e [2018-01-31 08:32:18,406 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 08:32:18,408 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 08:32:18,428 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 08:32:18,428 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 08:32:18,429 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 08:32:18,430 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 08:32:18,433 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 08:32:18,436 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 08:32:18,436 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 08:32:18,445 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 08:32:18,446 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 08:32:18,447 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 08:32:18,448 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 08:32:18,449 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 08:32:18,451 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 08:32:18,453 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 08:32:18,455 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 08:32:18,456 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 08:32:18,457 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 08:32:18,459 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 08:32:18,459 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 08:32:18,460 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 08:32:18,460 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 08:32:18,461 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 08:32:18,462 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 08:32:18,463 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 08:32:18,463 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 08:32:18,463 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 08:32:18,464 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 08:32:18,464 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 08:32:18,465 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-31 08:32:18,475 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 08:32:18,475 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 08:32:18,476 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 08:32:18,476 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 08:32:18,476 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 08:32:18,477 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 08:32:18,477 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 08:32:18,477 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 08:32:18,477 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 08:32:18,478 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 08:32:18,478 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 08:32:18,478 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 08:32:18,478 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 08:32:18,478 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 08:32:18,478 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 08:32:18,479 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 08:32:18,479 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 08:32:18,479 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 08:32:18,479 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 08:32:18,479 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 08:32:18,480 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 08:32:18,480 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 08:32:18,480 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 08:32:18,480 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 08:32:18,480 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 08:32:18,481 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 08:32:18,481 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 08:32:18,481 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 08:32:18,481 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 08:32:18,481 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 08:32:18,481 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 08:32:18,482 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 08:32:18,482 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 08:32:18,482 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 08:32:18,524 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 08:32:18,540 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 08:32:18,546 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 08:32:18,548 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 08:32:18,548 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 08:32:18,550 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-31 08:32:18,785 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 08:32:18,796 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-31 08:32:18,797 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 08:32:18,799 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 08:32:18,806 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 08:32:18,807 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:32:18" (1/1) ... [2018-01-31 08:32:18,812 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21155711 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:32:18, skipping insertion in model container [2018-01-31 08:32:18,812 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:32:18" (1/1) ... [2018-01-31 08:32:18,830 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:32:18,884 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:32:19,033 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:32:19,056 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:32:19,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:32:19 WrapperNode [2018-01-31 08:32:19,065 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 08:32:19,065 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 08:32:19,066 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 08:32:19,066 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 08:32:19,077 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:32:19" (1/1) ... [2018-01-31 08:32:19,077 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:32:19" (1/1) ... [2018-01-31 08:32:19,088 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:32:19" (1/1) ... [2018-01-31 08:32:19,088 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:32:19" (1/1) ... [2018-01-31 08:32:19,092 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:32:19" (1/1) ... [2018-01-31 08:32:19,094 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:32:19" (1/1) ... [2018-01-31 08:32:19,095 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:32:19" (1/1) ... [2018-01-31 08:32:19,097 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 08:32:19,097 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 08:32:19,098 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 08:32:19,098 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 08:32:19,099 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:32:19" (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-31 08:32:19,167 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 08:32:19,167 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 08:32:19,167 INFO L136 BoogieDeclarations]: Found implementation of procedure strlen_rec [2018-01-31 08:32:19,167 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 08:32:19,168 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-31 08:32:19,168 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-31 08:32:19,168 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 08:32:19,168 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 08:32:19,168 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 08:32:19,168 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-31 08:32:19,168 INFO L128 BoogieDeclarations]: Found specification of procedure strlen_rec [2018-01-31 08:32:19,169 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 08:32:19,169 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 08:32:19,169 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 08:32:19,544 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 08:32:19,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:32:19 BoogieIcfgContainer [2018-01-31 08:32:19,545 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 08:32:19,546 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 08:32:19,547 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 08:32:19,550 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 08:32:19,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 08:32:18" (1/3) ... [2018-01-31 08:32:19,552 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59e628b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:32:19, skipping insertion in model container [2018-01-31 08:32:19,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:32:19" (2/3) ... [2018-01-31 08:32:19,552 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59e628b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:32:19, skipping insertion in model container [2018-01-31 08:32:19,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:32:19" (3/3) ... [2018-01-31 08:32:19,554 INFO L107 eAbstractionObserver]: Analyzing ICFG rec_strlen-alloca_true-valid-memsafety_true-termination.i [2018-01-31 08:32:19,564 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 08:32:19,570 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-01-31 08:32:19,618 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 08:32:19,618 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 08:32:19,618 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 08:32:19,618 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 08:32:19,618 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 08:32:19,618 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 08:32:19,618 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 08:32:19,619 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 08:32:19,619 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 08:32:19,649 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-01-31 08:32:19,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-31 08:32:19,658 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:32:19,659 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:32:19,659 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, strlen_recErr1RequiresViolation, strlen_recErr0RequiresViolation]=== [2018-01-31 08:32:19,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1646704468, now seen corresponding path program 1 times [2018-01-31 08:32:19,667 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:32:19,667 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:32:19,725 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:32:19,726 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:32:19,726 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:32:19,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:32:19,798 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:32:19,973 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-31 08:32:19,976 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:32:19,976 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 08:32:19,977 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 08:32:19,986 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 08:32:19,987 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 08:32:19,988 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 4 states. [2018-01-31 08:32:20,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:32:20,120 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-01-31 08:32:20,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-31 08:32:20,122 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-31 08:32:20,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:32:20,219 INFO L225 Difference]: With dead ends: 40 [2018-01-31 08:32:20,219 INFO L226 Difference]: Without dead ends: 36 [2018-01-31 08:32:20,223 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:32:20,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-31 08:32:20,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-01-31 08:32:20,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-31 08:32:20,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-01-31 08:32:20,259 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 13 [2018-01-31 08:32:20,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:32:20,260 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-01-31 08:32:20,260 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 08:32:20,260 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-01-31 08:32:20,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-31 08:32:20,261 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:32:20,261 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:32:20,261 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, strlen_recErr1RequiresViolation, strlen_recErr0RequiresViolation]=== [2018-01-31 08:32:20,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1646704469, now seen corresponding path program 1 times [2018-01-31 08:32:20,262 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:32:20,262 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:32:20,263 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:32:20,263 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:32:20,263 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:32:20,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:32:20,290 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:32:20,658 WARN L146 SmtUtils]: Spent 169ms on a formula simplification. DAG size of input: 17 DAG size of output 11 [2018-01-31 08:32:20,660 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-31 08:32:20,661 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:32:20,661 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 08:32:20,664 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 08:32:20,664 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 08:32:20,665 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:32:20,665 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 5 states. [2018-01-31 08:32:20,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:32:20,762 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-01-31 08:32:20,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:32:20,778 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-01-31 08:32:20,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:32:20,779 INFO L225 Difference]: With dead ends: 36 [2018-01-31 08:32:20,780 INFO L226 Difference]: Without dead ends: 35 [2018-01-31 08:32:20,780 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:32:20,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-01-31 08:32:20,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-01-31 08:32:20,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-01-31 08:32:20,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-01-31 08:32:20,787 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 13 [2018-01-31 08:32:20,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:32:20,787 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-01-31 08:32:20,787 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 08:32:20,787 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-01-31 08:32:20,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-31 08:32:20,788 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:32:20,788 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:32:20,788 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, strlen_recErr1RequiresViolation, strlen_recErr0RequiresViolation]=== [2018-01-31 08:32:20,788 INFO L82 PathProgramCache]: Analyzing trace with hash -143631489, now seen corresponding path program 1 times [2018-01-31 08:32:20,789 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:32:20,789 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:32:20,790 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:32:20,790 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:32:20,790 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:32:20,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:32:20,811 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:32:20,890 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-31 08:32:20,891 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:32:20,891 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 08:32:20,893 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 08:32:20,894 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 08:32:20,894 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:32:20,894 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 5 states. [2018-01-31 08:32:21,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:32:21,015 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-01-31 08:32:21,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 08:32:21,016 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-01-31 08:32:21,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:32:21,017 INFO L225 Difference]: With dead ends: 35 [2018-01-31 08:32:21,017 INFO L226 Difference]: Without dead ends: 34 [2018-01-31 08:32:21,017 INFO L554 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-31 08:32:21,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-01-31 08:32:21,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-01-31 08:32:21,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-01-31 08:32:21,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-01-31 08:32:21,023 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 16 [2018-01-31 08:32:21,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:32:21,023 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-01-31 08:32:21,023 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 08:32:21,023 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-01-31 08:32:21,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-31 08:32:21,024 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:32:21,024 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:32:21,024 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, strlen_recErr1RequiresViolation, strlen_recErr0RequiresViolation]=== [2018-01-31 08:32:21,024 INFO L82 PathProgramCache]: Analyzing trace with hash -143631488, now seen corresponding path program 1 times [2018-01-31 08:32:21,025 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:32:21,025 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:32:21,026 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:32:21,026 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:32:21,026 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:32:21,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:32:21,038 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:32:21,318 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-31 08:32:21,319 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:32:21,319 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 08:32:21,319 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 08:32:21,319 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 08:32:21,320 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:32:21,320 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 8 states. [2018-01-31 08:32:21,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:32:21,447 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2018-01-31 08:32:21,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 08:32:21,447 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-01-31 08:32:21,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:32:21,448 INFO L225 Difference]: With dead ends: 47 [2018-01-31 08:32:21,449 INFO L226 Difference]: Without dead ends: 46 [2018-01-31 08:32:21,449 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-31 08:32:21,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-31 08:32:21,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-01-31 08:32:21,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-31 08:32:21,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-01-31 08:32:21,456 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 16 [2018-01-31 08:32:21,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:32:21,457 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-01-31 08:32:21,457 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 08:32:21,457 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-01-31 08:32:21,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-31 08:32:21,458 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:32:21,458 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:32:21,458 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, strlen_recErr1RequiresViolation, strlen_recErr0RequiresViolation]=== [2018-01-31 08:32:21,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1353616950, now seen corresponding path program 1 times [2018-01-31 08:32:21,458 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:32:21,459 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:32:21,460 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:32:21,460 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:32:21,460 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:32:21,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:32:21,481 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:32:21,788 WARN L146 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 15 DAG size of output 7 [2018-01-31 08:32:21,996 WARN L146 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 19 DAG size of output 14 [2018-01-31 08:32:22,083 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-31 08:32:22,083 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:32:22,083 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:32:22,090 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:32:22,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:32:22,114 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:32:22,166 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-31 08:32:22,172 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-31 08:32:22,172 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:32:22,174 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:32:22,179 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-31 08:32:22,180 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-31 08:32:22,347 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-31 08:32:22,377 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-31 08:32:22,377 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 08:32:22,390 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:32:22,414 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-31 08:32:22,415 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-01-31 08:32:22,569 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-31 08:32:22,602 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:32:22,603 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2018-01-31 08:32:22,603 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-31 08:32:22,603 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-31 08:32:22,604 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-01-31 08:32:22,604 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 17 states. [2018-01-31 08:32:23,061 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 54 DAG size of output 38 [2018-01-31 08:32:23,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:32:23,359 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-01-31 08:32:23,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-31 08:32:23,360 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 21 [2018-01-31 08:32:23,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:32:23,362 INFO L225 Difference]: With dead ends: 61 [2018-01-31 08:32:23,363 INFO L226 Difference]: Without dead ends: 60 [2018-01-31 08:32:23,363 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2018-01-31 08:32:23,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-31 08:32:23,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2018-01-31 08:32:23,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-31 08:32:23,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2018-01-31 08:32:23,372 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 21 [2018-01-31 08:32:23,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:32:23,373 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2018-01-31 08:32:23,373 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-31 08:32:23,373 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2018-01-31 08:32:23,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-31 08:32:23,374 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:32:23,374 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:32:23,374 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, strlen_recErr1RequiresViolation, strlen_recErr0RequiresViolation]=== [2018-01-31 08:32:23,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1760453312, now seen corresponding path program 2 times [2018-01-31 08:32:23,374 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:32:23,375 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:32:23,375 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:32:23,376 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:32:23,376 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:32:23,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:32:23,395 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:32:23,709 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:32:23,709 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:32:23,709 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:32:23,721 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:32:23,735 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:32:23,752 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:32:23,759 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:32:23,767 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:32:23,773 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-31 08:32:23,773 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:32:23,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:32:23,776 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 08:32:23,812 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-31 08:32:23,816 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-31 08:32:23,816 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:32:23,818 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:32:23,822 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-31 08:32:23,822 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2018-01-31 08:32:24,084 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-31 08:32:24,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-01-31 08:32:24,095 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 08:32:24,098 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:32:24,111 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-31 08:32:24,111 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:39 [2018-01-31 08:32:24,166 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:32:24,185 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:32:24,186 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 21 [2018-01-31 08:32:24,186 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-31 08:32:24,186 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-31 08:32:24,187 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=412, Unknown=0, NotChecked=0, Total=462 [2018-01-31 08:32:24,187 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 22 states. [2018-01-31 08:32:25,047 WARN L146 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 60 DAG size of output 48 [2018-01-31 08:32:25,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:32:25,541 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2018-01-31 08:32:25,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-31 08:32:25,541 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 26 [2018-01-31 08:32:25,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:32:25,542 INFO L225 Difference]: With dead ends: 62 [2018-01-31 08:32:25,542 INFO L226 Difference]: Without dead ends: 61 [2018-01-31 08:32:25,543 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=170, Invalid=1020, Unknown=0, NotChecked=0, Total=1190 [2018-01-31 08:32:25,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-31 08:32:25,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2018-01-31 08:32:25,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-31 08:32:25,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2018-01-31 08:32:25,555 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 26 [2018-01-31 08:32:25,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:32:25,555 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2018-01-31 08:32:25,555 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-31 08:32:25,556 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-01-31 08:32:25,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-31 08:32:25,556 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:32:25,557 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:32:25,557 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, strlen_recErr1RequiresViolation, strlen_recErr0RequiresViolation]=== [2018-01-31 08:32:25,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1982113330, now seen corresponding path program 1 times [2018-01-31 08:32:25,557 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:32:25,557 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:32:25,558 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:32:25,558 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:32:25,560 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:32:25,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:32:25,589 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:32:25,661 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-31 08:32:25,662 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:32:25,662 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 08:32:25,662 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 08:32:25,662 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 08:32:25,662 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 08:32:25,662 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 4 states. [2018-01-31 08:32:25,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:32:25,703 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-01-31 08:32:25,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 08:32:25,704 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-01-31 08:32:25,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:32:25,704 INFO L225 Difference]: With dead ends: 57 [2018-01-31 08:32:25,704 INFO L226 Difference]: Without dead ends: 0 [2018-01-31 08:32:25,705 INFO L554 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-31 08:32:25,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-31 08:32:25,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-31 08:32:25,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-31 08:32:25,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-31 08:32:25,706 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2018-01-31 08:32:25,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:32:25,706 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-31 08:32:25,706 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 08:32:25,706 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-31 08:32:25,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-31 08:32:25,711 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-31 08:32:26,040 WARN L146 SmtUtils]: Spent 258ms on a formula simplification. DAG size of input: 44 DAG size of output 36 [2018-01-31 08:32:26,749 WARN L146 SmtUtils]: Spent 707ms on a formula simplification. DAG size of input: 98 DAG size of output 57 [2018-01-31 08:32:26,823 INFO L399 ceAbstractionStarter]: For program point L1(lines 1 554) no Hoare annotation was computed. [2018-01-31 08:32:26,823 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 554) no Hoare annotation was computed. [2018-01-31 08:32:26,824 INFO L395 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 554) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-31 08:32:26,824 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 554) no Hoare annotation was computed. [2018-01-31 08:32:26,824 INFO L402 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 554) the Hoare annotation is: true [2018-01-31 08:32:26,824 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 554) no Hoare annotation was computed. [2018-01-31 08:32:26,824 INFO L402 ceAbstractionStarter]: At program point L1(lines 1 554) the Hoare annotation is: true [2018-01-31 08:32:26,824 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 554) no Hoare annotation was computed. [2018-01-31 08:32:26,824 INFO L399 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 554) no Hoare annotation was computed. [2018-01-31 08:32:26,824 INFO L399 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-01-31 08:32:26,824 INFO L399 ceAbstractionStarter]: For program point L552(line 552) no Hoare annotation was computed. [2018-01-31 08:32:26,824 INFO L399 ceAbstractionStarter]: For program point L551'(line 551) no Hoare annotation was computed. [2018-01-31 08:32:26,824 INFO L399 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-01-31 08:32:26,824 INFO L395 ceAbstractionStarter]: At program point L552'(line 552) the Hoare annotation is: (and (= main_~length1~3 (select |#length| main_~nondetString1~3.base)) (= 1 (select |#valid| |main_#t~malloc3.base|)) (= 1 (select |#valid| main_~nondetString1~3.base)) (= 0 |main_#t~malloc3.offset|) (exists ((main_~nondetString1~3.offset Int)) (and (<= main_~nondetString1~3.offset 0) (= (select (select |#memory_int| main_~nondetString1~3.base) (+ main_~nondetString1~3.offset (select |#length| main_~nondetString1~3.base) (- 1))) 0) (<= 0 main_~nondetString1~3.offset))) (= (store |#valid| |main_#t~malloc3.base| (select (store |#valid| |main_#t~malloc3.base| 0) |main_#t~malloc3.base|)) |old(#valid)|) (= 0 main_~nondetString1~3.offset) (<= 1 main_~length1~3) (= main_~length1~3 (select |#length| |main_#t~malloc3.base|))) [2018-01-31 08:32:26,825 INFO L399 ceAbstractionStarter]: For program point L553'(line 553) no Hoare annotation was computed. [2018-01-31 08:32:26,825 INFO L399 ceAbstractionStarter]: For program point mainFINAL(lines 546 554) no Hoare annotation was computed. [2018-01-31 08:32:26,825 INFO L399 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 546 554) no Hoare annotation was computed. [2018-01-31 08:32:26,825 INFO L399 ceAbstractionStarter]: For program point L549(line 549) no Hoare annotation was computed. [2018-01-31 08:32:26,825 INFO L399 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 554) no Hoare annotation was computed. [2018-01-31 08:32:26,825 INFO L399 ceAbstractionStarter]: For program point L548(lines 548 550) no Hoare annotation was computed. [2018-01-31 08:32:26,825 INFO L399 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-01-31 08:32:26,825 INFO L399 ceAbstractionStarter]: For program point mainEXIT(lines 546 554) no Hoare annotation was computed. [2018-01-31 08:32:26,825 INFO L395 ceAbstractionStarter]: At program point mainENTRY(lines 546 554) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-31 08:32:26,825 INFO L399 ceAbstractionStarter]: For program point L551''(line 551) no Hoare annotation was computed. [2018-01-31 08:32:26,825 INFO L399 ceAbstractionStarter]: For program point L547'(line 547) no Hoare annotation was computed. [2018-01-31 08:32:26,825 INFO L399 ceAbstractionStarter]: For program point L548''(lines 548 550) no Hoare annotation was computed. [2018-01-31 08:32:26,825 INFO L399 ceAbstractionStarter]: For program point L544'''(line 544) no Hoare annotation was computed. [2018-01-31 08:32:26,825 INFO L399 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-01-31 08:32:26,826 INFO L399 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-01-31 08:32:26,826 INFO L399 ceAbstractionStarter]: For program point L541'(line 541) no Hoare annotation was computed. [2018-01-31 08:32:26,826 INFO L399 ceAbstractionStarter]: For program point strlen_recErr1RequiresViolation(lines 1 554) no Hoare annotation was computed. [2018-01-31 08:32:26,826 INFO L399 ceAbstractionStarter]: For program point strlen_recErr0RequiresViolation(lines 1 554) no Hoare annotation was computed. [2018-01-31 08:32:26,826 INFO L395 ceAbstractionStarter]: At program point L544(line 544) the Hoare annotation is: (let ((.cse6 (select |#length| |strlen_rec_#in~p.base|))) (let ((.cse0 (< .cse6 (+ |strlen_rec_#in~p.offset| 1))) (.cse4 (exists ((main_~nondetString1~3.offset Int)) (and (<= main_~nondetString1~3.offset 0) (= (select (select |#memory_int| strlen_rec_~p.base) (+ (select |#length| strlen_rec_~p.base) main_~nondetString1~3.offset (- 1))) 0) (<= 0 main_~nondetString1~3.offset)))) (.cse3 (select |#length| strlen_rec_~p.base)) (.cse5 (= 1 (select |#valid| strlen_rec_~p.base))) (.cse1 (not (= (select |#valid| |strlen_rec_#in~p.base|) 1))) (.cse2 (not (exists ((main_~nondetString1~3.offset Int)) (and (<= main_~nondetString1~3.offset 0) (= 0 (select (select |#memory_int| |strlen_rec_#in~p.base|) (+ main_~nondetString1~3.offset (select |#length| |strlen_rec_#in~p.base|) (- 1)))) (<= 0 main_~nondetString1~3.offset)))))) (and (or (<= 2 strlen_rec_~p.offset) .cse0 (< |strlen_rec_#in~p.offset| 2) .cse1 .cse2) (or .cse0 .cse1 .cse2 (< |strlen_rec_#in~p.offset| 1) (and (<= (+ strlen_rec_~p.offset 2) .cse3) (<= 1 strlen_rec_~p.offset) .cse4 .cse5)) (or (and (= strlen_rec_~p.offset 0) .cse4 (<= 2 .cse3) .cse5) .cse1 .cse2 (< .cse6 1) (not (= 0 |strlen_rec_#in~p.offset|)))))) [2018-01-31 08:32:26,826 INFO L399 ceAbstractionStarter]: For program point strlen_recEXIT(lines 540 545) no Hoare annotation was computed. [2018-01-31 08:32:26,826 INFO L399 ceAbstractionStarter]: For program point strlen_recFINAL(lines 540 545) no Hoare annotation was computed. [2018-01-31 08:32:26,826 INFO L399 ceAbstractionStarter]: For program point L541''(line 541) no Hoare annotation was computed. [2018-01-31 08:32:26,826 INFO L402 ceAbstractionStarter]: At program point strlen_recENTRY(lines 540 545) the Hoare annotation is: true [2018-01-31 08:32:26,826 INFO L399 ceAbstractionStarter]: For program point L544'(line 544) no Hoare annotation was computed. [2018-01-31 08:32:26,827 INFO L399 ceAbstractionStarter]: For program point L544''(line 544) no Hoare annotation was computed. [2018-01-31 08:32:26,827 INFO L399 ceAbstractionStarter]: For program point L541'''(line 541) no Hoare annotation was computed. [2018-01-31 08:32:26,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 08:32:26 BoogieIcfgContainer [2018-01-31 08:32:26,831 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-31 08:32:26,832 INFO L168 Benchmark]: Toolchain (without parser) took 8045.72 ms. Allocated memory was 309.3 MB in the beginning and 523.2 MB in the end (delta: 213.9 MB). Free memory was 269.1 MB in the beginning and 386.9 MB in the end (delta: -117.9 MB). Peak memory consumption was 96.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:32:26,833 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 309.3 MB. Free memory is still 275.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 08:32:26,833 INFO L168 Benchmark]: CACSL2BoogieTranslator took 268.15 ms. Allocated memory is still 309.3 MB. Free memory was 268.1 MB in the beginning and 258.0 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-31 08:32:26,833 INFO L168 Benchmark]: Boogie Preprocessor took 31.58 ms. Allocated memory is still 309.3 MB. Free memory was 258.0 MB in the beginning and 257.0 MB in the end (delta: 996.3 kB). Peak memory consumption was 996.3 kB. Max. memory is 5.3 GB. [2018-01-31 08:32:26,834 INFO L168 Benchmark]: RCFGBuilder took 447.65 ms. Allocated memory is still 309.3 MB. Free memory was 257.0 MB in the beginning and 241.7 MB in the end (delta: 15.2 MB). Peak memory consumption was 15.2 MB. Max. memory is 5.3 GB. [2018-01-31 08:32:26,834 INFO L168 Benchmark]: TraceAbstraction took 7284.84 ms. Allocated memory was 309.3 MB in the beginning and 523.2 MB in the end (delta: 213.9 MB). Free memory was 241.7 MB in the beginning and 386.9 MB in the end (delta: -145.2 MB). Peak memory consumption was 68.7 MB. Max. memory is 5.3 GB. [2018-01-31 08:32:26,836 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.18 ms. Allocated memory is still 309.3 MB. Free memory is still 275.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 268.15 ms. Allocated memory is still 309.3 MB. Free memory was 268.1 MB in the beginning and 258.0 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.58 ms. Allocated memory is still 309.3 MB. Free memory was 258.0 MB in the beginning and 257.0 MB in the end (delta: 996.3 kB). Peak memory consumption was 996.3 kB. Max. memory is 5.3 GB. * RCFGBuilder took 447.65 ms. Allocated memory is still 309.3 MB. Free memory was 257.0 MB in the beginning and 241.7 MB in the end (delta: 15.2 MB). Peak memory consumption was 15.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 7284.84 ms. Allocated memory was 309.3 MB in the beginning and 523.2 MB in the end (delta: 213.9 MB). Free memory was 241.7 MB in the beginning and 386.9 MB in the end (delta: -145.2 MB). Peak memory consumption was 68.7 MB. Max. memory is 5.3 GB. * 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, 40 locations, 5 error locations. SAFE Result, 7.2s OverallTime, 7 OverallIterations, 3 TraceHistogramMax, 2.7s AutomataDifference, 0.0s DeadEndRemovalTime, 1.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 242 SDtfs, 443 SDslu, 1067 SDs, 0 SdLazy, 663 SolverSat, 70 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 118 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 13 PreInvPairs, 13 NumberOfFragments, 262 HoareAnnotationTreeSize, 13 FomulaSimplifications, 6 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 646 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 178 NumberOfCodeBlocks, 178 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 169 ConstructedInterpolants, 11 QuantifiedInterpolants, 24447 SizeOfPredicates, 18 NumberOfNonLiveVariables, 174 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 2/22 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/rec_strlen-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-31_08-32-26-846.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_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-31_08-32-26-846.csv Received shutdown request...