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_cbzero-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 12:50:10,728 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 12:50:10,729 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 12:50:10,745 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 12:50:10,745 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 12:50:10,746 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 12:50:10,747 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 12:50:10,749 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 12:50:10,751 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 12:50:10,752 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 12:50:10,753 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 12:50:10,753 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 12:50:10,754 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 12:50:10,755 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 12:50:10,756 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 12:50:10,758 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 12:50:10,760 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 12:50:10,762 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 12:50:10,764 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 12:50:10,765 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 12:50:10,767 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 12:50:10,768 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 12:50:10,768 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 12:50:10,769 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 12:50:10,770 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 12:50:10,771 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 12:50:10,771 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 12:50:10,772 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 12:50:10,772 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 12:50:10,772 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 12:50:10,773 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 12:50:10,773 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:10,781 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 12:50:10,782 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 12:50:10,783 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 12:50:10,783 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 12:50:10,783 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 12:50:10,783 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 12:50:10,783 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 12:50:10,784 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 12:50:10,784 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 12:50:10,784 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 12:50:10,784 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 12:50:10,784 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 12:50:10,784 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 12:50:10,784 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 12:50:10,785 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 12:50:10,785 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 12:50:10,785 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 12:50:10,785 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 12:50:10,785 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 12:50:10,785 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 12:50:10,785 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 12:50:10,786 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 12:50:10,786 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 12:50:10,786 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:50:10,786 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 12:50:10,786 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 12:50:10,787 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 12:50:10,787 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 12:50:10,787 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-01-24 12:50:10,787 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 12:50:10,787 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 12:50:10,787 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 12:50:10,788 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 12:50:10,788 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 12:50:10,821 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 12:50:10,833 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 12:50:10,836 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 12:50:10,837 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 12:50:10,837 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 12:50:10,838 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cbzero-alloca_true-valid-memsafety_true-termination.i [2018-01-24 12:50:10,979 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 12:50:10,983 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 12:50:10,984 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 12:50:10,984 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 12:50:10,988 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 12:50:10,989 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:50:10" (1/1) ... [2018-01-24 12:50:10,992 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6193682 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:50:10, skipping insertion in model container [2018-01-24 12:50:10,992 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:50:10" (1/1) ... [2018-01-24 12:50:11,009 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:50:11,048 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:50:11,164 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:50:11,182 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:50:11,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:50:11 WrapperNode [2018-01-24 12:50:11,188 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 12:50:11,189 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 12:50:11,189 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 12:50:11,189 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 12:50:11,205 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:11" (1/1) ... [2018-01-24 12:50:11,205 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:11" (1/1) ... [2018-01-24 12:50:11,214 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:11" (1/1) ... [2018-01-24 12:50:11,214 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:11" (1/1) ... [2018-01-24 12:50:11,218 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:11" (1/1) ... [2018-01-24 12:50:11,221 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:11" (1/1) ... [2018-01-24 12:50:11,222 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:11" (1/1) ... [2018-01-24 12:50:11,224 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 12:50:11,225 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 12:50:11,225 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 12:50:11,225 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 12:50:11,226 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:50:11" (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:11,270 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 12:50:11,270 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 12:50:11,271 INFO L136 BoogieDeclarations]: Found implementation of procedure cbzero [2018-01-24 12:50:11,271 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 12:50:11,271 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 12:50:11,271 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 12:50:11,271 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 12:50:11,271 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 12:50:11,271 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 12:50:11,271 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 12:50:11,271 INFO L128 BoogieDeclarations]: Found specification of procedure cbzero [2018-01-24 12:50:11,272 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 12:50:11,272 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 12:50:11,272 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 12:50:11,429 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 12:50:11,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:50:11 BoogieIcfgContainer [2018-01-24 12:50:11,429 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 12:50:11,430 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 12:50:11,430 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 12:50:11,431 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 12:50:11,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 12:50:10" (1/3) ... [2018-01-24 12:50:11,432 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62c5dafc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:50:11, skipping insertion in model container [2018-01-24 12:50:11,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:50:11" (2/3) ... [2018-01-24 12:50:11,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62c5dafc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:50:11, skipping insertion in model container [2018-01-24 12:50:11,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:50:11" (3/3) ... [2018-01-24 12:50:11,434 INFO L105 eAbstractionObserver]: Analyzing ICFG openbsd_cbzero-alloca_true-valid-memsafety_true-termination.i [2018-01-24 12:50:11,441 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 12:50:11,446 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-24 12:50:11,480 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 12:50:11,480 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 12:50:11,480 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 12:50:11,480 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 12:50:11,480 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 12:50:11,480 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 12:50:11,480 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 12:50:11,480 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 12:50:11,481 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 12:50:11,501 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-01-24 12:50:11,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-24 12:50:11,507 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:50:11,508 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:50:11,508 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 12:50:11,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1815231445, now seen corresponding path program 1 times [2018-01-24 12:50:11,514 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:50:11,559 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:11,559 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:50:11,559 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:11,559 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:50:11,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:50:11,609 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:11,682 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:11,693 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:50:11,693 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:50:11,693 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:50:11,697 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:50:11,711 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:50:11,712 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:50:11,714 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 4 states. [2018-01-24 12:50:11,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:50:11,792 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-01-24 12:50:11,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:50:11,794 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-01-24 12:50:11,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:50:11,804 INFO L225 Difference]: With dead ends: 43 [2018-01-24 12:50:11,804 INFO L226 Difference]: Without dead ends: 29 [2018-01-24 12:50:11,864 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:11,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-01-24 12:50:11,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-01-24 12:50:11,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-01-24 12:50:11,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2018-01-24 12:50:11,893 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 10 [2018-01-24 12:50:11,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:50:11,893 INFO L432 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-01-24 12:50:11,893 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:50:11,893 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-01-24 12:50:11,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-24 12:50:11,894 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:50:11,894 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:50:11,894 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 12:50:11,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1815233367, now seen corresponding path program 1 times [2018-01-24 12:50:11,894 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:50:11,895 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:11,895 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:50:11,895 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:11,895 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:50:11,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:50:11,904 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:11,936 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:11,936 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:50:11,937 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 12:50:11,937 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:50:11,938 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 12:50:11,939 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 12:50:11,939 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:50:11,939 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 3 states. [2018-01-24 12:50:11,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:50:11,976 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-01-24 12:50:11,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 12:50:11,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-01-24 12:50:11,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:50:11,977 INFO L225 Difference]: With dead ends: 29 [2018-01-24 12:50:11,978 INFO L226 Difference]: Without dead ends: 27 [2018-01-24 12:50:11,978 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:50:11,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-01-24 12:50:11,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-01-24 12:50:11,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-01-24 12:50:11,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-01-24 12:50:11,984 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 10 [2018-01-24 12:50:11,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:50:11,984 INFO L432 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-01-24 12:50:11,984 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 12:50:11,984 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-01-24 12:50:11,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 12:50:11,985 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:50:11,985 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:50:11,985 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 12:50:11,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1377281886, now seen corresponding path program 1 times [2018-01-24 12:50:11,985 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:50:11,986 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:11,986 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:50:11,987 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:11,987 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:50:12,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:50:12,010 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:12,102 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:12,103 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:50:12,103 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 12:50:12,103 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:50:12,103 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 12:50:12,104 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 12:50:12,104 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:50:12,106 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 7 states. [2018-01-24 12:50:12,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:50:12,198 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2018-01-24 12:50:12,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 12:50:12,198 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-01-24 12:50:12,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:50:12,199 INFO L225 Difference]: With dead ends: 26 [2018-01-24 12:50:12,199 INFO L226 Difference]: Without dead ends: 25 [2018-01-24 12:50:12,199 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-01-24 12:50:12,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-01-24 12:50:12,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-01-24 12:50:12,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-01-24 12:50:12,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-01-24 12:50:12,203 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 16 [2018-01-24 12:50:12,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:50:12,203 INFO L432 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-01-24 12:50:12,203 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 12:50:12,204 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-01-24 12:50:12,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 12:50:12,204 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:50:12,204 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:50:12,204 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 12:50:12,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1377281887, now seen corresponding path program 1 times [2018-01-24 12:50:12,205 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:50:12,205 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:12,205 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:50:12,206 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:12,206 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:50:12,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:50:12,222 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:12,367 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:12,368 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:50:12,368 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 12:50:12,368 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:50:12,368 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:50:12,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:50:12,369 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:50:12,371 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 8 states. [2018-01-24 12:50:12,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:50:12,546 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-01-24 12:50:12,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 12:50:12,547 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-01-24 12:50:12,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:50:12,550 INFO L225 Difference]: With dead ends: 32 [2018-01-24 12:50:12,550 INFO L226 Difference]: Without dead ends: 31 [2018-01-24 12:50:12,551 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-01-24 12:50:12,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-01-24 12:50:12,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2018-01-24 12:50:12,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-01-24 12:50:12,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-01-24 12:50:12,557 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 16 [2018-01-24 12:50:12,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:50:12,557 INFO L432 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-01-24 12:50:12,557 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:50:12,558 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-01-24 12:50:12,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 12:50:12,558 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:50:12,558 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:50:12,559 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 12:50:12,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1525480681, now seen corresponding path program 1 times [2018-01-24 12:50:12,559 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:50:12,560 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:12,560 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:50:12,560 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:12,560 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:50:12,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:50:12,580 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:12,677 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:50:12,677 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:50:12,678 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:12,685 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:50:12,685 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:50:12,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:50:12,725 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:50:12,775 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:50:12,775 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:50:12,874 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:50:12,908 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:50:12,908 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:12,912 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:50:12,912 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:50:12,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:50:12,947 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:50:12,959 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:50:12,959 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:50:12,974 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:50:12,975 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 12:50:12,975 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7] total 13 [2018-01-24 12:50:12,975 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 12:50:12,975 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:50:12,975 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:50:12,976 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-01-24 12:50:12,976 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 8 states. [2018-01-24 12:50:13,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:50:13,091 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-01-24 12:50:13,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 12:50:13,093 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-01-24 12:50:13,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:50:13,094 INFO L225 Difference]: With dead ends: 60 [2018-01-24 12:50:13,094 INFO L226 Difference]: Without dead ends: 48 [2018-01-24 12:50:13,095 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2018-01-24 12:50:13,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-24 12:50:13,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 41. [2018-01-24 12:50:13,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-24 12:50:13,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-01-24 12:50:13,105 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 20 [2018-01-24 12:50:13,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:50:13,105 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-01-24 12:50:13,105 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:50:13,105 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-01-24 12:50:13,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 12:50:13,106 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:50:13,107 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:50:13,107 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 12:50:13,107 INFO L82 PathProgramCache]: Analyzing trace with hash -2112286695, now seen corresponding path program 1 times [2018-01-24 12:50:13,107 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:50:13,108 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:13,108 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:50:13,108 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:13,109 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:50:13,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:50:13,126 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:13,289 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:50:13,289 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:50:13,289 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:13,299 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:50:13,299 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:50:13,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:50:13,320 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:50:13,341 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:50:13,341 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:50:13,466 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:50:13,498 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:50:13,498 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:13,502 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:50:13,502 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:50:13,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:50:13,532 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:50:13,541 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:50:13,542 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:50:13,555 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:50:13,560 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 12:50:13,561 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9, 9] total 16 [2018-01-24 12:50:13,561 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 12:50:13,561 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 12:50:13,561 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 12:50:13,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-01-24 12:50:13,562 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 10 states. [2018-01-24 12:50:13,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:50:13,718 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2018-01-24 12:50:13,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 12:50:13,718 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-01-24 12:50:13,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:50:13,720 INFO L225 Difference]: With dead ends: 85 [2018-01-24 12:50:13,720 INFO L226 Difference]: Without dead ends: 73 [2018-01-24 12:50:13,721 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2018-01-24 12:50:13,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-24 12:50:13,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 42. [2018-01-24 12:50:13,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-24 12:50:13,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-01-24 12:50:13,731 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 20 [2018-01-24 12:50:13,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:50:13,731 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-01-24 12:50:13,731 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 12:50:13,731 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-01-24 12:50:13,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 12:50:13,732 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:50:13,732 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:50:13,732 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 12:50:13,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1171563351, now seen corresponding path program 1 times [2018-01-24 12:50:13,732 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:50:13,733 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:13,733 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:50:13,733 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:13,733 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:50:13,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:50:13,746 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:13,928 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:50:13,928 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:50:13,929 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:50:13,936 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:50:13,936 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:50:13,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:50:13,952 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:50:13,970 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:13,972 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:50:13,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:50:13,977 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2018-01-24 12:50:14,151 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:50:14,152 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:50:14,433 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:50:14,453 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:50:14,453 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 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 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 12:50:14,456 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:50:14,456 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:50:14,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:50:14,486 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:50:14,490 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:14,490 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:50:14,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:50:14,496 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2018-01-24 12:50:14,575 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:50:14,575 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:50:14,652 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:50:14,653 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 12:50:14,653 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12, 12, 12] total 34 [2018-01-24 12:50:14,653 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 12:50:14,654 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-24 12:50:14,654 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-24 12:50:14,654 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1060, Unknown=0, NotChecked=0, Total=1190 [2018-01-24 12:50:14,654 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 22 states. [2018-01-24 12:50:15,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:50:15,006 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2018-01-24 12:50:15,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 12:50:15,006 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 20 [2018-01-24 12:50:15,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:50:15,007 INFO L225 Difference]: With dead ends: 52 [2018-01-24 12:50:15,007 INFO L226 Difference]: Without dead ends: 51 [2018-01-24 12:50:15,008 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 52 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=225, Invalid=1667, Unknown=0, NotChecked=0, Total=1892 [2018-01-24 12:50:15,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-24 12:50:15,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2018-01-24 12:50:15,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-24 12:50:15,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-01-24 12:50:15,014 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 20 [2018-01-24 12:50:15,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:50:15,014 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-01-24 12:50:15,014 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-24 12:50:15,014 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-01-24 12:50:15,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 12:50:15,015 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:50:15,015 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:50:15,015 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 12:50:15,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1556914830, now seen corresponding path program 1 times [2018-01-24 12:50:15,015 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:50:15,016 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:15,016 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:50:15,016 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:15,016 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:50:15,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:50:15,023 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:15,069 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:15,069 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:50:15,069 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 12:50:15,069 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:50:15,070 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:50:15,070 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:50:15,070 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:50:15,070 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 6 states. [2018-01-24 12:50:15,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:50:15,100 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2018-01-24 12:50:15,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:50:15,101 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-01-24 12:50:15,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:50:15,102 INFO L225 Difference]: With dead ends: 64 [2018-01-24 12:50:15,102 INFO L226 Difference]: Without dead ends: 59 [2018-01-24 12:50:15,102 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:50:15,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-24 12:50:15,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 52. [2018-01-24 12:50:15,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-24 12:50:15,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2018-01-24 12:50:15,109 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 21 [2018-01-24 12:50:15,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:50:15,110 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2018-01-24 12:50:15,110 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:50:15,110 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2018-01-24 12:50:15,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 12:50:15,111 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:50:15,111 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:50:15,111 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 12:50:15,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1726935216, now seen corresponding path program 1 times [2018-01-24 12:50:15,112 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:50:15,112 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:15,112 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:50:15,112 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:15,113 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:50:15,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:50:15,121 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:15,172 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:15,172 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:50:15,172 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:50:15,173 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:50:15,173 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:50:15,173 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:50:15,174 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:50:15,174 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 4 states. [2018-01-24 12:50:15,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:50:15,227 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2018-01-24 12:50:15,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:50:15,227 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-01-24 12:50:15,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:50:15,228 INFO L225 Difference]: With dead ends: 52 [2018-01-24 12:50:15,228 INFO L226 Difference]: Without dead ends: 25 [2018-01-24 12:50:15,229 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:15,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-01-24 12:50:15,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-01-24 12:50:15,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-01-24 12:50:15,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-01-24 12:50:15,236 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 21 [2018-01-24 12:50:15,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:50:15,236 INFO L432 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-01-24 12:50:15,236 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:50:15,237 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-01-24 12:50:15,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 12:50:15,237 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:50:15,237 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:50:15,237 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 12:50:15,238 INFO L82 PathProgramCache]: Analyzing trace with hash 964772623, now seen corresponding path program 2 times [2018-01-24 12:50:15,238 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:50:15,238 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:15,239 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:50:15,239 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:15,239 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:50:15,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:50:15,254 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:15,562 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:50:15,563 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:50:15,563 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:50:15,569 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:50:15,569 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 12:50:15,581 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:50:15,585 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:50:15,588 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:50:15,591 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:50:15,595 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:15,595 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:50:15,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:50:15,601 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2018-01-24 12:50:15,887 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:50:15,887 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:50:16,719 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:50:16,739 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:50:16,739 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 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 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 12:50:16,743 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:50:16,743 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 12:50:16,754 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:50:16,767 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:50:16,783 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:50:16,787 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:50:16,791 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:16,791 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:50:16,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:50:16,795 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2018-01-24 12:50:16,932 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:50:16,932 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:50:17,069 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:50:17,070 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 12:50:17,071 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14, 14, 14] total 41 [2018-01-24 12:50:17,071 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 12:50:17,071 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-24 12:50:17,071 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-24 12:50:17,072 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1554, Unknown=0, NotChecked=0, Total=1722 [2018-01-24 12:50:17,072 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 27 states. [2018-01-24 12:50:17,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:50:17,723 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-01-24 12:50:17,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-24 12:50:17,723 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 24 [2018-01-24 12:50:17,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:50:17,723 INFO L225 Difference]: With dead ends: 30 [2018-01-24 12:50:17,723 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 12:50:17,725 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 64 SyntacticMatches, 5 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 822 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=336, Invalid=2744, Unknown=0, NotChecked=0, Total=3080 [2018-01-24 12:50:17,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 12:50:17,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 12:50:17,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 12:50:17,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 12:50:17,725 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2018-01-24 12:50:17,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:50:17,725 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 12:50:17,725 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-24 12:50:17,726 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 12:50:17,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 12:50:17,729 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 12:50:17,969 WARN L146 SmtUtils]: Spent 161ms on a formula simplification. DAG size of input: 63 DAG size of output 46 [2018-01-24 12:50:18,005 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 560) no Hoare annotation was computed. [2018-01-24 12:50:18,005 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 560) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 12:50:18,005 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 560) no Hoare annotation was computed. [2018-01-24 12:50:18,005 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 560) the Hoare annotation is: true [2018-01-24 12:50:18,005 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 560) no Hoare annotation was computed. [2018-01-24 12:50:18,005 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 560) the Hoare annotation is: true [2018-01-24 12:50:18,005 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 560) no Hoare annotation was computed. [2018-01-24 12:50:18,005 INFO L401 ceAbstractionStarter]: For program point L544'''(lines 544 545) no Hoare annotation was computed. [2018-01-24 12:50:18,005 INFO L401 ceAbstractionStarter]: For program point cbzeroEXIT(lines 540 546) no Hoare annotation was computed. [2018-01-24 12:50:18,005 INFO L404 ceAbstractionStarter]: At program point cbzeroENTRY(lines 540 546) the Hoare annotation is: true [2018-01-24 12:50:18,006 INFO L401 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-01-24 12:50:18,006 INFO L401 ceAbstractionStarter]: For program point L544(lines 544 545) no Hoare annotation was computed. [2018-01-24 12:50:18,006 INFO L401 ceAbstractionStarter]: For program point cbzeroErr0RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-24 12:50:18,006 INFO L401 ceAbstractionStarter]: For program point L545'(line 545) no Hoare annotation was computed. [2018-01-24 12:50:18,006 INFO L397 ceAbstractionStarter]: At program point L544''(lines 544 545) the Hoare annotation is: (let ((.cse1 (= 0 cbzero_~p~2.offset)) (.cse0 (not (= 0 |cbzero_#in~b.offset|))) (.cse3 (<= cbzero_~p~2.offset 1)) (.cse2 (< |cbzero_#in~length| 1)) (.cse4 (< (select |#length| |cbzero_#in~b.base|) |cbzero_#in~length|)) (.cse5 (not (= (select |#valid| |cbzero_#in~b.base|) 1)))) (and (or (< 1 |cbzero_#in~length|) .cse0 .cse1 .cse2 (and .cse3 (<= cbzero_~length 0)) .cse4 .cse5) (let ((.cse7 (select |#length| cbzero_~p~2.base)) (.cse6 (= 1 (select |#valid| cbzero_~p~2.base))) (.cse8 (<= 0 cbzero_~length))) (or (and .cse6 (<= cbzero_~length |cbzero_#in~length|) (<= |cbzero_#in~length| cbzero_~length) .cse1 (<= cbzero_~length .cse7)) .cse0 (and (<= (+ cbzero_~length 1) .cse7) .cse3 .cse6 (<= 1 cbzero_~p~2.offset) .cse8) .cse2 .cse4 .cse5 (and (<= 2 cbzero_~p~2.offset) (<= (+ cbzero_~length cbzero_~p~2.offset) .cse7) .cse6 .cse8))))) [2018-01-24 12:50:18,006 INFO L401 ceAbstractionStarter]: For program point cbzeroErr1RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-24 12:50:18,006 INFO L401 ceAbstractionStarter]: For program point L550(lines 550 552) no Hoare annotation was computed. [2018-01-24 12:50:18,006 INFO L401 ceAbstractionStarter]: For program point L553'(lines 553 555) no Hoare annotation was computed. [2018-01-24 12:50:18,006 INFO L401 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-01-24 12:50:18,007 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 547 560) no Hoare annotation was computed. [2018-01-24 12:50:18,007 INFO L397 ceAbstractionStarter]: At program point L558(line 558) the Hoare annotation is: (and (= 0 |main_#t~malloc5.offset|) (<= 1 main_~n~4) (= 1 (select |#valid| main_~nondetArea~4.base)) (= 0 main_~nondetArea~4.offset) (<= main_~n~4 main_~length~4) (<= main_~n~4 (select |#length| main_~nondetArea~4.base)) (= 1 (select |#valid| |main_#t~malloc5.base|)) (<= main_~n~4 (select |#length| |main_#t~malloc5.base|)) (= (store |#valid| |main_#t~malloc5.base| (select (store |#valid| |main_#t~malloc5.base| 0) |main_#t~malloc5.base|)) |old(#valid)|)) [2018-01-24 12:50:18,007 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 547 560) no Hoare annotation was computed. [2018-01-24 12:50:18,007 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 547 560) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 12:50:18,007 INFO L401 ceAbstractionStarter]: For program point L557'''(line 557) no Hoare annotation was computed. [2018-01-24 12:50:18,007 INFO L401 ceAbstractionStarter]: For program point L550''(lines 550 552) no Hoare annotation was computed. [2018-01-24 12:50:18,007 INFO L401 ceAbstractionStarter]: For program point L557'(line 557) no Hoare annotation was computed. [2018-01-24 12:50:18,007 INFO L401 ceAbstractionStarter]: For program point L558'(line 558) no Hoare annotation was computed. [2018-01-24 12:50:18,008 INFO L401 ceAbstractionStarter]: For program point L557''(line 557) no Hoare annotation was computed. [2018-01-24 12:50:18,008 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 547 560) no Hoare annotation was computed. [2018-01-24 12:50:18,016 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:18,017 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:18,017 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:18,017 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:18,018 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:18,022 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:18,022 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:18,022 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:18,023 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:18,023 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:18,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 12:50:18 BoogieIcfgContainer [2018-01-24 12:50:18,026 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 12:50:18,027 INFO L168 Benchmark]: Toolchain (without parser) took 7047.23 ms. Allocated memory was 307.8 MB in the beginning and 546.8 MB in the end (delta: 239.1 MB). Free memory was 267.8 MB in the beginning and 464.2 MB in the end (delta: -196.4 MB). Peak memory consumption was 177.2 MB. Max. memory is 5.3 GB. [2018-01-24 12:50:18,029 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 307.8 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 12:50:18,029 INFO L168 Benchmark]: CACSL2BoogieTranslator took 204.85 ms. Allocated memory is still 307.8 MB. Free memory was 266.8 MB in the beginning and 256.7 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-24 12:50:18,029 INFO L168 Benchmark]: Boogie Preprocessor took 35.00 ms. Allocated memory is still 307.8 MB. Free memory was 256.7 MB in the beginning and 255.7 MB in the end (delta: 996.3 kB). Peak memory consumption was 996.3 kB. Max. memory is 5.3 GB. [2018-01-24 12:50:18,029 INFO L168 Benchmark]: RCFGBuilder took 204.79 ms. Allocated memory is still 307.8 MB. Free memory was 255.7 MB in the beginning and 241.2 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 5.3 GB. [2018-01-24 12:50:18,030 INFO L168 Benchmark]: TraceAbstraction took 6596.07 ms. Allocated memory was 307.8 MB in the beginning and 546.8 MB in the end (delta: 239.1 MB). Free memory was 241.2 MB in the beginning and 464.2 MB in the end (delta: -223.0 MB). Peak memory consumption was 150.5 MB. Max. memory is 5.3 GB. [2018-01-24 12:50:18,031 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.11 ms. Allocated memory is still 307.8 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 204.85 ms. Allocated memory is still 307.8 MB. Free memory was 266.8 MB in the beginning and 256.7 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 35.00 ms. Allocated memory is still 307.8 MB. Free memory was 256.7 MB in the beginning and 255.7 MB in the end (delta: 996.3 kB). Peak memory consumption was 996.3 kB. Max. memory is 5.3 GB. * RCFGBuilder took 204.79 ms. Allocated memory is still 307.8 MB. Free memory was 255.7 MB in the beginning and 241.2 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 6596.07 ms. Allocated memory was 307.8 MB in the beginning and 546.8 MB in the end (delta: 239.1 MB). Free memory was 241.2 MB in the beginning and 464.2 MB in the end (delta: -223.0 MB). Peak memory consumption was 150.5 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 * 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: 547]: 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: 544]: Loop Invariant [2018-01-24 12:50:18,036 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:18,037 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:18,037 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:18,037 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:18,037 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:18,040 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:18,040 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:18,040 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:18,041 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:18,041 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((1 < \old(length) || !(0 == b)) || 0 == p) || \old(length) < 1) || (p <= 1 && length <= 0)) || unknown-#length-unknown[b] < \old(length)) || !(\valid[b] == 1)) && ((((((((((1 == \valid[p] && length <= \old(length)) && \old(length) <= length) && 0 == p) && length <= unknown-#length-unknown[p]) || !(0 == b)) || ((((length + 1 <= unknown-#length-unknown[p] && p <= 1) && 1 == \valid[p]) && 1 <= p) && 0 <= length)) || \old(length) < 1) || unknown-#length-unknown[b] < \old(length)) || !(\valid[b] == 1)) || (((2 <= p && length + p <= unknown-#length-unknown[p]) && 1 == \valid[p]) && 0 <= length)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 29 locations, 3 error locations. SAFE Result, 6.5s OverallTime, 10 OverallIterations, 3 TraceHistogramMax, 1.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 223 SDtfs, 214 SDslu, 913 SDs, 0 SdLazy, 676 SolverSat, 74 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 440 GetRequests, 268 SyntacticMatches, 14 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1440 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=8, 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, 10 MinimizatonAttempts, 56 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 11 PreInvPairs, 20 NumberOfFragments, 171 HoareAnnotationTreeSize, 11 FomulaSimplifications, 236 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 372 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 346 NumberOfCodeBlocks, 346 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 488 ConstructedInterpolants, 4 QuantifiedInterpolants, 74178 SizeOfPredicates, 71 NumberOfNonLiveVariables, 850 ConjunctsInSsa, 258 ConjunctsInUnsatCore, 26 InterpolantComputations, 6 PerfectInterpolantSequences, 10/95 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_cbzero-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-18-046.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cbzero-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-18-046.csv Received shutdown request...