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_cmemchr-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 12:50:19,713 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 12:50:19,714 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 12:50:19,726 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 12:50:19,726 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 12:50:19,727 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 12:50:19,728 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 12:50:19,730 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 12:50:19,732 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 12:50:19,732 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 12:50:19,733 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 12:50:19,733 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 12:50:19,733 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 12:50:19,734 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 12:50:19,735 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 12:50:19,737 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 12:50:19,740 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 12:50:19,741 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 12:50:19,743 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 12:50:19,744 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 12:50:19,746 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 12:50:19,746 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 12:50:19,746 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 12:50:19,747 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 12:50:19,748 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 12:50:19,749 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 12:50:19,750 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 12:50:19,750 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 12:50:19,750 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 12:50:19,751 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 12:50:19,751 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 12:50:19,752 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:50:19,761 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 12:50:19,761 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 12:50:19,762 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 12:50:19,762 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 12:50:19,763 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 12:50:19,763 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 12:50:19,763 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 12:50:19,763 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 12:50:19,764 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 12:50:19,764 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 12:50:19,764 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 12:50:19,764 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 12:50:19,764 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 12:50:19,765 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 12:50:19,765 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 12:50:19,765 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 12:50:19,765 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 12:50:19,765 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 12:50:19,765 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 12:50:19,766 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 12:50:19,766 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 12:50:19,766 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 12:50:19,766 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 12:50:19,766 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:50:19,767 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 12:50:19,767 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 12:50:19,767 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 12:50:19,767 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 12:50:19,767 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-01-24 12:50:19,768 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 12:50:19,768 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 12:50:19,768 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 12:50:19,769 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 12:50:19,769 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 12:50:19,802 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 12:50:19,814 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 12:50:19,817 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 12:50:19,818 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 12:50:19,818 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 12:50:19,819 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cmemchr-alloca_true-valid-memsafety_true-termination.i [2018-01-24 12:50:19,980 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 12:50:19,987 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 12:50:19,988 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 12:50:19,988 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 12:50:19,995 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 12:50:19,996 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:50:19" (1/1) ... [2018-01-24 12:50:19,998 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@721b488c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:50:19, skipping insertion in model container [2018-01-24 12:50:19,999 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:50:19" (1/1) ... [2018-01-24 12:50:20,014 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:50:20,053 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:50:20,157 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:50:20,178 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:50:20,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:50:20 WrapperNode [2018-01-24 12:50:20,185 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 12:50:20,186 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 12:50:20,186 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 12:50:20,186 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 12:50:20,197 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:50:20" (1/1) ... [2018-01-24 12:50:20,197 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:50:20" (1/1) ... [2018-01-24 12:50:20,204 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:50:20" (1/1) ... [2018-01-24 12:50:20,204 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:50:20" (1/1) ... [2018-01-24 12:50:20,207 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:50:20" (1/1) ... [2018-01-24 12:50:20,209 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:50:20" (1/1) ... [2018-01-24 12:50:20,210 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:50:20" (1/1) ... [2018-01-24 12:50:20,211 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 12:50:20,212 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 12:50:20,212 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 12:50:20,212 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 12:50:20,213 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:50:20" (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:50:20,254 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 12:50:20,254 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 12:50:20,254 INFO L136 BoogieDeclarations]: Found implementation of procedure cmemchr [2018-01-24 12:50:20,254 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 12:50:20,255 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 12:50:20,255 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 12:50:20,255 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 12:50:20,255 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 12:50:20,255 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 12:50:20,255 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 12:50:20,256 INFO L128 BoogieDeclarations]: Found specification of procedure cmemchr [2018-01-24 12:50:20,256 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 12:50:20,256 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 12:50:20,256 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 12:50:20,389 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 12:50:20,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:50:20 BoogieIcfgContainer [2018-01-24 12:50:20,390 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 12:50:20,390 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 12:50:20,391 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 12:50:20,393 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 12:50:20,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 12:50:19" (1/3) ... [2018-01-24 12:50:20,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12de12cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:50:20, skipping insertion in model container [2018-01-24 12:50:20,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:50:20" (2/3) ... [2018-01-24 12:50:20,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12de12cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:50:20, skipping insertion in model container [2018-01-24 12:50:20,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:50:20" (3/3) ... [2018-01-24 12:50:20,396 INFO L105 eAbstractionObserver]: Analyzing ICFG openbsd_cmemchr-alloca_true-valid-memsafety_true-termination.i [2018-01-24 12:50:20,403 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 12:50:20,408 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-24 12:50:20,452 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 12:50:20,452 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 12:50:20,452 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 12:50:20,453 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 12:50:20,453 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 12:50:20,453 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 12:50:20,453 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 12:50:20,453 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 12:50:20,454 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 12:50:20,474 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-01-24 12:50:20,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 12:50:20,480 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:50:20,481 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:50:20,481 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cmemchrErr1RequiresViolation, cmemchrErr0RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 12:50:20,487 INFO L82 PathProgramCache]: Analyzing trace with hash -624451344, now seen corresponding path program 1 times [2018-01-24 12:50:20,489 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:50:20,544 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:20,544 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:50:20,544 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:20,544 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:50:20,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:50:20,606 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:50:20,788 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:50:20,790 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:50:20,790 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 12:50:20,790 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:50:20,793 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:50:20,805 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:50:20,805 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:50:20,807 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 8 states. [2018-01-24 12:50:21,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:50:21,143 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-01-24 12:50:21,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 12:50:21,145 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-01-24 12:50:21,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:50:21,153 INFO L225 Difference]: With dead ends: 45 [2018-01-24 12:50:21,153 INFO L226 Difference]: Without dead ends: 30 [2018-01-24 12:50:21,155 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-01-24 12:50:21,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-01-24 12:50:21,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2018-01-24 12:50:21,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-01-24 12:50:21,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-01-24 12:50:21,182 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 15 [2018-01-24 12:50:21,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:50:21,182 INFO L432 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-01-24 12:50:21,182 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:50:21,183 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-01-24 12:50:21,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 12:50:21,183 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:50:21,183 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:50:21,183 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cmemchrErr1RequiresViolation, cmemchrErr0RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 12:50:21,184 INFO L82 PathProgramCache]: Analyzing trace with hash -624451343, now seen corresponding path program 1 times [2018-01-24 12:50:21,184 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:50:21,185 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:21,185 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:50:21,185 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:21,185 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:50:21,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:50:21,203 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:50:21,440 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:50:21,440 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:50:21,440 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 12:50:21,440 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:50:21,442 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 12:50:21,442 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 12:50:21,443 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:50:21,443 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 9 states. [2018-01-24 12:50:21,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:50:21,541 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-01-24 12:50:21,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 12:50:21,541 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-01-24 12:50:21,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:50:21,542 INFO L225 Difference]: With dead ends: 31 [2018-01-24 12:50:21,542 INFO L226 Difference]: Without dead ends: 30 [2018-01-24 12:50:21,543 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-01-24 12:50:21,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-01-24 12:50:21,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-01-24 12:50:21,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-01-24 12:50:21,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-01-24 12:50:21,547 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 15 [2018-01-24 12:50:21,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:50:21,547 INFO L432 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-01-24 12:50:21,548 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 12:50:21,548 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-01-24 12:50:21,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 12:50:21,548 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:50:21,548 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:50:21,548 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cmemchrErr1RequiresViolation, cmemchrErr0RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 12:50:21,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1772059431, now seen corresponding path program 1 times [2018-01-24 12:50:21,549 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:50:21,550 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:21,550 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:50:21,550 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:21,550 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:50:21,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:50:21,569 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:50:21,700 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:50:21,701 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:50:21,701 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 12:50:21,701 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:50:21,701 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 12:50:21,702 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 12:50:21,702 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:50:21,702 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 7 states. [2018-01-24 12:50:21,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:50:21,793 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2018-01-24 12:50:21,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 12:50:21,793 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-01-24 12:50:21,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:50:21,795 INFO L225 Difference]: With dead ends: 63 [2018-01-24 12:50:21,795 INFO L226 Difference]: Without dead ends: 49 [2018-01-24 12:50:21,795 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-01-24 12:50:21,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-24 12:50:21,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 42. [2018-01-24 12:50:21,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-24 12:50:21,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-01-24 12:50:21,805 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 20 [2018-01-24 12:50:21,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:50:21,806 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-01-24 12:50:21,806 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 12:50:21,806 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-01-24 12:50:21,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 12:50:21,807 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:50:21,807 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:50:21,807 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cmemchrErr1RequiresViolation, cmemchrErr0RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 12:50:21,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1185253417, now seen corresponding path program 1 times [2018-01-24 12:50:21,808 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:50:21,809 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:21,809 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:50:21,810 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:21,810 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:50:21,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:50:21,830 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:50:22,116 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:50:22,117 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:50:22,117 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:50:22,134 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:50:22,134 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:50:22,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:50:22,167 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:50:22,200 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:50:22,202 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:50:22,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:50:22,206 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 12:50:22,443 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:50:22,443 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:50:22,759 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:50:22,779 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:50:22,780 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:50:22,783 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:50:22,784 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:50:22,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:50:22,819 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:50:22,822 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:50:22,822 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:50:22,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:50:22,826 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-24 12:50:22,956 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:50:22,956 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:50:23,228 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:50:23,229 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 12:50:23,229 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11, 12, 12] total 43 [2018-01-24 12:50:23,230 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 12:50:23,230 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-24 12:50:23,230 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-24 12:50:23,231 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1716, Unknown=0, NotChecked=0, Total=1892 [2018-01-24 12:50:23,231 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 23 states. [2018-01-24 12:50:23,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:50:23,842 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2018-01-24 12:50:23,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 12:50:23,881 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 20 [2018-01-24 12:50:23,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:50:23,883 INFO L225 Difference]: With dead ends: 56 [2018-01-24 12:50:23,883 INFO L226 Difference]: Without dead ends: 55 [2018-01-24 12:50:23,884 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=298, Invalid=2354, Unknown=0, NotChecked=0, Total=2652 [2018-01-24 12:50:23,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-24 12:50:23,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2018-01-24 12:50:23,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-24 12:50:23,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2018-01-24 12:50:23,892 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 20 [2018-01-24 12:50:23,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:50:23,893 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2018-01-24 12:50:23,893 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-24 12:50:23,893 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2018-01-24 12:50:23,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 12:50:23,894 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:50:23,894 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:50:23,894 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cmemchrErr1RequiresViolation, cmemchrErr0RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 12:50:23,894 INFO L82 PathProgramCache]: Analyzing trace with hash 423617884, now seen corresponding path program 1 times [2018-01-24 12:50:23,894 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:50:23,895 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:23,895 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:50:23,895 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:23,895 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:50:23,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:50:23,907 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:50:23,966 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:50:23,966 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:50:23,967 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:50:23,967 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:50:23,967 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:50:23,967 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:50:23,967 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:50:23,967 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand 4 states. [2018-01-24 12:50:24,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:50:24,015 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2018-01-24 12:50:24,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:50:24,016 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-01-24 12:50:24,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:50:24,017 INFO L225 Difference]: With dead ends: 47 [2018-01-24 12:50:24,017 INFO L226 Difference]: Without dead ends: 26 [2018-01-24 12:50:24,018 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:50:24,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-01-24 12:50:24,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-01-24 12:50:24,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-01-24 12:50:24,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-01-24 12:50:24,024 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 20 [2018-01-24 12:50:24,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:50:24,025 INFO L432 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-01-24 12:50:24,025 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:50:24,025 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-01-24 12:50:24,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 12:50:24,026 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:50:24,026 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:50:24,026 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cmemchrErr1RequiresViolation, cmemchrErr0RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 12:50:24,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1860785903, now seen corresponding path program 2 times [2018-01-24 12:50:24,026 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:50:24,027 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:24,027 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:50:24,027 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:24,028 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:50:24,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:50:24,047 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:50:24,288 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:50:24,288 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:50:24,288 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:50:24,293 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:50:24,293 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 12:50:24,302 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:50:24,307 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:50:24,309 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:50:24,312 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:50:24,314 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:50:24,315 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:50:24,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:50:24,318 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 12:50:24,505 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:50:24,505 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:50:24,918 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:50:24,940 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:50:24,940 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:50:24,943 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:50:24,943 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 12:50:24,957 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:50:24,969 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:50:24,986 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:50:24,993 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:50:24,998 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:50:24,998 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:50:25,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:50:25,001 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 12:50:25,061 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:50:25,061 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:50:25,123 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:50:25,125 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 12:50:25,126 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14, 14, 14] total 35 [2018-01-24 12:50:25,126 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 12:50:25,126 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-24 12:50:25,126 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-24 12:50:25,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1133, Unknown=0, NotChecked=0, Total=1260 [2018-01-24 12:50:25,127 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 23 states. [2018-01-24 12:50:25,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:50:25,802 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-01-24 12:50:25,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-24 12:50:25,802 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 25 [2018-01-24 12:50:25,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:50:25,803 INFO L225 Difference]: With dead ends: 32 [2018-01-24 12:50:25,803 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 12:50:25,804 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 67 SyntacticMatches, 11 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=309, Invalid=2343, Unknown=0, NotChecked=0, Total=2652 [2018-01-24 12:50:25,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 12:50:25,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 12:50:25,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 12:50:25,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 12:50:25,805 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2018-01-24 12:50:25,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:50:25,805 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 12:50:25,805 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-24 12:50:25,805 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 12:50:25,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 12:50:25,809 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 12:50:26,113 WARN L146 SmtUtils]: Spent 201ms on a formula simplification. DAG size of input: 95 DAG size of output 65 [2018-01-24 12:50:26,128 INFO L401 ceAbstractionStarter]: For program point cmemchrEXIT(lines 540 551) no Hoare annotation was computed. [2018-01-24 12:50:26,128 INFO L401 ceAbstractionStarter]: For program point L546(line 546) no Hoare annotation was computed. [2018-01-24 12:50:26,128 INFO L401 ceAbstractionStarter]: For program point L545(lines 545 548) no Hoare annotation was computed. [2018-01-24 12:50:26,128 INFO L401 ceAbstractionStarter]: For program point cmemchrFINAL(lines 540 551) no Hoare annotation was computed. [2018-01-24 12:50:26,128 INFO L401 ceAbstractionStarter]: For program point L543(lines 543 549) no Hoare annotation was computed. [2018-01-24 12:50:26,128 INFO L404 ceAbstractionStarter]: At program point cmemchrENTRY(lines 540 551) the Hoare annotation is: true [2018-01-24 12:50:26,128 INFO L401 ceAbstractionStarter]: For program point L546'(line 546) no Hoare annotation was computed. [2018-01-24 12:50:26,128 INFO L401 ceAbstractionStarter]: For program point cmemchrErr1RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-24 12:50:26,129 INFO L397 ceAbstractionStarter]: At program point L545'''(lines 545 548) the Hoare annotation is: (let ((.cse0 (select |#length| |cmemchr_#in~s.base|))) (let ((.cse6 (= cmemchr_~p~3.offset 0)) (.cse8 (not (= 0 |cmemchr_#in~s.offset|))) (.cse12 (not (= (select |#valid| |cmemchr_#in~s.base|) 1))) (.cse13 (< .cse0 1))) (and (let ((.cse4 (select |#length| cmemchr_~s.base)) (.cse1 (select |#length| cmemchr_~p~3.base))) (let ((.cse7 (<= 1 .cse1)) (.cse2 (= 1 (select |#valid| cmemchr_~p~3.base))) (.cse3 (= 0 cmemchr_~s.offset)) (.cse10 (<= 1 .cse4)) (.cse5 (= 1 (select |#valid| cmemchr_~s.base)))) (or (< |cmemchr_#in~n| .cse0) (and (= cmemchr_~n .cse1) .cse2 .cse3 (= cmemchr_~n .cse4) .cse5 .cse6 .cse7) .cse8 (let ((.cse9 (+ cmemchr_~n 1))) (and (<= .cse9 .cse1) (= cmemchr_~p~3.offset 1) .cse2 .cse3 .cse10 (not (= (mod (+ .cse1 4294967295) 4294967296) 0)) .cse5 .cse7 (<= .cse1 .cse9))) (let ((.cse11 (+ cmemchr_~p~3.offset cmemchr_~n))) (and (<= 2 cmemchr_~p~3.offset) (<= (+ cmemchr_~p~3.offset 1) .cse1) .cse2 .cse3 (<= .cse11 .cse1) (<= .cse1 .cse11) .cse10 .cse5)) (< .cse0 |cmemchr_#in~n|) .cse12 .cse13))) (or (< 1 |cmemchr_#in~n|) (not (= .cse0 |cmemchr_#in~n|)) (and (<= cmemchr_~n 1) .cse6) .cse8 .cse12 .cse13)))) [2018-01-24 12:50:26,129 INFO L401 ceAbstractionStarter]: For program point cmemchrErr0RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-24 12:50:26,129 INFO L401 ceAbstractionStarter]: For program point L543'(lines 543 549) no Hoare annotation was computed. [2018-01-24 12:50:26,129 INFO L401 ceAbstractionStarter]: For program point L545'(lines 545 548) no Hoare annotation was computed. [2018-01-24 12:50:26,129 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 565) no Hoare annotation was computed. [2018-01-24 12:50:26,129 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 565) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 12:50:26,129 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 565) no Hoare annotation was computed. [2018-01-24 12:50:26,129 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 565) the Hoare annotation is: true [2018-01-24 12:50:26,129 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 565) no Hoare annotation was computed. [2018-01-24 12:50:26,129 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 565) the Hoare annotation is: true [2018-01-24 12:50:26,129 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 565) no Hoare annotation was computed. [2018-01-24 12:50:26,129 INFO L397 ceAbstractionStarter]: At program point L563(line 563) the Hoare annotation is: (and (= main_~n~5 (select |#length| main_~nondetArea~5.base)) (= 0 |main_#t~malloc6.offset|) (<= 1 main_~n~5) (= main_~n~5 (select |#length| |main_#t~malloc6.base|)) (= 0 main_~nondetArea~5.offset) (= (store |#valid| |main_#t~malloc6.base| (select (store |#valid| |main_#t~malloc6.base| 0) |main_#t~malloc6.base|)) |old(#valid)|) (= 1 (select |#valid| |main_#t~malloc6.base|)) (= 1 (select |#valid| main_~nondetArea~5.base))) [2018-01-24 12:50:26,130 INFO L401 ceAbstractionStarter]: For program point L562'(line 562) no Hoare annotation was computed. [2018-01-24 12:50:26,130 INFO L401 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-01-24 12:50:26,130 INFO L401 ceAbstractionStarter]: For program point L563'(line 563) no Hoare annotation was computed. [2018-01-24 12:50:26,130 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 552 565) no Hoare annotation was computed. [2018-01-24 12:50:26,130 INFO L401 ceAbstractionStarter]: For program point L556(lines 556 558) no Hoare annotation was computed. [2018-01-24 12:50:26,130 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 552 565) no Hoare annotation was computed. [2018-01-24 12:50:26,130 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 552 565) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 12:50:26,130 INFO L401 ceAbstractionStarter]: For program point L562''(line 562) no Hoare annotation was computed. [2018-01-24 12:50:26,130 INFO L401 ceAbstractionStarter]: For program point L559'(lines 559 561) no Hoare annotation was computed. [2018-01-24 12:50:26,130 INFO L401 ceAbstractionStarter]: For program point L556''(lines 556 558) no Hoare annotation was computed. [2018-01-24 12:50:26,130 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 552 565) no Hoare annotation was computed. [2018-01-24 12:50:26,139 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:26,140 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:26,141 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:26,141 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:26,141 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:26,141 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:26,142 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:26,142 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:26,142 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:26,142 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:26,143 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:26,143 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:26,143 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:26,143 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:26,144 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:26,144 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:26,144 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:26,151 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:26,151 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:26,151 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:26,152 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:26,152 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:26,152 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:26,152 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:26,153 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:26,153 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:26,153 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:26,153 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:26,153 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:26,154 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:26,154 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:26,154 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:26,154 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:26,155 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:26,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 12:50:26 BoogieIcfgContainer [2018-01-24 12:50:26,157 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 12:50:26,159 INFO L168 Benchmark]: Toolchain (without parser) took 6177.43 ms. Allocated memory was 304.1 MB in the beginning and 537.4 MB in the end (delta: 233.3 MB). Free memory was 263.0 MB in the beginning and 498.1 MB in the end (delta: -235.1 MB). Peak memory consumption was 178.6 MB. Max. memory is 5.3 GB. [2018-01-24 12:50:26,160 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 304.1 MB. Free memory is still 269.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 12:50:26,161 INFO L168 Benchmark]: CACSL2BoogieTranslator took 197.57 ms. Allocated memory is still 304.1 MB. Free memory was 263.0 MB in the beginning and 253.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:50:26,161 INFO L168 Benchmark]: Boogie Preprocessor took 25.83 ms. Allocated memory is still 304.1 MB. Free memory was 253.0 MB in the beginning and 251.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:50:26,162 INFO L168 Benchmark]: RCFGBuilder took 178.10 ms. Allocated memory is still 304.1 MB. Free memory was 251.0 MB in the beginning and 236.1 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:50:26,162 INFO L168 Benchmark]: TraceAbstraction took 5767.11 ms. Allocated memory was 304.1 MB in the beginning and 537.4 MB in the end (delta: 233.3 MB). Free memory was 236.1 MB in the beginning and 498.1 MB in the end (delta: -262.0 MB). Peak memory consumption was 151.7 MB. Max. memory is 5.3 GB. [2018-01-24 12:50:26,164 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 304.1 MB. Free memory is still 269.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 197.57 ms. Allocated memory is still 304.1 MB. Free memory was 263.0 MB in the beginning and 253.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 25.83 ms. Allocated memory is still 304.1 MB. Free memory was 253.0 MB in the beginning and 251.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 178.10 ms. Allocated memory is still 304.1 MB. Free memory was 251.0 MB in the beginning and 236.1 MB in the end (delta: 14.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 5767.11 ms. Allocated memory was 304.1 MB in the beginning and 537.4 MB in the end (delta: 233.3 MB). Free memory was 236.1 MB in the beginning and 498.1 MB in the end (delta: -262.0 MB). Peak memory consumption was 151.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - 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: 552]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 545]: Loop Invariant [2018-01-24 12:50:26,172 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:26,173 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:26,173 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:26,173 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:26,173 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:26,173 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:26,174 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:26,174 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:26,174 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:26,174 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:26,175 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:26,175 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:26,175 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:26,175 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:26,175 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:26,176 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:26,176 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:26,179 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:26,180 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:26,180 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:26,180 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:26,180 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:26,181 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:26,181 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:26,181 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:26,181 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:26,181 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:26,182 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:26,182 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:26,182 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:26,182 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:26,182 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:26,183 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:26,183 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((\old(n) < unknown-#length-unknown[s] || ((((((n == unknown-#length-unknown[p] && 1 == \valid[p]) && 0 == s) && n == unknown-#length-unknown[s]) && 1 == \valid[s]) && p == 0) && 1 <= unknown-#length-unknown[p])) || !(0 == s)) || ((((((((n + 1 <= unknown-#length-unknown[p] && p == 1) && 1 == \valid[p]) && 0 == s) && 1 <= unknown-#length-unknown[s]) && !((unknown-#length-unknown[p] + 4294967295) % 4294967296 == 0)) && 1 == \valid[s]) && 1 <= unknown-#length-unknown[p]) && unknown-#length-unknown[p] <= n + 1)) || (((((((2 <= p && p + 1 <= unknown-#length-unknown[p]) && 1 == \valid[p]) && 0 == s) && p + n <= unknown-#length-unknown[p]) && unknown-#length-unknown[p] <= p + n) && 1 <= unknown-#length-unknown[s]) && 1 == \valid[s])) || unknown-#length-unknown[s] < \old(n)) || !(\valid[s] == 1)) || unknown-#length-unknown[s] < 1) && (((((1 < \old(n) || !(unknown-#length-unknown[s] == \old(n))) || (n <= 1 && p == 0)) || !(0 == s)) || !(\valid[s] == 1)) || unknown-#length-unknown[s] < 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 31 locations, 3 error locations. SAFE Result, 5.6s OverallTime, 6 OverallIterations, 3 TraceHistogramMax, 1.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 140 SDtfs, 213 SDslu, 764 SDs, 0 SdLazy, 680 SolverSat, 67 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 265 GetRequests, 118 SyntacticMatches, 15 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1200 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=4, 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, 6 MinimizatonAttempts, 19 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 14 NumberOfFragments, 240 HoareAnnotationTreeSize, 9 FomulaSimplifications, 45 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 473 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 205 NumberOfCodeBlocks, 205 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 281 ConstructedInterpolants, 4 QuantifiedInterpolants, 63043 SizeOfPredicates, 46 NumberOfNonLiveVariables, 456 ConjunctsInSsa, 188 ConjunctsInUnsatCore, 14 InterpolantComputations, 4 PerfectInterpolantSequences, 2/57 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_cmemchr-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_12-50-26-188.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cmemchr-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_12-50-26-188.csv Received shutdown request...