java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cmemchr-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 05:25:32,116 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 05:25:32,118 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 05:25:32,133 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 05:25:32,133 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 05:25:32,134 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 05:25:32,135 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 05:25:32,137 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 05:25:32,139 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 05:25:32,139 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 05:25:32,140 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 05:25:32,140 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 05:25:32,141 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 05:25:32,143 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 05:25:32,143 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 05:25:32,146 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 05:25:32,148 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 05:25:32,150 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 05:25:32,151 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 05:25:32,153 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 05:25:32,155 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 05:25:32,155 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 05:25:32,156 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 05:25:32,156 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 05:25:32,157 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 05:25:32,158 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 05:25:32,159 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 05:25:32,159 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 05:25:32,160 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 05:25:32,160 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 05:25:32,160 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 05:25:32,161 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf [2018-01-25 05:25:32,168 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 05:25:32,169 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 05:25:32,170 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 05:25:32,170 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 05:25:32,170 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 05:25:32,170 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 05:25:32,170 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 05:25:32,170 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 05:25:32,171 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 05:25:32,171 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 05:25:32,171 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 05:25:32,171 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 05:25:32,171 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 05:25:32,171 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 05:25:32,172 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 05:25:32,172 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 05:25:32,172 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 05:25:32,172 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 05:25:32,172 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 05:25:32,172 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 05:25:32,172 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 05:25:32,172 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 05:25:32,173 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 05:25:32,173 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 05:25:32,173 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 05:25:32,173 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 05:25:32,173 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 05:25:32,174 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 05:25:32,174 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 05:25:32,174 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 05:25:32,174 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 05:25:32,174 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 05:25:32,174 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 05:25:32,174 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 05:25:32,175 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 05:25:32,175 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 05:25:32,207 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 05:25:32,217 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 05:25:32,220 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 05:25:32,221 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 05:25:32,222 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 05:25:32,222 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-25 05:25:32,397 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 05:25:32,400 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 05:25:32,401 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 05:25:32,401 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 05:25:32,406 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 05:25:32,407 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:25:32" (1/1) ... [2018-01-25 05:25:32,410 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@625fe0e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:25:32, skipping insertion in model container [2018-01-25 05:25:32,410 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:25:32" (1/1) ... [2018-01-25 05:25:32,423 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:25:32,460 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:25:32,575 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:25:32,593 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:25:32,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:25:32 WrapperNode [2018-01-25 05:25:32,600 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 05:25:32,601 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 05:25:32,601 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 05:25:32,601 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 05:25:32,618 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:25:32" (1/1) ... [2018-01-25 05:25:32,618 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:25:32" (1/1) ... [2018-01-25 05:25:32,626 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:25:32" (1/1) ... [2018-01-25 05:25:32,627 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:25:32" (1/1) ... [2018-01-25 05:25:32,631 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:25:32" (1/1) ... [2018-01-25 05:25:32,634 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:25:32" (1/1) ... [2018-01-25 05:25:32,635 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:25:32" (1/1) ... [2018-01-25 05:25:32,637 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 05:25:32,638 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 05:25:32,638 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 05:25:32,638 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 05:25:32,639 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:25: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-25 05:25:32,684 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 05:25:32,685 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 05:25:32,685 INFO L136 BoogieDeclarations]: Found implementation of procedure cmemchr [2018-01-25 05:25:32,685 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 05:25:32,685 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 05:25:32,685 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 05:25:32,685 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 05:25:32,685 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 05:25:32,685 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 05:25:32,686 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 05:25:32,686 INFO L128 BoogieDeclarations]: Found specification of procedure cmemchr [2018-01-25 05:25:32,686 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 05:25:32,686 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 05:25:32,686 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 05:25:32,826 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 05:25:32,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:25:32 BoogieIcfgContainer [2018-01-25 05:25:32,827 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 05:25:32,828 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 05:25:32,828 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 05:25:32,830 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 05:25:32,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 05:25:32" (1/3) ... [2018-01-25 05:25:32,832 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aeaa160 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:25:32, skipping insertion in model container [2018-01-25 05:25:32,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:25:32" (2/3) ... [2018-01-25 05:25:32,832 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aeaa160 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:25:32, skipping insertion in model container [2018-01-25 05:25:32,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:25:32" (3/3) ... [2018-01-25 05:25:32,834 INFO L105 eAbstractionObserver]: Analyzing ICFG openbsd_cmemchr-alloca_true-valid-memsafety_true-termination.i [2018-01-25 05:25:32,840 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 05:25:32,846 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-25 05:25:32,881 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 05:25:32,881 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 05:25:32,881 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 05:25:32,881 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 05:25:32,882 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 05:25:32,882 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 05:25:32,882 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 05:25:32,882 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 05:25:32,882 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 05:25:32,897 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-01-25 05:25:32,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-25 05:25:32,902 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:25:32,903 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:25:32,903 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cmemchrErr1RequiresViolation, cmemchrErr0RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:25:32,907 INFO L82 PathProgramCache]: Analyzing trace with hash -624451344, now seen corresponding path program 1 times [2018-01-25 05:25:32,909 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:25:32,949 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:25:32,950 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:25:32,950 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:25:32,950 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:25:33,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:25:33,010 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:25:33,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:25:33,218 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:25:33,219 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 05:25:33,219 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:25:33,221 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 05:25:33,230 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 05:25:33,231 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:25:33,233 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 8 states. [2018-01-25 05:25:33,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:25:33,526 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-01-25 05:25:33,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 05:25:33,528 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-01-25 05:25:33,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:25:33,541 INFO L225 Difference]: With dead ends: 45 [2018-01-25 05:25:33,541 INFO L226 Difference]: Without dead ends: 30 [2018-01-25 05:25:33,544 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-25 05:25:33,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-01-25 05:25:33,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2018-01-25 05:25:33,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-01-25 05:25:33,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-01-25 05:25:33,579 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 15 [2018-01-25 05:25:33,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:25:33,579 INFO L432 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-01-25 05:25:33,579 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 05:25:33,579 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-01-25 05:25:33,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-25 05:25:33,580 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:25:33,580 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:25:33,581 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cmemchrErr1RequiresViolation, cmemchrErr0RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:25:33,581 INFO L82 PathProgramCache]: Analyzing trace with hash -624451343, now seen corresponding path program 1 times [2018-01-25 05:25:33,581 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:25:33,582 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:25:33,582 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:25:33,583 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:25:33,583 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:25:33,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:25:33,604 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:25:33,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:25:33,776 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:25:33,776 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 05:25:33,776 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:25:33,777 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 05:25:33,777 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 05:25:33,778 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-25 05:25:33,778 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 9 states. [2018-01-25 05:25:33,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:25:33,921 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-01-25 05:25:34,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 05:25:34,016 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-01-25 05:25:34,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:25:34,017 INFO L225 Difference]: With dead ends: 31 [2018-01-25 05:25:34,017 INFO L226 Difference]: Without dead ends: 30 [2018-01-25 05:25:34,018 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-01-25 05:25:34,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-01-25 05:25:34,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-01-25 05:25:34,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-01-25 05:25:34,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-01-25 05:25:34,024 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 15 [2018-01-25 05:25:34,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:25:34,025 INFO L432 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-01-25 05:25:34,025 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 05:25:34,025 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-01-25 05:25:34,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 05:25:34,026 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:25:34,026 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-25 05:25:34,026 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cmemchrErr1RequiresViolation, cmemchrErr0RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:25:34,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1772059431, now seen corresponding path program 1 times [2018-01-25 05:25:34,027 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:25:34,028 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:25:34,028 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:25:34,028 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:25:34,028 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:25:34,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:25:34,049 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:25:34,180 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:25:34,180 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:25:34,180 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 05:25:34,180 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:25:34,181 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 05:25:34,181 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 05:25:34,181 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:25:34,182 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 7 states. [2018-01-25 05:25:34,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:25:34,271 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2018-01-25 05:25:34,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 05:25:34,272 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-01-25 05:25:34,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:25:34,273 INFO L225 Difference]: With dead ends: 63 [2018-01-25 05:25:34,273 INFO L226 Difference]: Without dead ends: 49 [2018-01-25 05:25:34,274 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-25 05:25:34,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-25 05:25:34,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 42. [2018-01-25 05:25:34,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-25 05:25:34,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-01-25 05:25:34,284 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 20 [2018-01-25 05:25:34,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:25:34,284 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-01-25 05:25:34,284 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 05:25:34,284 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-01-25 05:25:34,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 05:25:34,285 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:25:34,286 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-25 05:25:34,286 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cmemchrErr1RequiresViolation, cmemchrErr0RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:25:34,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1185253417, now seen corresponding path program 1 times [2018-01-25 05:25:34,286 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:25:34,287 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:25:34,287 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:25:34,287 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:25:34,288 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:25:34,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:25:34,308 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:25:34,673 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:25:34,673 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:25:34,673 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:25:34,674 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-01-25 05:25:34,676 INFO L201 CegarAbsIntRunner]: [0], [3], [7], [8], [10], [14], [16], [21], [30], [31], [35], [38], [46], [48], [49], [56], [57], [58], [60] [2018-01-25 05:25:34,723 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:25:34,723 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:25:34,990 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:25:34,991 INFO L268 AbstractInterpreter]: Visited 19 different actions 24 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-01-25 05:25:35,020 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:25:35,020 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:25:35,020 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:25:35,030 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:25:35,030 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:25:35,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:25:35,067 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:25:35,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 05:25:35,102 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:25:35,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:25:35,114 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 05:25:35,447 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:25:35,447 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:25:35,752 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:25:35,772 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:25:35,773 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:25:35,776 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:25:35,776 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:25:35,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:25:35,812 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:25:35,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 05:25:35,816 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:25:35,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:25:35,820 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-25 05:25:35,977 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:25:35,977 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:25:36,231 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:25:36,233 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:25:36,233 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11, 12, 12] total 43 [2018-01-25 05:25:36,233 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:25:36,234 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-25 05:25:36,234 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-25 05:25:36,235 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1716, Unknown=0, NotChecked=0, Total=1892 [2018-01-25 05:25:36,235 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 23 states. [2018-01-25 05:25:36,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:25:36,734 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2018-01-25 05:25:36,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-25 05:25:36,735 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 20 [2018-01-25 05:25:36,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:25:36,736 INFO L225 Difference]: With dead ends: 56 [2018-01-25 05:25:36,736 INFO L226 Difference]: Without dead ends: 55 [2018-01-25 05:25:36,738 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-25 05:25:36,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-25 05:25:36,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2018-01-25 05:25:36,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-25 05:25:36,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2018-01-25 05:25:36,747 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 20 [2018-01-25 05:25:36,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:25:36,747 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2018-01-25 05:25:36,747 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-25 05:25:36,747 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2018-01-25 05:25:36,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 05:25:36,748 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:25:36,748 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:25:36,749 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cmemchrErr1RequiresViolation, cmemchrErr0RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:25:36,749 INFO L82 PathProgramCache]: Analyzing trace with hash 423617884, now seen corresponding path program 1 times [2018-01-25 05:25:36,749 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:25:36,750 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:25:36,750 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:25:36,750 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:25:36,750 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:25:36,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:25:36,764 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:25:36,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:25:36,823 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:25:36,823 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:25:36,823 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:25:36,823 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:25:36,824 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:25:36,824 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:25:36,824 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand 4 states. [2018-01-25 05:25:36,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:25:36,856 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2018-01-25 05:25:36,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:25:36,856 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-01-25 05:25:36,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:25:36,857 INFO L225 Difference]: With dead ends: 47 [2018-01-25 05:25:36,857 INFO L226 Difference]: Without dead ends: 26 [2018-01-25 05:25:36,857 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:25:36,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-01-25 05:25:36,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-01-25 05:25:36,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-01-25 05:25:36,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-01-25 05:25:36,861 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 20 [2018-01-25 05:25:36,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:25:36,862 INFO L432 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-01-25 05:25:36,862 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:25:36,862 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-01-25 05:25:36,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-25 05:25:36,862 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:25:36,863 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-25 05:25:36,863 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cmemchrErr1RequiresViolation, cmemchrErr0RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:25:36,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1860785903, now seen corresponding path program 2 times [2018-01-25 05:25:36,863 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:25:36,864 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:25:36,864 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:25:36,864 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:25:36,864 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:25:36,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:25:36,894 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:25:37,152 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-25 05:25:37,152 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:25:37,153 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:25:37,153 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:25:37,153 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 05:25:37,153 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:25:37,153 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:25:37,160 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:25:37,160 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:25:37,171 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:25:37,176 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:25:37,179 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:25:37,183 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:25:37,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 05:25:37,188 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:25:37,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:25:37,191 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 05:25:37,385 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-25 05:25:37,385 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:25:37,818 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-25 05:25:37,841 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:25:37,841 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:25:37,844 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:25:37,844 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:25:37,860 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:25:37,872 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:25:37,889 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:25:37,893 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:25:37,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 6 treesize of output 5 [2018-01-25 05:25:37,897 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:25:37,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:25:37,900 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 05:25:37,957 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-25 05:25:37,957 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:25:37,976 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-25 05:25:37,978 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:25:37,978 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14, 14, 14] total 35 [2018-01-25 05:25:37,978 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:25:37,979 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-25 05:25:37,979 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-25 05:25:37,980 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1133, Unknown=0, NotChecked=0, Total=1260 [2018-01-25 05:25:37,980 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 23 states. [2018-01-25 05:25:38,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:25:38,620 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-01-25 05:25:38,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-25 05:25:38,620 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 25 [2018-01-25 05:25:38,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:25:38,620 INFO L225 Difference]: With dead ends: 32 [2018-01-25 05:25:38,621 INFO L226 Difference]: Without dead ends: 0 [2018-01-25 05:25:38,622 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 68 SyntacticMatches, 10 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=309, Invalid=2343, Unknown=0, NotChecked=0, Total=2652 [2018-01-25 05:25:38,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-25 05:25:38,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-25 05:25:38,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-25 05:25:38,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-25 05:25:38,623 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2018-01-25 05:25:38,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:25:38,623 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-25 05:25:38,623 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-25 05:25:38,623 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-25 05:25:38,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-25 05:25:38,626 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-25 05:25:39,037 WARN L146 SmtUtils]: Spent 262ms on a formula simplification. DAG size of input: 95 DAG size of output 65 [2018-01-25 05:25:39,058 INFO L401 ceAbstractionStarter]: For program point cmemchrEXIT(lines 540 551) no Hoare annotation was computed. [2018-01-25 05:25:39,389 INFO L401 ceAbstractionStarter]: For program point L546(line 546) no Hoare annotation was computed. [2018-01-25 05:25:39,389 INFO L401 ceAbstractionStarter]: For program point L545(lines 545 548) no Hoare annotation was computed. [2018-01-25 05:25:39,389 INFO L401 ceAbstractionStarter]: For program point cmemchrFINAL(lines 540 551) no Hoare annotation was computed. [2018-01-25 05:25:39,390 INFO L401 ceAbstractionStarter]: For program point L543(lines 543 549) no Hoare annotation was computed. [2018-01-25 05:25:39,390 INFO L404 ceAbstractionStarter]: At program point cmemchrENTRY(lines 540 551) the Hoare annotation is: true [2018-01-25 05:25:39,390 INFO L401 ceAbstractionStarter]: For program point L546'(line 546) no Hoare annotation was computed. [2018-01-25 05:25:39,390 INFO L401 ceAbstractionStarter]: For program point cmemchrErr1RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-25 05:25:39,390 INFO L397 ceAbstractionStarter]: At program point L545'''(lines 545 548) the Hoare annotation is: (let ((.cse0 (select |#length| |cmemchr_#in~s.base|))) (let ((.cse1 (= cmemchr_~p~3.offset 0)) (.cse2 (not (= 0 |cmemchr_#in~s.offset|))) (.cse3 (not (= (select |#valid| |cmemchr_#in~s.base|) 1))) (.cse4 (< .cse0 1))) (and (or (< 1 |cmemchr_#in~n|) (not (= .cse0 |cmemchr_#in~n|)) (and (<= cmemchr_~n 1) .cse1) .cse2 .cse3 .cse4) (let ((.cse8 (select |#length| cmemchr_~s.base)) (.cse5 (select |#length| cmemchr_~p~3.base))) (let ((.cse10 (<= 1 .cse5)) (.cse6 (= 1 (select |#valid| cmemchr_~p~3.base))) (.cse7 (= 0 cmemchr_~s.offset)) (.cse12 (<= 1 .cse8)) (.cse9 (= 1 (select |#valid| cmemchr_~s.base)))) (or (< |cmemchr_#in~n| .cse0) (and (= cmemchr_~n .cse5) .cse6 .cse7 (= cmemchr_~n .cse8) .cse9 .cse1 .cse10) .cse2 (let ((.cse11 (+ cmemchr_~n 1))) (and (<= .cse11 .cse5) (= cmemchr_~p~3.offset 1) .cse6 .cse7 .cse12 (not (= (mod (+ .cse5 4294967295) 4294967296) 0)) .cse9 .cse10 (<= .cse5 .cse11))) (< .cse0 |cmemchr_#in~n|) .cse3 .cse4 (let ((.cse13 (+ cmemchr_~p~3.offset cmemchr_~n))) (and (<= 2 cmemchr_~p~3.offset) (<= (+ cmemchr_~p~3.offset 1) .cse5) .cse6 .cse7 (<= .cse13 .cse5) (<= .cse5 .cse13) .cse12 .cse9)))))))) [2018-01-25 05:25:39,390 INFO L401 ceAbstractionStarter]: For program point cmemchrErr0RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-25 05:25:39,390 INFO L401 ceAbstractionStarter]: For program point L543'(lines 543 549) no Hoare annotation was computed. [2018-01-25 05:25:39,390 INFO L401 ceAbstractionStarter]: For program point L545'(lines 545 548) no Hoare annotation was computed. [2018-01-25 05:25:39,391 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 565) no Hoare annotation was computed. [2018-01-25 05:25:39,391 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 565) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 05:25:39,391 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 565) no Hoare annotation was computed. [2018-01-25 05:25:39,391 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 565) the Hoare annotation is: true [2018-01-25 05:25:39,391 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 565) no Hoare annotation was computed. [2018-01-25 05:25:39,391 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 565) the Hoare annotation is: true [2018-01-25 05:25:39,391 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 565) no Hoare annotation was computed. [2018-01-25 05:25:39,391 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-25 05:25:39,391 INFO L401 ceAbstractionStarter]: For program point L562'(line 562) no Hoare annotation was computed. [2018-01-25 05:25:39,391 INFO L401 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-01-25 05:25:39,391 INFO L401 ceAbstractionStarter]: For program point L563'(line 563) no Hoare annotation was computed. [2018-01-25 05:25:39,391 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 552 565) no Hoare annotation was computed. [2018-01-25 05:25:39,391 INFO L401 ceAbstractionStarter]: For program point L556(lines 556 558) no Hoare annotation was computed. [2018-01-25 05:25:39,391 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 552 565) no Hoare annotation was computed. [2018-01-25 05:25:39,392 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 552 565) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 05:25:39,392 INFO L401 ceAbstractionStarter]: For program point L562''(line 562) no Hoare annotation was computed. [2018-01-25 05:25:39,392 INFO L401 ceAbstractionStarter]: For program point L559'(lines 559 561) no Hoare annotation was computed. [2018-01-25 05:25:39,392 INFO L401 ceAbstractionStarter]: For program point L556''(lines 556 558) no Hoare annotation was computed. [2018-01-25 05:25:39,392 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 552 565) no Hoare annotation was computed. [2018-01-25 05:25:39,399 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:39,399 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:39,400 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:39,400 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:39,400 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:39,400 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:39,400 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:39,400 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:39,400 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:39,401 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:39,401 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:39,401 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:39,401 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:39,401 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:39,401 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:39,402 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:39,402 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:39,407 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:39,407 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:39,407 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:39,408 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:39,408 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:39,408 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:39,408 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:39,408 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:39,408 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:39,408 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:39,409 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:39,409 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:39,409 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:39,409 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:39,409 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:39,409 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:39,409 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:39,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 05:25:39 BoogieIcfgContainer [2018-01-25 05:25:39,412 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 05:25:39,412 INFO L168 Benchmark]: Toolchain (without parser) took 7015.20 ms. Allocated memory was 303.0 MB in the beginning and 545.8 MB in the end (delta: 242.7 MB). Free memory was 262.1 MB in the beginning and 493.7 MB in the end (delta: -231.6 MB). Peak memory consumption was 187.4 MB. Max. memory is 5.3 GB. [2018-01-25 05:25:39,413 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 303.0 MB. Free memory is still 268.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 05:25:39,413 INFO L168 Benchmark]: CACSL2BoogieTranslator took 199.56 ms. Allocated memory is still 303.0 MB. Free memory was 262.1 MB in the beginning and 252.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-25 05:25:39,413 INFO L168 Benchmark]: Boogie Preprocessor took 36.21 ms. Allocated memory is still 303.0 MB. Free memory was 252.2 MB in the beginning and 250.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 05:25:39,413 INFO L168 Benchmark]: RCFGBuilder took 189.27 ms. Allocated memory is still 303.0 MB. Free memory was 250.2 MB in the beginning and 235.6 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 5.3 GB. [2018-01-25 05:25:39,414 INFO L168 Benchmark]: TraceAbstraction took 6584.02 ms. Allocated memory was 303.0 MB in the beginning and 545.8 MB in the end (delta: 242.7 MB). Free memory was 235.6 MB in the beginning and 493.7 MB in the end (delta: -258.2 MB). Peak memory consumption was 160.9 MB. Max. memory is 5.3 GB. [2018-01-25 05:25:39,415 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.13 ms. Allocated memory is still 303.0 MB. Free memory is still 268.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 199.56 ms. Allocated memory is still 303.0 MB. Free memory was 262.1 MB in the beginning and 252.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 36.21 ms. Allocated memory is still 303.0 MB. Free memory was 252.2 MB in the beginning and 250.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 189.27 ms. Allocated memory is still 303.0 MB. Free memory was 250.2 MB in the beginning and 235.6 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 6584.02 ms. Allocated memory was 303.0 MB in the beginning and 545.8 MB in the end (delta: 242.7 MB). Free memory was 235.6 MB in the beginning and 493.7 MB in the end (delta: -258.2 MB). Peak memory consumption was 160.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 18 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 146 LocStat_NO_SUPPORTING_DISEQUALITIES : 12 LocStat_NO_DISJUNCTIONS : -36 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 25 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 44 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 26 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.386706 RENAME_VARIABLES(MILLISECONDS) : 0.264666 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.333392 PROJECTAWAY(MILLISECONDS) : 0.242133 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.125400 DISJOIN(MILLISECONDS) : 2.259689 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.305772 ADD_EQUALITY(MILLISECONDS) : 0.035089 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.017200 #CONJOIN_DISJUNCTIVE : 39 #RENAME_VARIABLES : 59 #UNFREEZE : 0 #CONJOIN : 73 #PROJECTAWAY : 56 #ADD_WEAK_EQUALITY : 3 #DISJOIN : 1 #RENAME_VARIABLES_DISJUNCTIVE : 57 #ADD_EQUALITY : 44 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 * 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-25 05:25:39,422 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:39,423 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:39,423 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:39,423 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:39,423 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:39,423 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:39,424 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:39,424 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:39,424 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:39,424 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:39,425 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:39,425 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:39,425 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:39,425 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:39,425 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:39,426 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:39,426 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:39,429 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:39,429 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:39,429 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:39,429 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:39,430 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:39,430 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:39,430 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:39,430 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:39,430 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:39,431 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:39,431 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:39,431 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:39,431 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:39,431 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:39,432 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:39,432 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:25:39,432 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((1 < \old(n) || !(unknown-#length-unknown[s] == \old(n))) || (n <= 1 && p == 0)) || !(0 == s)) || !(\valid[s] == 1)) || unknown-#length-unknown[s] < 1) && (((((((\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)) || unknown-#length-unknown[s] < \old(n)) || !(\valid[s] == 1)) || unknown-#length-unknown[s] < 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])) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 31 locations, 3 error locations. SAFE Result, 6.5s OverallTime, 6 OverallIterations, 3 TraceHistogramMax, 1.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s 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, 119 SyntacticMatches, 14 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1178 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.3s AbstIntTime, 1 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, 490 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 205 NumberOfCodeBlocks, 205 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 281 ConstructedInterpolants, 4 QuantifiedInterpolants, 63005 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_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_05-25-39-437.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_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_05-25-39-437.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_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_05-25-39-437.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_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_05-25-39-437.csv Received shutdown request...