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/count_down-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 12:44:57,116 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 12:44:57,118 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 12:44:57,130 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 12:44:57,131 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 12:44:57,132 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 12:44:57,133 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 12:44:57,135 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 12:44:57,137 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 12:44:57,137 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 12:44:57,138 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 12:44:57,138 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 12:44:57,139 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 12:44:57,140 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 12:44:57,141 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 12:44:57,143 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 12:44:57,145 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 12:44:57,147 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 12:44:57,148 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 12:44:57,149 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 12:44:57,151 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 12:44:57,152 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 12:44:57,152 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 12:44:57,153 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 12:44:57,154 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 12:44:57,155 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 12:44:57,155 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 12:44:57,156 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 12:44:57,156 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 12:44:57,156 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 12:44:57,157 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 12:44:57,157 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:44:57,167 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 12:44:57,167 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 12:44:57,168 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 12:44:57,168 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 12:44:57,169 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 12:44:57,169 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 12:44:57,169 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 12:44:57,170 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 12:44:57,170 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 12:44:57,170 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 12:44:57,170 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 12:44:57,171 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 12:44:57,171 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 12:44:57,171 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 12:44:57,171 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 12:44:57,171 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 12:44:57,172 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 12:44:57,172 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 12:44:57,172 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 12:44:57,172 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 12:44:57,172 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 12:44:57,173 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 12:44:57,173 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 12:44:57,173 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:44:57,173 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 12:44:57,174 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 12:44:57,174 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 12:44:57,174 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 12:44:57,174 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-01-24 12:44:57,174 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 12:44:57,175 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 12:44:57,175 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 12:44:57,176 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 12:44:57,176 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 12:44:57,210 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 12:44:57,223 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 12:44:57,227 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 12:44:57,229 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 12:44:57,229 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 12:44:57,230 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/count_down-alloca_true-valid-memsafety_true-termination.i [2018-01-24 12:44:57,417 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 12:44:57,423 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 12:44:57,424 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 12:44:57,424 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 12:44:57,428 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 12:44:57,429 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:44:57" (1/1) ... [2018-01-24 12:44:57,431 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@577bb5b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:44:57, skipping insertion in model container [2018-01-24 12:44:57,431 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:44:57" (1/1) ... [2018-01-24 12:44:57,449 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:44:57,489 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:44:57,597 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:44:57,612 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:44:57,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:44:57 WrapperNode [2018-01-24 12:44:57,619 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 12:44:57,620 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 12:44:57,620 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 12:44:57,620 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 12:44:57,633 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:44:57" (1/1) ... [2018-01-24 12:44:57,633 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:44:57" (1/1) ... [2018-01-24 12:44:57,643 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:44:57" (1/1) ... [2018-01-24 12:44:57,643 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:44:57" (1/1) ... [2018-01-24 12:44:57,646 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:44:57" (1/1) ... [2018-01-24 12:44:57,650 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:44:57" (1/1) ... [2018-01-24 12:44:57,651 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:44:57" (1/1) ... [2018-01-24 12:44:57,652 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 12:44:57,652 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 12:44:57,652 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 12:44:57,653 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 12:44:57,653 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:44:57" (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:44:57,699 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 12:44:57,699 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 12:44:57,699 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 12:44:57,699 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 12:44:57,699 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 12:44:57,700 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 12:44:57,700 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 12:44:57,700 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 12:44:57,700 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 12:44:57,700 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 12:44:57,700 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 12:44:57,701 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 12:44:57,907 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 12:44:57,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:44:57 BoogieIcfgContainer [2018-01-24 12:44:57,909 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 12:44:57,909 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 12:44:57,909 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 12:44:57,911 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 12:44:57,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 12:44:57" (1/3) ... [2018-01-24 12:44:57,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76332de2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:44:57, skipping insertion in model container [2018-01-24 12:44:57,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:44:57" (2/3) ... [2018-01-24 12:44:57,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76332de2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:44:57, skipping insertion in model container [2018-01-24 12:44:57,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:44:57" (3/3) ... [2018-01-24 12:44:57,914 INFO L105 eAbstractionObserver]: Analyzing ICFG count_down-alloca_true-valid-memsafety_true-termination.i [2018-01-24 12:44:57,920 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 12:44:57,926 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-24 12:44:57,969 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 12:44:57,969 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 12:44:57,969 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 12:44:57,970 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 12:44:57,970 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 12:44:57,970 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 12:44:57,970 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 12:44:57,970 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 12:44:57,971 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 12:44:57,988 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-01-24 12:44:57,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 12:44:57,993 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:44:57,994 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:44:57,994 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-24 12:44:58,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1460855103, now seen corresponding path program 1 times [2018-01-24 12:44:58,003 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:44:58,047 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:44:58,048 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:44:58,048 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:44:58,048 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:44:58,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:44:58,100 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:44:58,175 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:44:58,177 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:44:58,177 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:44:58,178 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:44:58,181 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:44:58,195 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:44:58,196 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:44:58,198 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 4 states. [2018-01-24 12:44:58,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:44:58,366 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2018-01-24 12:44:58,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:44:58,367 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-24 12:44:58,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:44:58,376 INFO L225 Difference]: With dead ends: 69 [2018-01-24 12:44:58,377 INFO L226 Difference]: Without dead ends: 39 [2018-01-24 12:44:58,380 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:44:58,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-01-24 12:44:58,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-01-24 12:44:58,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-01-24 12:44:58,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-01-24 12:44:58,410 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 13 [2018-01-24 12:44:58,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:44:58,410 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-01-24 12:44:58,410 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:44:58,411 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-01-24 12:44:58,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 12:44:58,411 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:44:58,411 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:44:58,411 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-24 12:44:58,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1955174720, now seen corresponding path program 1 times [2018-01-24 12:44:58,412 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:44:58,412 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:44:58,413 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:44:58,413 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:44:58,413 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:44:58,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:44:58,427 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:44:58,466 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:44:58,466 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:44:58,466 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:44:58,466 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:44:58,468 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:44:58,469 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:44:58,469 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:44:58,469 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 4 states. [2018-01-24 12:44:58,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:44:58,550 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-01-24 12:44:58,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:44:58,551 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 12:44:58,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:44:58,552 INFO L225 Difference]: With dead ends: 39 [2018-01-24 12:44:58,552 INFO L226 Difference]: Without dead ends: 35 [2018-01-24 12:44:58,553 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:44:58,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-01-24 12:44:58,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-01-24 12:44:58,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-01-24 12:44:58,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-01-24 12:44:58,561 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 14 [2018-01-24 12:44:58,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:44:58,562 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-01-24 12:44:58,562 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:44:58,562 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-01-24 12:44:58,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 12:44:58,562 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:44:58,563 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:44:58,563 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-24 12:44:58,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1955174719, now seen corresponding path program 1 times [2018-01-24 12:44:58,563 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:44:58,564 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:44:58,564 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:44:58,565 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:44:58,565 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:44:58,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:44:58,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:44:58,785 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:44:58,786 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:44:58,786 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 12:44:58,786 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:44:58,786 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 12:44:58,787 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 12:44:58,787 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:44:58,787 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 7 states. [2018-01-24 12:44:58,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:44:58,945 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2018-01-24 12:44:58,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 12:44:58,946 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-01-24 12:44:58,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:44:58,946 INFO L225 Difference]: With dead ends: 60 [2018-01-24 12:44:58,946 INFO L226 Difference]: Without dead ends: 40 [2018-01-24 12:44:58,947 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:44:58,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-24 12:44:58,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-01-24 12:44:58,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-01-24 12:44:58,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-01-24 12:44:58,954 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 14 [2018-01-24 12:44:58,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:44:58,955 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-01-24 12:44:58,955 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 12:44:58,955 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-01-24 12:44:58,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 12:44:58,956 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:44:58,956 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:44:58,956 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-24 12:44:58,956 INFO L82 PathProgramCache]: Analyzing trace with hash -2068353263, now seen corresponding path program 1 times [2018-01-24 12:44:58,956 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:44:58,957 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:44:58,957 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:44:58,957 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:44:58,957 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:44:58,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:44:58,970 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:44:59,006 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:44:59,007 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:44:59,007 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:44:59,012 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:44:59,012 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:44:59,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:44:59,033 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:44:59,069 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:44:59,069 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:44:59,114 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:44:59,146 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:44:59,146 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [5] total 8 [2018-01-24 12:44:59,146 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:44:59,146 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:44:59,147 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:44:59,147 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:44:59,147 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 5 states. [2018-01-24 12:44:59,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:44:59,182 INFO L93 Difference]: Finished difference Result 93 states and 104 transitions. [2018-01-24 12:44:59,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:44:59,183 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-01-24 12:44:59,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:44:59,184 INFO L225 Difference]: With dead ends: 93 [2018-01-24 12:44:59,185 INFO L226 Difference]: Without dead ends: 68 [2018-01-24 12:44:59,185 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:44:59,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-24 12:44:59,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 49. [2018-01-24 12:44:59,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-24 12:44:59,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2018-01-24 12:44:59,195 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 19 [2018-01-24 12:44:59,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:44:59,195 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2018-01-24 12:44:59,196 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:44:59,196 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-01-24 12:44:59,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 12:44:59,197 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:44:59,197 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:44:59,197 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-24 12:44:59,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1639808019, now seen corresponding path program 1 times [2018-01-24 12:44:59,198 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:44:59,199 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:44:59,199 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:44:59,199 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:44:59,199 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:44:59,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:44:59,215 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:44:59,398 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:44:59,398 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:44:59,398 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:44:59,408 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:44:59,408 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:44:59,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:44:59,447 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:44:59,467 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 8 treesize of output 7 [2018-01-24 12:44:59,468 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:44:59,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:44:59,472 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-24 12:44:59,515 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:44:59,516 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:44:59,718 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:44:59,738 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:44:59,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 4 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 4 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 12:44:59,743 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:44:59,743 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:44:59,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:44:59,768 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:44:59,775 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 8 treesize of output 7 [2018-01-24 12:44:59,776 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:44:59,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:44:59,785 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-24 12:44:59,818 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:44:59,818 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:44:59,873 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:44:59,875 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 12:44:59,875 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6] total 12 [2018-01-24 12:44:59,875 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 12:44:59,875 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:44:59,876 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:44:59,876 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-01-24 12:44:59,876 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 8 states. [2018-01-24 12:45:00,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:45:00,007 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2018-01-24 12:45:00,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 12:45:00,008 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-01-24 12:45:00,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:45:00,009 INFO L225 Difference]: With dead ends: 50 [2018-01-24 12:45:00,009 INFO L226 Difference]: Without dead ends: 49 [2018-01-24 12:45:00,010 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 60 SyntacticMatches, 10 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2018-01-24 12:45:00,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-24 12:45:00,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-01-24 12:45:00,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-24 12:45:00,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2018-01-24 12:45:00,018 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 19 [2018-01-24 12:45:00,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:45:00,018 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2018-01-24 12:45:00,018 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:45:00,018 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2018-01-24 12:45:00,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 12:45:00,019 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:45:00,019 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:45:00,019 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-24 12:45:00,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1536064265, now seen corresponding path program 1 times [2018-01-24 12:45:00,020 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:45:00,020 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:45:00,020 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:45:00,021 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:45:00,021 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:45:00,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:45:00,033 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:45:00,192 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:45:00,192 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:45:00,192 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 12:45:00,192 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:45:00,192 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 12:45:00,193 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 12:45:00,193 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:45:00,193 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand 9 states. [2018-01-24 12:45:00,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:45:00,325 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2018-01-24 12:45:00,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 12:45:00,325 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-01-24 12:45:00,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:45:00,326 INFO L225 Difference]: With dead ends: 66 [2018-01-24 12:45:00,326 INFO L226 Difference]: Without dead ends: 63 [2018-01-24 12:45:00,327 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2018-01-24 12:45:00,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-01-24 12:45:00,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 55. [2018-01-24 12:45:00,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-24 12:45:00,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2018-01-24 12:45:00,333 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 22 [2018-01-24 12:45:00,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:45:00,333 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2018-01-24 12:45:00,333 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 12:45:00,333 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2018-01-24 12:45:00,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 12:45:00,334 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:45:00,334 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:45:00,334 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-24 12:45:00,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1312069626, now seen corresponding path program 1 times [2018-01-24 12:45:00,334 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:45:00,335 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:45:00,335 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:45:00,335 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:45:00,335 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:45:00,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:45:00,344 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:45:00,380 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 12:45:00,381 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:45:00,381 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:45:00,381 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:45:00,381 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:45:00,382 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:45:00,382 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:45:00,382 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand 4 states. [2018-01-24 12:45:00,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:45:00,421 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2018-01-24 12:45:00,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:45:00,421 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-01-24 12:45:00,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:45:00,422 INFO L225 Difference]: With dead ends: 61 [2018-01-24 12:45:00,422 INFO L226 Difference]: Without dead ends: 56 [2018-01-24 12:45:00,422 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:45:00,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-01-24 12:45:00,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2018-01-24 12:45:00,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-24 12:45:00,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2018-01-24 12:45:00,429 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 24 [2018-01-24 12:45:00,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:45:00,430 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2018-01-24 12:45:00,430 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:45:00,430 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2018-01-24 12:45:00,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 12:45:00,431 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:45:00,431 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:45:00,431 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-24 12:45:00,432 INFO L82 PathProgramCache]: Analyzing trace with hash 2040947294, now seen corresponding path program 1 times [2018-01-24 12:45:00,432 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:45:00,433 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:45:00,433 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:45:00,433 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:45:00,433 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:45:00,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:45:00,443 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:45:00,641 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:45:00,641 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:45:00,641 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:45:00,648 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:45:00,648 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:45:00,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:45:00,660 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:45:00,753 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 12:45:00,754 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:45:00,775 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 12:45:00,797 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:45:00,797 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [10] total 14 [2018-01-24 12:45:00,797 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:45:00,797 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:45:00,797 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:45:00,798 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-01-24 12:45:00,798 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand 5 states. [2018-01-24 12:45:00,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:45:00,830 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2018-01-24 12:45:00,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:45:00,831 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-01-24 12:45:00,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:45:00,832 INFO L225 Difference]: With dead ends: 91 [2018-01-24 12:45:00,832 INFO L226 Difference]: Without dead ends: 73 [2018-01-24 12:45:00,833 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-01-24 12:45:00,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-24 12:45:00,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 68. [2018-01-24 12:45:00,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-01-24 12:45:00,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2018-01-24 12:45:00,842 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 28 [2018-01-24 12:45:00,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:45:00,842 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2018-01-24 12:45:00,842 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:45:00,843 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2018-01-24 12:45:00,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 12:45:00,844 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:45:00,844 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:45:00,844 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-24 12:45:00,844 INFO L82 PathProgramCache]: Analyzing trace with hash -2035165284, now seen corresponding path program 1 times [2018-01-24 12:45:00,844 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:45:00,845 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:45:00,845 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:45:00,845 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:45:00,846 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:45:00,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:45:00,856 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:45:01,087 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:45:01,088 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:45:01,088 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:45:01,105 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:45:01,106 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:45:01,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:45:01,122 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:45:01,187 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:45:01,188 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:45:01,253 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:45:01,283 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:45:01,284 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:45:01,288 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:45:01,288 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:45:01,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:45:01,311 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:45:01,317 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:45:01,317 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:45:01,344 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:45:01,345 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 12:45:01,345 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7, 7, 7] total 17 [2018-01-24 12:45:01,345 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 12:45:01,346 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 12:45:01,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 12:45:01,346 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2018-01-24 12:45:01,347 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand 15 states. [2018-01-24 12:45:01,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:45:01,724 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2018-01-24 12:45:01,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 12:45:01,724 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-01-24 12:45:01,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:45:01,725 INFO L225 Difference]: With dead ends: 112 [2018-01-24 12:45:01,725 INFO L226 Difference]: Without dead ends: 94 [2018-01-24 12:45:01,726 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 100 SyntacticMatches, 6 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=200, Invalid=670, Unknown=0, NotChecked=0, Total=870 [2018-01-24 12:45:01,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-01-24 12:45:01,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 73. [2018-01-24 12:45:01,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-24 12:45:01,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2018-01-24 12:45:01,733 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 28 [2018-01-24 12:45:01,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:45:01,733 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2018-01-24 12:45:01,733 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 12:45:01,733 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2018-01-24 12:45:01,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 12:45:01,734 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:45:01,734 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:45:01,734 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-24 12:45:01,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1450783205, now seen corresponding path program 1 times [2018-01-24 12:45:01,734 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:45:01,735 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:45:01,735 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:45:01,735 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:45:01,735 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:45:01,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:45:01,748 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:45:01,798 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-24 12:45:01,798 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:45:01,798 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:45:01,798 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:45:01,799 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:45:01,799 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:45:01,799 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:45:01,799 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. Second operand 4 states. [2018-01-24 12:45:01,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:45:01,838 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2018-01-24 12:45:01,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:45:01,840 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-01-24 12:45:01,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:45:01,840 INFO L225 Difference]: With dead ends: 73 [2018-01-24 12:45:01,840 INFO L226 Difference]: Without dead ends: 45 [2018-01-24 12:45:01,841 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:45:01,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-24 12:45:01,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-01-24 12:45:01,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-24 12:45:01,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2018-01-24 12:45:01,852 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 30 [2018-01-24 12:45:01,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:45:01,853 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2018-01-24 12:45:01,853 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:45:01,853 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-01-24 12:45:01,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 12:45:01,854 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:45:01,854 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:45:01,854 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-24 12:45:01,854 INFO L82 PathProgramCache]: Analyzing trace with hash 262979632, now seen corresponding path program 2 times [2018-01-24 12:45:01,855 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:45:01,855 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:45:01,856 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:45:01,856 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:45:01,856 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:45:01,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:45:01,867 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:45:01,951 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-24 12:45:01,952 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:45:01,952 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:45:01,960 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:45:01,961 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 12:45:01,969 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:45:01,973 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:45:01,974 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:45:01,977 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:45:02,099 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:45:02,099 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:45:02,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-24 12:45:02,146 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:45:02,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-01-24 12:45:02,162 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:45:02,164 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:45:02,164 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:11 [2018-01-24 12:45:02,237 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:45:02,258 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:45:02,258 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:45:02,261 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:45:02,262 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 12:45:02,270 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:45:02,280 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:45:02,288 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:45:02,291 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:45:02,425 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:45:02,426 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:45:02,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-01-24 12:45:02,432 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:45:02,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-24 12:45:02,439 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:45:02,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:45:02,442 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:11 [2018-01-24 12:45:02,476 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:45:02,478 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 12:45:02,478 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8, 8, 8] total 28 [2018-01-24 12:45:02,478 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 12:45:02,478 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 12:45:02,479 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 12:45:02,479 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=683, Unknown=0, NotChecked=0, Total=812 [2018-01-24 12:45:02,479 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 15 states. [2018-01-24 12:45:02,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:45:02,772 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2018-01-24 12:45:02,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 12:45:02,773 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 33 [2018-01-24 12:45:02,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:45:02,773 INFO L225 Difference]: With dead ends: 58 [2018-01-24 12:45:02,773 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 12:45:02,774 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 111 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=316, Invalid=1244, Unknown=0, NotChecked=0, Total=1560 [2018-01-24 12:45:02,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 12:45:02,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 12:45:02,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 12:45:02,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 12:45:02,775 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2018-01-24 12:45:02,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:45:02,775 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 12:45:02,775 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 12:45:02,776 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 12:45:02,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 12:45:02,781 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 12:45:03,042 WARN L146 SmtUtils]: Spent 153ms on a formula simplification. DAG size of input: 60 DAG size of output 38 [2018-01-24 12:45:03,368 WARN L146 SmtUtils]: Spent 324ms on a formula simplification. DAG size of input: 68 DAG size of output 44 [2018-01-24 12:45:03,583 WARN L146 SmtUtils]: Spent 214ms on a formula simplification. DAG size of input: 68 DAG size of output 46 [2018-01-24 12:45:03,586 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 560) no Hoare annotation was computed. [2018-01-24 12:45:03,587 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 560) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 12:45:03,587 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 560) no Hoare annotation was computed. [2018-01-24 12:45:03,587 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 560) the Hoare annotation is: true [2018-01-24 12:45:03,587 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 560) no Hoare annotation was computed. [2018-01-24 12:45:03,587 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 560) the Hoare annotation is: true [2018-01-24 12:45:03,587 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 560) no Hoare annotation was computed. [2018-01-24 12:45:03,587 INFO L401 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-24 12:45:03,588 INFO L401 ceAbstractionStarter]: For program point mainErr8EnsuresViolation(lines 540 560) no Hoare annotation was computed. [2018-01-24 12:45:03,588 INFO L401 ceAbstractionStarter]: For program point L546(line 546) no Hoare annotation was computed. [2018-01-24 12:45:03,588 INFO L401 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-01-24 12:45:03,588 INFO L401 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-01-24 12:45:03,588 INFO L401 ceAbstractionStarter]: For program point L549(lines 549 551) no Hoare annotation was computed. [2018-01-24 12:45:03,588 INFO L401 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-24 12:45:03,588 INFO L401 ceAbstractionStarter]: For program point L547(lines 547 553) no Hoare annotation was computed. [2018-01-24 12:45:03,588 INFO L401 ceAbstractionStarter]: For program point mainErr2RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-24 12:45:03,589 INFO L397 ceAbstractionStarter]: At program point L555'''(lines 555 557) the Hoare annotation is: (let ((.cse9 (* 4 main_~j~2)) (.cse14 (* 4 main_~length~2)) (.cse15 (+ (* 4 main_~i~2) main_~arr~2.offset)) (.cse10 (select |#length| main_~arr~2.base))) (let ((.cse0 (not (= 0 main_~arr~2.base))) (.cse1 (= |old(#valid)| (store |#valid| |main_#t~malloc1.base| 0))) (.cse2 (<= .cse15 .cse10)) (.cse3 (<= (+ main_~arr~2.offset .cse14) .cse10)) (.cse4 (= .cse14 .cse10)) (.cse5 (not (= 0 |main_#t~malloc1.base|))) (.cse6 (= 1 (select |#valid| |main_#t~malloc1.base|))) (.cse7 (= 1 (select |#valid| main_~arr~2.base))) (.cse8 (+ main_~arr~2.offset .cse9)) (.cse11 (<= 4 .cse15)) (.cse12 (= 0 |main_#t~malloc1.offset|)) (.cse13 (= .cse14 (select |#length| |main_#t~malloc1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 4 .cse8) (<= 0 main_~arr~2.offset) (<= (+ main_~arr~2.offset .cse9 4) .cse10) .cse11 .cse12 .cse13) (and .cse0 .cse1 (= main_~j~2 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 0 .cse8) .cse11 .cse12 .cse13)))) [2018-01-24 12:45:03,589 INFO L401 ceAbstractionStarter]: For program point L554''(lines 554 558) no Hoare annotation was computed. [2018-01-24 12:45:03,589 INFO L401 ceAbstractionStarter]: For program point L556''(line 556) no Hoare annotation was computed. [2018-01-24 12:45:03,589 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 540 560) no Hoare annotation was computed. [2018-01-24 12:45:03,589 INFO L401 ceAbstractionStarter]: For program point mainErr4RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-24 12:45:03,589 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 540 560) no Hoare annotation was computed. [2018-01-24 12:45:03,589 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 540 560) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 12:45:03,589 INFO L401 ceAbstractionStarter]: For program point mainErr7RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-24 12:45:03,589 INFO L397 ceAbstractionStarter]: At program point L554'''(lines 554 558) the Hoare annotation is: (let ((.cse12 (* 4 main_~length~2)) (.cse13 (+ (* 4 main_~i~2) main_~arr~2.offset)) (.cse14 (select |#length| main_~arr~2.base))) (let ((.cse0 (not (= 0 main_~arr~2.base))) (.cse1 (= |old(#valid)| (store |#valid| |main_#t~malloc1.base| 0))) (.cse2 (<= .cse13 .cse14)) (.cse3 (<= (+ main_~arr~2.offset .cse12) .cse14)) (.cse4 (= .cse12 .cse14)) (.cse5 (not (= 0 |main_#t~malloc1.base|))) (.cse6 (= 1 (select |#valid| |main_#t~malloc1.base|))) (.cse7 (= 1 (select |#valid| main_~arr~2.base))) (.cse8 (+ main_~arr~2.offset (* 4 main_~j~2))) (.cse9 (<= 4 .cse13)) (.cse10 (= 0 |main_#t~malloc1.offset|)) (.cse11 (= .cse12 (select |#length| |main_#t~malloc1.base|)))) (or (and .cse0 .cse1 (= main_~j~2 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 0 .cse8) .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 4 .cse8) (<= 0 main_~arr~2.offset) .cse9 .cse10 .cse11)))) [2018-01-24 12:45:03,590 INFO L401 ceAbstractionStarter]: For program point L545''(line 545) no Hoare annotation was computed. [2018-01-24 12:45:03,590 INFO L401 ceAbstractionStarter]: For program point L555'(line 555) no Hoare annotation was computed. [2018-01-24 12:45:03,590 INFO L401 ceAbstractionStarter]: For program point L549''(lines 549 551) no Hoare annotation was computed. [2018-01-24 12:45:03,590 INFO L397 ceAbstractionStarter]: At program point L547''(lines 547 553) the Hoare annotation is: (let ((.cse11 (* 4 main_~length~2)) (.cse4 (select |#length| main_~arr~2.base))) (let ((.cse0 (not (= 0 main_~arr~2.base))) (.cse1 (= main_~arr~2.offset 0)) (.cse2 (= |old(#valid)| (store |#valid| |main_#t~malloc1.base| 0))) (.cse5 (= .cse11 .cse4)) (.cse6 (not (= 0 |main_#t~malloc1.base|))) (.cse7 (= 1 (select |#valid| |main_#t~malloc1.base|))) (.cse8 (= 1 (select |#valid| main_~arr~2.base))) (.cse9 (= 0 |main_#t~malloc1.offset|)) (.cse10 (= .cse11 (select |#length| |main_#t~malloc1.base|)))) (or (let ((.cse3 (+ (* 4 main_~i~2) main_~arr~2.offset))) (and .cse0 .cse1 .cse2 (<= .cse3 .cse4) .cse5 .cse6 .cse7 .cse8 (<= 4 .cse3) .cse9 .cse10)) (and .cse0 .cse1 .cse2 (<= 1 main_~length~2) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= main_~i~2 0))))) [2018-01-24 12:45:03,590 INFO L401 ceAbstractionStarter]: For program point mainErr6RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-24 12:45:03,590 INFO L401 ceAbstractionStarter]: For program point mainErr5RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-24 12:45:03,590 INFO L401 ceAbstractionStarter]: For program point L545''''(line 545) no Hoare annotation was computed. [2018-01-24 12:45:03,590 INFO L401 ceAbstractionStarter]: For program point L556'(line 556) no Hoare annotation was computed. [2018-01-24 12:45:03,590 INFO L401 ceAbstractionStarter]: For program point L547'''(lines 547 553) no Hoare annotation was computed. [2018-01-24 12:45:03,590 INFO L401 ceAbstractionStarter]: For program point L545'''(line 545) no Hoare annotation was computed. [2018-01-24 12:45:03,590 INFO L401 ceAbstractionStarter]: For program point mainErr3RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-24 12:45:03,590 INFO L401 ceAbstractionStarter]: For program point L552(line 552) no Hoare annotation was computed. [2018-01-24 12:45:03,590 INFO L401 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-01-24 12:45:03,591 INFO L401 ceAbstractionStarter]: For program point L555(lines 555 557) no Hoare annotation was computed. [2018-01-24 12:45:03,591 INFO L401 ceAbstractionStarter]: For program point L554(lines 554 558) no Hoare annotation was computed. [2018-01-24 12:45:03,591 INFO L401 ceAbstractionStarter]: For program point L554''''(lines 554 558) no Hoare annotation was computed. [2018-01-24 12:45:03,591 INFO L401 ceAbstractionStarter]: For program point L556'''(line 556) no Hoare annotation was computed. [2018-01-24 12:45:03,591 INFO L401 ceAbstractionStarter]: For program point L544''(line 544) no Hoare annotation was computed. [2018-01-24 12:45:03,591 INFO L401 ceAbstractionStarter]: For program point L545'(line 545) no Hoare annotation was computed. [2018-01-24 12:45:03,598 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,599 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,599 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,600 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,600 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,604 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,605 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,605 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,605 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,606 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,610 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,610 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,610 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,610 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,611 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,611 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,611 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,611 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,615 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,615 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,615 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,616 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,616 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,616 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,616 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,617 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,619 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,619 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,620 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,620 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,620 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,620 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,621 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,621 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,621 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,624 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,624 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,624 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,625 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,625 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,625 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,625 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,625 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,626 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 12:45:03 BoogieIcfgContainer [2018-01-24 12:45:03,628 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 12:45:03,629 INFO L168 Benchmark]: Toolchain (without parser) took 6211.06 ms. Allocated memory was 307.8 MB in the beginning and 500.7 MB in the end (delta: 192.9 MB). Free memory was 267.8 MB in the beginning and 386.4 MB in the end (delta: -118.6 MB). Peak memory consumption was 117.8 MB. Max. memory is 5.3 GB. [2018-01-24 12:45:03,630 INFO L168 Benchmark]: CDTParser took 0.19 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:45:03,631 INFO L168 Benchmark]: CACSL2BoogieTranslator took 195.80 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:45:03,631 INFO L168 Benchmark]: Boogie Preprocessor took 32.34 ms. Allocated memory is still 307.8 MB. Free memory was 256.7 MB in the beginning and 254.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:45:03,631 INFO L168 Benchmark]: RCFGBuilder took 256.42 ms. Allocated memory is still 307.8 MB. Free memory was 254.7 MB in the beginning and 239.1 MB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 5.3 GB. [2018-01-24 12:45:03,632 INFO L168 Benchmark]: TraceAbstraction took 5718.64 ms. Allocated memory was 307.8 MB in the beginning and 500.7 MB in the end (delta: 192.9 MB). Free memory was 238.1 MB in the beginning and 386.4 MB in the end (delta: -148.2 MB). Peak memory consumption was 88.1 MB. Max. memory is 5.3 GB. [2018-01-24 12:45:03,633 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.19 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 195.80 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 32.34 ms. Allocated memory is still 307.8 MB. Free memory was 256.7 MB in the beginning and 254.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 256.42 ms. Allocated memory is still 307.8 MB. Free memory was 254.7 MB in the beginning and 239.1 MB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 5718.64 ms. Allocated memory was 307.8 MB in the beginning and 500.7 MB in the end (delta: 192.9 MB). Free memory was 238.1 MB in the beginning and 386.4 MB in the end (delta: -148.2 MB). Peak memory consumption was 88.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - 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: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 540]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - InvariantResult [Line: 547]: Loop Invariant [2018-01-24 12:45:03,640 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,640 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,640 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,640 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,641 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,642 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,643 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,643 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,643 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,643 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((!(0 == arr) && arr == 0) && \old(\valid) == \valid[__builtin_alloca (length*sizeof(int)) := 0]) && 4 * i + arr <= unknown-#length-unknown[arr]) && 4 * length == unknown-#length-unknown[arr]) && !(0 == __builtin_alloca (length*sizeof(int)))) && 1 == \valid[__builtin_alloca (length*sizeof(int))]) && 1 == \valid[arr]) && 4 <= 4 * i + arr) && 0 == __builtin_alloca (length*sizeof(int))) && 4 * length == unknown-#length-unknown[__builtin_alloca (length*sizeof(int))]) || ((((((((((!(0 == arr) && arr == 0) && \old(\valid) == \valid[__builtin_alloca (length*sizeof(int)) := 0]) && 1 <= length) && 4 * length == unknown-#length-unknown[arr]) && !(0 == __builtin_alloca (length*sizeof(int)))) && 1 == \valid[__builtin_alloca (length*sizeof(int))]) && 1 == \valid[arr]) && 0 == __builtin_alloca (length*sizeof(int))) && 4 * length == unknown-#length-unknown[__builtin_alloca (length*sizeof(int))]) && i == 0) - InvariantResult [Line: 554]: Loop Invariant [2018-01-24 12:45:03,645 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,646 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,646 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,646 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,646 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,646 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,647 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,647 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,649 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,649 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,649 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,649 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,650 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,650 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,650 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,650 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((((!(0 == arr) && \old(\valid) == \valid[__builtin_alloca (length*sizeof(int)) := 0]) && j == 0) && 4 * i + arr <= unknown-#length-unknown[arr]) && arr + 4 * length <= unknown-#length-unknown[arr]) && 4 * length == unknown-#length-unknown[arr]) && !(0 == __builtin_alloca (length*sizeof(int)))) && 1 == \valid[__builtin_alloca (length*sizeof(int))]) && 1 == \valid[arr]) && 0 <= arr + 4 * j) && 4 <= 4 * i + arr) && 0 == __builtin_alloca (length*sizeof(int))) && 4 * length == unknown-#length-unknown[__builtin_alloca (length*sizeof(int))]) || ((((((((((((!(0 == arr) && \old(\valid) == \valid[__builtin_alloca (length*sizeof(int)) := 0]) && 4 * i + arr <= unknown-#length-unknown[arr]) && arr + 4 * length <= unknown-#length-unknown[arr]) && 4 * length == unknown-#length-unknown[arr]) && !(0 == __builtin_alloca (length*sizeof(int)))) && 1 == \valid[__builtin_alloca (length*sizeof(int))]) && 1 == \valid[arr]) && 4 <= arr + 4 * j) && 0 <= arr) && 4 <= 4 * i + arr) && 0 == __builtin_alloca (length*sizeof(int))) && 4 * length == unknown-#length-unknown[__builtin_alloca (length*sizeof(int))]) - InvariantResult [Line: 555]: Loop Invariant [2018-01-24 12:45:03,653 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,653 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,653 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,653 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,653 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,654 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,654 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,654 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,654 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,656 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,656 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,657 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,657 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,657 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,657 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,657 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,658 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:03,658 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((((((!(0 == arr) && \old(\valid) == \valid[__builtin_alloca (length*sizeof(int)) := 0]) && 4 * i + arr <= unknown-#length-unknown[arr]) && arr + 4 * length <= unknown-#length-unknown[arr]) && 4 * length == unknown-#length-unknown[arr]) && !(0 == __builtin_alloca (length*sizeof(int)))) && 1 == \valid[__builtin_alloca (length*sizeof(int))]) && 1 == \valid[arr]) && 4 <= arr + 4 * j) && 0 <= arr) && arr + 4 * j + 4 <= unknown-#length-unknown[arr]) && 4 <= 4 * i + arr) && 0 == __builtin_alloca (length*sizeof(int))) && 4 * length == unknown-#length-unknown[__builtin_alloca (length*sizeof(int))]) || ((((((((((((!(0 == arr) && \old(\valid) == \valid[__builtin_alloca (length*sizeof(int)) := 0]) && j == 0) && 4 * i + arr <= unknown-#length-unknown[arr]) && arr + 4 * length <= unknown-#length-unknown[arr]) && 4 * length == unknown-#length-unknown[arr]) && !(0 == __builtin_alloca (length*sizeof(int)))) && 1 == \valid[__builtin_alloca (length*sizeof(int))]) && 1 == \valid[arr]) && 0 <= arr + 4 * j) && 4 <= 4 * i + arr) && 0 == __builtin_alloca (length*sizeof(int))) && 4 * length == unknown-#length-unknown[__builtin_alloca (length*sizeof(int))]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 44 locations, 9 error locations. SAFE Result, 5.6s OverallTime, 11 OverallIterations, 3 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 310 SDtfs, 1119 SDslu, 622 SDs, 0 SdLazy, 600 SolverSat, 81 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 520 GetRequests, 368 SyntacticMatches, 20 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred in iteration=9, 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, 11 MinimizatonAttempts, 58 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 21 NumberOfFragments, 441 HoareAnnotationTreeSize, 7 FomulaSimplifications, 648 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 935 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 451 NumberOfCodeBlocks, 451 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 631 ConstructedInterpolants, 56 QuantifiedInterpolants, 120997 SizeOfPredicates, 30 NumberOfNonLiveVariables, 642 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 27 InterpolantComputations, 10 PerfectInterpolantSequences, 83/153 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/count_down-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_12-45-03-663.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/count_down-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_12-45-03-663.csv Received shutdown request...