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_RubberTaipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrlen-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 12:53:31,758 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 12:53:31,760 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 12:53:31,776 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 12:53:31,776 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 12:53:31,777 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 12:53:31,779 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 12:53:31,780 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 12:53:31,782 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 12:53:31,783 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 12:53:31,784 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 12:53:31,784 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 12:53:31,785 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 12:53:31,787 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 12:53:31,788 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 12:53:31,790 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 12:53:31,792 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 12:53:31,794 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 12:53:31,796 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 12:53:31,797 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 12:53:31,799 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 12:53:31,800 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 12:53:31,800 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 12:53:31,801 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 12:53:31,802 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 12:53:31,804 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 12:53:31,804 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 12:53:31,805 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 12:53:31,805 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 12:53:31,805 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 12:53:31,806 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 12:53:31,806 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf [2018-01-24 12:53:31,814 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 12:53:31,815 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 12:53:31,815 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 12:53:31,816 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 12:53:31,816 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 12:53:31,816 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 12:53:31,816 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 12:53:31,816 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 12:53:31,816 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 12:53:31,817 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 12:53:31,817 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 12:53:31,817 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 12:53:31,817 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 12:53:31,817 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 12:53:31,817 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 12:53:31,817 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 12:53:31,818 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 12:53:31,818 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 12:53:31,818 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 12:53:31,818 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 12:53:31,818 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 12:53:31,818 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 12:53:31,818 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 12:53:31,819 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:53:31,819 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 12:53:31,819 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 12:53:31,819 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 12:53:31,819 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 12:53:31,819 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-01-24 12:53:31,820 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 12:53:31,820 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 12:53:31,820 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 12:53:31,820 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 12:53:31,821 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 12:53:31,853 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 12:53:31,864 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 12:53:31,867 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 12:53:31,869 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 12:53:31,869 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 12:53:31,869 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrlen-alloca_true-valid-memsafety_true-termination.i [2018-01-24 12:53:32,021 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 12:53:32,025 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 12:53:32,026 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 12:53:32,026 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 12:53:32,032 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 12:53:32,033 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:53:32" (1/1) ... [2018-01-24 12:53:32,035 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@647aa831 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:53:32, skipping insertion in model container [2018-01-24 12:53:32,036 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:53:32" (1/1) ... [2018-01-24 12:53:32,049 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:53:32,085 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:53:32,204 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:53:32,221 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:53:32,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:53:32 WrapperNode [2018-01-24 12:53:32,229 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 12:53:32,229 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 12:53:32,230 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 12:53:32,230 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 12:53:32,240 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:53:32" (1/1) ... [2018-01-24 12:53:32,241 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:53:32" (1/1) ... [2018-01-24 12:53:32,249 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:53:32" (1/1) ... [2018-01-24 12:53:32,249 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:53:32" (1/1) ... [2018-01-24 12:53:32,253 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:53:32" (1/1) ... [2018-01-24 12:53:32,256 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:53:32" (1/1) ... [2018-01-24 12:53:32,257 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:53:32" (1/1) ... [2018-01-24 12:53:32,259 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 12:53:32,260 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 12:53:32,260 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 12:53:32,260 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 12:53:32,261 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:53:32" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:53:32,304 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 12:53:32,304 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 12:53:32,305 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrlen [2018-01-24 12:53:32,305 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 12:53:32,305 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 12:53:32,305 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 12:53:32,305 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 12:53:32,305 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 12:53:32,305 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 12:53:32,305 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 12:53:32,305 INFO L128 BoogieDeclarations]: Found specification of procedure cstrlen [2018-01-24 12:53:32,305 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 12:53:32,305 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 12:53:32,306 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 12:53:32,441 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 12:53:32,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:53:32 BoogieIcfgContainer [2018-01-24 12:53:32,442 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 12:53:32,442 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 12:53:32,443 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 12:53:32,445 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 12:53:32,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 12:53:32" (1/3) ... [2018-01-24 12:53:32,446 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29f84bbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:53:32, skipping insertion in model container [2018-01-24 12:53:32,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:53:32" (2/3) ... [2018-01-24 12:53:32,447 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29f84bbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:53:32, skipping insertion in model container [2018-01-24 12:53:32,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:53:32" (3/3) ... [2018-01-24 12:53:32,449 INFO L105 eAbstractionObserver]: Analyzing ICFG openbsd_cstrlen-alloca_true-valid-memsafety_true-termination.i [2018-01-24 12:53:32,455 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 12:53:32,461 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-01-24 12:53:32,495 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 12:53:32,495 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 12:53:32,495 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 12:53:32,496 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 12:53:32,496 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 12:53:32,496 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 12:53:32,496 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 12:53:32,496 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 12:53:32,496 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 12:53:32,513 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-01-24 12:53:32,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-24 12:53:32,519 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:53:32,520 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:53:32,520 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:53:32,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1793434931, now seen corresponding path program 1 times [2018-01-24 12:53:32,526 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:53:32,566 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:53:32,566 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:53:32,566 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:53:32,566 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:53:32,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:53:32,615 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:53:32,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:53:32,709 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:53:32,710 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:53:32,710 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:53:32,713 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:53:32,729 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:53:32,730 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:53:32,733 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 4 states. [2018-01-24 12:53:32,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:53:32,835 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2018-01-24 12:53:32,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:53:32,898 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-01-24 12:53:32,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:53:32,908 INFO L225 Difference]: With dead ends: 42 [2018-01-24 12:53:32,908 INFO L226 Difference]: Without dead ends: 27 [2018-01-24 12:53:32,911 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:53:32,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-01-24 12:53:32,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-01-24 12:53:32,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-01-24 12:53:32,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-01-24 12:53:32,940 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 10 [2018-01-24 12:53:32,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:53:32,940 INFO L432 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-01-24 12:53:32,940 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:53:32,941 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-01-24 12:53:32,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-24 12:53:32,941 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:53:32,941 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:53:32,941 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:53:32,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1793434932, now seen corresponding path program 1 times [2018-01-24 12:53:32,942 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:53:32,943 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:53:32,943 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:53:32,943 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:53:32,943 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:53:32,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:53:32,959 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:53:33,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:53:33,091 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:53:33,091 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:53:33,091 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:53:33,093 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:53:33,093 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:53:33,093 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:53:33,094 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 5 states. [2018-01-24 12:53:33,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:53:33,143 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-01-24 12:53:33,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:53:33,143 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-01-24 12:53:33,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:53:33,144 INFO L225 Difference]: With dead ends: 27 [2018-01-24 12:53:33,144 INFO L226 Difference]: Without dead ends: 26 [2018-01-24 12:53:33,145 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:53:33,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-01-24 12:53:33,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-01-24 12:53:33,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-01-24 12:53:33,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-01-24 12:53:33,150 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 10 [2018-01-24 12:53:33,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:53:33,151 INFO L432 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-01-24 12:53:33,151 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:53:33,151 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-01-24 12:53:33,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 12:53:33,152 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:53:33,152 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:53:33,152 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:53:33,152 INFO L82 PathProgramCache]: Analyzing trace with hash -2006900249, now seen corresponding path program 1 times [2018-01-24 12:53:33,152 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:53:33,153 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:53:33,154 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:53:33,154 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:53:33,154 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:53:33,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:53:33,169 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:53:33,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:53:33,214 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:53:33,214 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:53:33,215 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:53:33,215 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:53:33,215 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:53:33,215 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:53:33,216 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 5 states. [2018-01-24 12:53:33,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:53:33,281 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-01-24 12:53:33,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:53:33,282 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 12:53:33,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:53:33,283 INFO L225 Difference]: With dead ends: 26 [2018-01-24 12:53:33,283 INFO L226 Difference]: Without dead ends: 25 [2018-01-24 12:53:33,283 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:53:33,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-01-24 12:53:33,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-01-24 12:53:33,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-01-24 12:53:33,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-01-24 12:53:33,291 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 14 [2018-01-24 12:53:33,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:53:33,295 INFO L432 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-01-24 12:53:33,295 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:53:33,295 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-01-24 12:53:33,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 12:53:33,296 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:53:33,296 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:53:33,296 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:53:33,297 INFO L82 PathProgramCache]: Analyzing trace with hash -2006900248, now seen corresponding path program 1 times [2018-01-24 12:53:33,297 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:53:33,298 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:53:33,298 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:53:33,298 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:53:33,298 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:53:33,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:53:33,311 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:53:33,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:53:33,396 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:53:33,396 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 12:53:33,396 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:53:33,397 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:53:33,397 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:53:33,397 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:53:33,397 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 8 states. [2018-01-24 12:53:33,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:53:33,558 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-01-24 12:53:33,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 12:53:33,558 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-01-24 12:53:33,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:53:33,561 INFO L225 Difference]: With dead ends: 33 [2018-01-24 12:53:33,561 INFO L226 Difference]: Without dead ends: 32 [2018-01-24 12:53:33,562 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-24 12:53:33,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-01-24 12:53:33,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2018-01-24 12:53:33,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-01-24 12:53:33,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-01-24 12:53:33,568 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 14 [2018-01-24 12:53:33,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:53:33,568 INFO L432 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-01-24 12:53:33,568 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:53:33,569 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-01-24 12:53:33,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 12:53:33,569 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:53:33,569 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:53:33,570 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:53:33,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1301829867, now seen corresponding path program 1 times [2018-01-24 12:53:33,570 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:53:33,571 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:53:33,571 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:53:33,571 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:53:33,571 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:53:33,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:53:33,586 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:53:33,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:53:33,700 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:53:33,700 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 12:53:33,700 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:53:33,700 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 12:53:33,700 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 12:53:33,701 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:53:33,701 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 9 states. [2018-01-24 12:53:33,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:53:33,842 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2018-01-24 12:53:33,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 12:53:33,842 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-01-24 12:53:33,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:53:33,843 INFO L225 Difference]: With dead ends: 56 [2018-01-24 12:53:33,843 INFO L226 Difference]: Without dead ends: 43 [2018-01-24 12:53:33,844 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-01-24 12:53:33,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-01-24 12:53:33,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 38. [2018-01-24 12:53:33,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-24 12:53:33,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-01-24 12:53:33,849 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 18 [2018-01-24 12:53:33,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:53:33,850 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2018-01-24 12:53:33,850 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 12:53:33,850 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-01-24 12:53:33,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 12:53:33,850 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:53:33,851 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:53:33,851 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:53:33,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1559995305, now seen corresponding path program 1 times [2018-01-24 12:53:33,851 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:53:33,852 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:53:33,852 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:53:33,852 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:53:33,852 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:53:33,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:53:33,866 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:53:34,047 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:53:34,047 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:53:34,047 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-24 12:53:34,053 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:53:34,053 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:53:34,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:53:34,081 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:53:34,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-24 12:53:34,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-24 12:53:34,125 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:53:34,127 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:53:34,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:53:34,132 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-24 12:53:34,224 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-24 12:53:34,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-01-24 12:53:34,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 12:53:34,254 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:53:34,266 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-24 12:53:34,266 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-01-24 12:53:34,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:53:34,345 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:53:34,551 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-24 12:53:34,552 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:53:34,560 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-24 12:53:34,571 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-24 12:53:34,571 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:53:34,572 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:53:34,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-24 12:53:34,578 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-01-24 12:53:34,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:53:34,602 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:53:34,603 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-24 12:53:34,607 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:53:34,607 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:53:34,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:53:34,632 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:53:34,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 12:53:34,635 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:53:34,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:53:34,642 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-24 12:53:34,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 12:53:34,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-24 12:53:34,653 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:53:34,655 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:53:34,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:53:34,658 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-24 12:53:34,732 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-24 12:53:34,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 16 [2018-01-24 12:53:34,738 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 12:53:34,743 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:53:34,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:53:34,750 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:30 [2018-01-24 12:53:34,800 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:53:34,800 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:53:34,851 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-24 12:53:34,858 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-24 12:53:34,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:53:34,860 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:53:34,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:53:34,863 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-01-24 12:53:34,912 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:53:34,914 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 12:53:34,914 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8, 10, 10] total 30 [2018-01-24 12:53:34,914 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 12:53:34,915 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-24 12:53:34,915 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-24 12:53:34,915 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=817, Unknown=0, NotChecked=0, Total=930 [2018-01-24 12:53:34,916 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 16 states. [2018-01-24 12:53:36,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:53:36,395 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2018-01-24 12:53:36,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 12:53:36,395 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-01-24 12:53:36,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:53:36,397 INFO L225 Difference]: With dead ends: 51 [2018-01-24 12:53:36,397 INFO L226 Difference]: Without dead ends: 50 [2018-01-24 12:53:36,398 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 45 SyntacticMatches, 6 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=205, Invalid=1277, Unknown=0, NotChecked=0, Total=1482 [2018-01-24 12:53:36,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-24 12:53:36,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2018-01-24 12:53:36,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-24 12:53:36,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2018-01-24 12:53:36,406 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 18 [2018-01-24 12:53:36,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:53:36,406 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2018-01-24 12:53:36,406 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-24 12:53:36,406 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-01-24 12:53:36,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 12:53:36,407 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:53:36,407 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:53:36,407 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:53:36,407 INFO L82 PathProgramCache]: Analyzing trace with hash -968711636, now seen corresponding path program 1 times [2018-01-24 12:53:36,407 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:53:36,408 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:53:36,408 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:53:36,408 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:53:36,408 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:53:36,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:53:36,430 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:53:36,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:53:36,476 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:53:36,477 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:53:36,477 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:53:36,477 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:53:36,477 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:53:36,477 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:53:36,478 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 4 states. [2018-01-24 12:53:36,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:53:36,527 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-01-24 12:53:36,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:53:36,527 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-01-24 12:53:36,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:53:36,528 INFO L225 Difference]: With dead ends: 42 [2018-01-24 12:53:36,528 INFO L226 Difference]: Without dead ends: 23 [2018-01-24 12:53:36,528 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:53:36,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-01-24 12:53:36,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-01-24 12:53:36,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-01-24 12:53:36,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-01-24 12:53:36,532 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 22 [2018-01-24 12:53:36,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:53:36,532 INFO L432 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-01-24 12:53:36,532 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:53:36,532 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-01-24 12:53:36,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 12:53:36,533 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:53:36,533 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:53:36,533 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:53:36,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1772753452, now seen corresponding path program 2 times [2018-01-24 12:53:36,533 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:53:36,534 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:53:36,534 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:53:36,534 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:53:36,534 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:53:36,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:53:36,548 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:53:36,815 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-24 12:53:36,815 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:53:36,844 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-24 12:53:36,849 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:53:36,849 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 12:53:36,858 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:53:36,861 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:53:36,863 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:53:36,865 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:53:36,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 12:53:36,868 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:53:36,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:53:36,870 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 12:53:36,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 12:53:36,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-24 12:53:36,897 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:53:36,898 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:53:36,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:53:36,901 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-01-24 12:53:36,992 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-24 12:53:36,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 12:53:36,998 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 12:53:37,001 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:53:37,010 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-24 12:53:37,010 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:49 [2018-01-24 12:53:37,055 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-24 12:53:37,056 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:53:37,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2018-01-24 12:53:37,364 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-24 12:53:37,364 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:53:37,386 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:53:37,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2018-01-24 12:53:37,441 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-24 12:53:37,441 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:53:37,448 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:53:37,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:53:37,480 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:81, output treesize:98 [2018-01-24 12:53:37,567 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-24 12:53:37,588 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:53:37,588 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-24 12:53:37,591 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:53:37,591 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 12:53:37,602 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:53:37,611 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:53:37,623 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:53:37,627 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:53:37,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 12:53:37,630 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:53:37,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:53:37,633 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 12:53:37,641 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-24 12:53:37,643 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-24 12:53:37,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:53:37,644 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:53:37,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:53:37,646 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-24 12:53:37,779 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-24 12:53:37,784 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-24 12:53:37,784 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 12:53:37,787 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:53:37,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:53:37,792 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2018-01-24 12:53:37,810 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-24 12:53:37,811 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:53:37,972 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-24 12:53:37,980 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-24 12:53:37,981 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:53:37,983 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:53:37,988 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-24 12:53:37,989 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:35 [2018-01-24 12:53:38,060 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-24 12:53:38,062 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 12:53:38,062 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10, 11, 11] total 36 [2018-01-24 12:53:38,062 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 12:53:38,062 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-24 12:53:38,062 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-24 12:53:38,063 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1205, Unknown=0, NotChecked=0, Total=1332 [2018-01-24 12:53:38,063 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 18 states. [2018-01-24 12:53:38,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:53:38,611 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-01-24 12:53:38,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 12:53:38,611 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 22 [2018-01-24 12:53:38,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:53:38,611 INFO L225 Difference]: With dead ends: 25 [2018-01-24 12:53:38,611 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 12:53:38,613 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 57 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=307, Invalid=1855, Unknown=0, NotChecked=0, Total=2162 [2018-01-24 12:53:38,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 12:53:38,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 12:53:38,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 12:53:38,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 12:53:38,613 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2018-01-24 12:53:38,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:53:38,614 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 12:53:38,614 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-24 12:53:38,614 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 12:53:38,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 12:53:38,620 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 12:53:39,721 WARN L146 SmtUtils]: Spent 1055ms on a formula simplification. DAG size of input: 55 DAG size of output 1 [2018-01-24 12:53:39,992 WARN L146 SmtUtils]: Spent 187ms on a formula simplification. DAG size of input: 93 DAG size of output 67 [2018-01-24 12:53:39,996 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 556) no Hoare annotation was computed. [2018-01-24 12:53:39,996 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 556) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 12:53:39,996 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 556) no Hoare annotation was computed. [2018-01-24 12:53:39,996 INFO L404 ceAbstractionStarter]: At program point cstrlenENTRY(lines 540 547) the Hoare annotation is: true [2018-01-24 12:53:39,996 INFO L401 ceAbstractionStarter]: For program point L544'''(lines 544 545) no Hoare annotation was computed. [2018-01-24 12:53:39,996 INFO L401 ceAbstractionStarter]: For program point cstrlenErr1RequiresViolation(lines 1 556) no Hoare annotation was computed. [2018-01-24 12:53:39,996 INFO L401 ceAbstractionStarter]: For program point cstrlenEXIT(lines 540 547) no Hoare annotation was computed. [2018-01-24 12:53:39,997 INFO L397 ceAbstractionStarter]: At program point L544''''(lines 544 545) the Hoare annotation is: (let ((.cse0 (not (= 0 |cstrlen_#in~str.offset|))) (.cse1 (not (= (select |#valid| |cstrlen_#in~str.base|) 1))) (.cse2 (not (exists ((main_~length1~4 Int) (v_main_~nondetString1~4.offset_BEFORE_CALL_1 Int)) (and (<= |cstrlen_#in~str.offset| v_main_~nondetString1~4.offset_BEFORE_CALL_1) (= 0 (select (select |#memory_int| |cstrlen_#in~str.base|) (+ main_~length1~4 v_main_~nondetString1~4.offset_BEFORE_CALL_1 (- 1)))) (<= (+ main_~length1~4 v_main_~nondetString1~4.offset_BEFORE_CALL_1) (select |#length| |cstrlen_#in~str.base|)) (<= 1 main_~length1~4))))) (.cse3 (= 1 (select |#valid| cstrlen_~s~2.base)))) (and (or .cse0 .cse1 (not (= (select (select |#memory_int| |cstrlen_#in~str.base|) |cstrlen_#in~str.offset|) 0)) .cse2 (and (= 0 (select (select |#memory_int| cstrlen_~s~2.base) cstrlen_~s~2.offset)) (= cstrlen_~s~2.offset 0) (<= 1 (select |#length| cstrlen_~s~2.base)) .cse3)) (or .cse0 (not (exists ((v_main_~nondetString1~4.offset_BEFORE_CALL_3 Int)) (and (<= v_main_~nondetString1~4.offset_BEFORE_CALL_3 |cstrlen_#in~str.offset|) (<= 0 v_main_~nondetString1~4.offset_BEFORE_CALL_3) (<= v_main_~nondetString1~4.offset_BEFORE_CALL_3 0) (= 0 (select (select |#memory_int| |cstrlen_#in~str.base|) (+ v_main_~nondetString1~4.offset_BEFORE_CALL_3 (select |#length| |cstrlen_#in~str.base|) (- 1))))))) .cse1 .cse2 (and (exists ((main_~length1~4 Int) (v_main_~nondetString1~4.offset_BEFORE_CALL_1 Int)) (and (<= cstrlen_~s~2.offset v_main_~nondetString1~4.offset_BEFORE_CALL_1) (<= (+ main_~length1~4 v_main_~nondetString1~4.offset_BEFORE_CALL_1) (select |#length| cstrlen_~s~2.base)) (= (select (select |#memory_int| cstrlen_~s~2.base) (+ main_~length1~4 v_main_~nondetString1~4.offset_BEFORE_CALL_1 (- 1))) 0) (<= 1 main_~length1~4))) (exists ((v_main_~nondetString1~4.offset_BEFORE_CALL_3 Int)) (and (= 0 (select (select |#memory_int| cstrlen_~s~2.base) (+ v_main_~nondetString1~4.offset_BEFORE_CALL_3 (select |#length| cstrlen_~s~2.base) (- 1)))) (<= v_main_~nondetString1~4.offset_BEFORE_CALL_3 cstrlen_~s~2.offset) (<= 0 v_main_~nondetString1~4.offset_BEFORE_CALL_3) (<= v_main_~nondetString1~4.offset_BEFORE_CALL_3 0))) .cse3)))) [2018-01-24 12:53:39,997 INFO L401 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-01-24 12:53:39,997 INFO L401 ceAbstractionStarter]: For program point cstrlenErr0RequiresViolation(lines 1 556) no Hoare annotation was computed. [2018-01-24 12:53:39,997 INFO L401 ceAbstractionStarter]: For program point L544'(line 544) no Hoare annotation was computed. [2018-01-24 12:53:39,997 INFO L401 ceAbstractionStarter]: For program point L544'''''(lines 544 545) no Hoare annotation was computed. [2018-01-24 12:53:39,997 INFO L401 ceAbstractionStarter]: For program point cstrlenFINAL(lines 540 547) no Hoare annotation was computed. [2018-01-24 12:53:39,997 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 556) the Hoare annotation is: true [2018-01-24 12:53:39,997 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 556) no Hoare annotation was computed. [2018-01-24 12:53:39,997 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 556) the Hoare annotation is: true [2018-01-24 12:53:39,997 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 556) no Hoare annotation was computed. [2018-01-24 12:53:39,998 INFO L401 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 556) no Hoare annotation was computed. [2018-01-24 12:53:39,998 INFO L401 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-01-24 12:53:39,998 INFO L401 ceAbstractionStarter]: For program point L550(lines 550 552) no Hoare annotation was computed. [2018-01-24 12:53:39,998 INFO L401 ceAbstractionStarter]: For program point L553'(line 553) no Hoare annotation was computed. [2018-01-24 12:53:39,998 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 548 556) no Hoare annotation was computed. [2018-01-24 12:53:39,998 INFO L401 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 548 556) no Hoare annotation was computed. [2018-01-24 12:53:39,998 INFO L401 ceAbstractionStarter]: For program point L555(line 555) no Hoare annotation was computed. [2018-01-24 12:53:39,998 INFO L401 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-01-24 12:53:39,998 INFO L401 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 556) no Hoare annotation was computed. [2018-01-24 12:53:39,998 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 548 556) no Hoare annotation was computed. [2018-01-24 12:53:39,998 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 548 556) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 12:53:39,998 INFO L401 ceAbstractionStarter]: For program point L553''(line 553) no Hoare annotation was computed. [2018-01-24 12:53:39,998 INFO L401 ceAbstractionStarter]: For program point L550''(lines 550 552) no Hoare annotation was computed. [2018-01-24 12:53:39,999 INFO L397 ceAbstractionStarter]: At program point L554'(line 554) the Hoare annotation is: (let ((.cse0 (select |#length| main_~nondetString1~4.base))) (and (= 1 (select |#valid| |main_#t~malloc3.base|)) (= |old(#valid)| (store |#valid| |main_#t~malloc3.base| 0)) (= main_~length1~4 .cse0) (= main_~nondetString1~4.offset 0) (= main_~length1~4 (select |#length| |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|) (= (select (select |#memory_int| main_~nondetString1~4.base) (+ main_~nondetString1~4.offset .cse0 (- 1))) 0) (<= 1 main_~length1~4) (= 1 (select |#valid| main_~nondetString1~4.base)))) [2018-01-24 12:53:40,008 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:53:40,009 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:53:40,009 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:53:40,009 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:53:40,009 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:53:40,009 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:53:40,010 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:53:40,010 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:53:40,010 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:53:40,010 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:53:40,011 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:53:40,011 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:53:40,011 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:53:40,011 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:53:40,011 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:53:40,011 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:53:40,011 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:53:40,012 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:53:40,012 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:53:40,012 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:53:40,012 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:53:40,012 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:53:40,013 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:53:40,013 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:53:40,013 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:53:40,013 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:53:40,014 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:53:40,015 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:53:40,015 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:53:40,015 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:53:40,015 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:53:40,015 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:53:40,016 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:53:40,016 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:53:40,016 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:53:40,016 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:53:40,016 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:53:40,016 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:53:40,017 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:53:40,025 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:53:40,026 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:53:40,026 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:53:40,026 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:53:40,027 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:53:40,027 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:53:40,027 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:53:40,027 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:53:40,028 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:53:40,028 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:53:40,028 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:53:40,028 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:53:40,029 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:53:40,029 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:53:40,029 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:53:40,029 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:53:40,030 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:53:40,030 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:53:40,030 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:53:40,030 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:53:40,030 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:53:40,031 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:53:40,031 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:53:40,031 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:53:40,031 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:53:40,031 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:53:40,032 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:53:40,032 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:53:40,032 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:53:40,032 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:53:40,033 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:53:40,033 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:53:40,033 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:53:40,033 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:53:40,034 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:53:40,034 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:53:40,034 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:53:40,034 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:53:40,035 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:53:40,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 12:53:40 BoogieIcfgContainer [2018-01-24 12:53:40,038 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 12:53:40,039 INFO L168 Benchmark]: Toolchain (without parser) took 8016.91 ms. Allocated memory was 300.9 MB in the beginning and 536.3 MB in the end (delta: 235.4 MB). Free memory was 261.0 MB in the beginning and 414.7 MB in the end (delta: -153.7 MB). Peak memory consumption was 81.7 MB. Max. memory is 5.3 GB. [2018-01-24 12:53:40,040 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 300.9 MB. Free memory is still 267.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 12:53:40,040 INFO L168 Benchmark]: CACSL2BoogieTranslator took 202.96 ms. Allocated memory is still 300.9 MB. Free memory was 260.0 MB in the beginning and 249.9 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-24 12:53:40,041 INFO L168 Benchmark]: Boogie Preprocessor took 29.77 ms. Allocated memory is still 300.9 MB. Free memory was 249.9 MB in the beginning and 248.9 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. [2018-01-24 12:53:40,041 INFO L168 Benchmark]: RCFGBuilder took 182.17 ms. Allocated memory is still 300.9 MB. Free memory was 248.9 MB in the beginning and 234.0 MB in the end (delta: 14.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 5.3 GB. [2018-01-24 12:53:40,041 INFO L168 Benchmark]: TraceAbstraction took 7595.44 ms. Allocated memory was 300.9 MB in the beginning and 536.3 MB in the end (delta: 235.4 MB). Free memory was 234.0 MB in the beginning and 414.7 MB in the end (delta: -180.7 MB). Peak memory consumption was 54.7 MB. Max. memory is 5.3 GB. [2018-01-24 12:53:40,043 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.12 ms. Allocated memory is still 300.9 MB. Free memory is still 267.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 202.96 ms. Allocated memory is still 300.9 MB. Free memory was 260.0 MB in the beginning and 249.9 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 29.77 ms. Allocated memory is still 300.9 MB. Free memory was 249.9 MB in the beginning and 248.9 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. * RCFGBuilder took 182.17 ms. Allocated memory is still 300.9 MB. Free memory was 248.9 MB in the beginning and 234.0 MB in the end (delta: 14.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 7595.44 ms. Allocated memory was 300.9 MB in the beginning and 536.3 MB in the end (delta: 235.4 MB). Free memory was 234.0 MB in the beginning and 414.7 MB in the end (delta: -180.7 MB). Peak memory consumption was 54.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - InvariantResult [Line: 544]: Loop Invariant [2018-01-24 12:53:40,050 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:53:40,050 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:53:40,050 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:53:40,050 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:53:40,051 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:53:40,051 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:53:40,051 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:53:40,051 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:53:40,051 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:53:40,052 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:53:40,052 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:53:40,052 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:53:40,052 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:53:40,052 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:53:40,053 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:53:40,053 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:53:40,053 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:53:40,053 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:53:40,053 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:53:40,054 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:53:40,054 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:53:40,054 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:53:40,054 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:53:40,054 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:53:40,055 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:53:40,055 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:53:40,055 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:53:40,055 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:53:40,055 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:53:40,056 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:53:40,056 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:53:40,056 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:53:40,056 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:53:40,056 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:53:40,056 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:53:40,057 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:53:40,057 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:53:40,057 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:53:40,057 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:53:40,060 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:53:40,060 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:53:40,061 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:53:40,061 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:53:40,061 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:53:40,061 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:53:40,061 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:53:40,062 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:53:40,062 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:53:40,062 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:53:40,062 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:53:40,063 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:53:40,063 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:53:40,063 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:53:40,063 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:53:40,063 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:53:40,063 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:53:40,064 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:53:40,064 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:53:40,064 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:53:40,064 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:53:40,064 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 12:53:40,064 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:53:40,064 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:53:40,064 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:53:40,065 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:53:40,065 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:53:40,065 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:53:40,065 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:53:40,065 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:53:40,065 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:53:40,065 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:53:40,066 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:53:40,066 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:53:40,066 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:53:40,066 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:53:40,066 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:53:40,066 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:53:40,067 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((!(0 == str) || !(\valid[str] == 1)) || !(unknown-#memory_int-unknown[str][str] == 0)) || !(\exists main_~length1~4 : int, v_main_~nondetString1~4.offset_BEFORE_CALL_1 : int :: ((str <= v_main_~nondetString1~4.offset_BEFORE_CALL_1 && 0 == unknown-#memory_int-unknown[str][main_~length1~4 + v_main_~nondetString1~4.offset_BEFORE_CALL_1 + -1]) && main_~length1~4 + v_main_~nondetString1~4.offset_BEFORE_CALL_1 <= unknown-#length-unknown[str]) && 1 <= main_~length1~4)) || (((0 == unknown-#memory_int-unknown[s][s] && s == 0) && 1 <= unknown-#length-unknown[s]) && 1 == \valid[s])) && ((((!(0 == str) || !(\exists v_main_~nondetString1~4.offset_BEFORE_CALL_3 : int :: ((v_main_~nondetString1~4.offset_BEFORE_CALL_3 <= str && 0 <= v_main_~nondetString1~4.offset_BEFORE_CALL_3) && v_main_~nondetString1~4.offset_BEFORE_CALL_3 <= 0) && 0 == unknown-#memory_int-unknown[str][v_main_~nondetString1~4.offset_BEFORE_CALL_3 + unknown-#length-unknown[str] + -1])) || !(\valid[str] == 1)) || !(\exists main_~length1~4 : int, v_main_~nondetString1~4.offset_BEFORE_CALL_1 : int :: ((str <= v_main_~nondetString1~4.offset_BEFORE_CALL_1 && 0 == unknown-#memory_int-unknown[str][main_~length1~4 + v_main_~nondetString1~4.offset_BEFORE_CALL_1 + -1]) && main_~length1~4 + v_main_~nondetString1~4.offset_BEFORE_CALL_1 <= unknown-#length-unknown[str]) && 1 <= main_~length1~4)) || (((\exists main_~length1~4 : int, v_main_~nondetString1~4.offset_BEFORE_CALL_1 : int :: ((s <= v_main_~nondetString1~4.offset_BEFORE_CALL_1 && main_~length1~4 + v_main_~nondetString1~4.offset_BEFORE_CALL_1 <= unknown-#length-unknown[s]) && unknown-#memory_int-unknown[s][main_~length1~4 + v_main_~nondetString1~4.offset_BEFORE_CALL_1 + -1] == 0) && 1 <= main_~length1~4) && (\exists v_main_~nondetString1~4.offset_BEFORE_CALL_3 : int :: ((0 == unknown-#memory_int-unknown[s][v_main_~nondetString1~4.offset_BEFORE_CALL_3 + unknown-#length-unknown[s] + -1] && v_main_~nondetString1~4.offset_BEFORE_CALL_3 <= s) && 0 <= v_main_~nondetString1~4.offset_BEFORE_CALL_3) && v_main_~nondetString1~4.offset_BEFORE_CALL_3 <= 0)) && 1 == \valid[s])) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 31 locations, 5 error locations. SAFE Result, 7.5s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 2.7s AutomataDifference, 0.0s DeadEndRemovalTime, 1.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 154 SDtfs, 200 SDslu, 506 SDs, 0 SdLazy, 478 SolverSat, 73 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 236 GetRequests, 110 SyntacticMatches, 10 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 18 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 13 NumberOfFragments, 239 HoareAnnotationTreeSize, 9 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 723 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 208 NumberOfCodeBlocks, 208 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 272 ConstructedInterpolants, 25 QuantifiedInterpolants, 51806 SizeOfPredicates, 42 NumberOfNonLiveVariables, 328 ConjunctsInSsa, 110 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/openbsd_cstrlen-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_12-53-40-072.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrlen-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_12-53-40-072.csv Received shutdown request...