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/mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf -i ../../../trunk/examples/svcomp/array-memsafety/reverse_array_unsafe_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 00:29:13,008 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 00:29:13,010 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 00:29:13,025 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 00:29:13,026 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 00:29:13,026 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 00:29:13,027 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 00:29:13,028 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 00:29:13,030 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 00:29:13,030 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 00:29:13,031 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 00:29:13,031 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 00:29:13,032 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 00:29:13,033 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 00:29:13,034 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 00:29:13,036 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 00:29:13,038 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 00:29:13,040 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 00:29:13,042 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 00:29:13,043 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 00:29:13,045 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 00:29:13,046 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 00:29:13,046 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 00:29:13,047 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 00:29:13,048 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 00:29:13,049 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 00:29:13,049 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 00:29:13,050 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 00:29:13,050 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 00:29:13,051 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 00:29:13,052 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 00:29:13,052 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf [2018-01-21 00:29:13,062 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 00:29:13,063 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 00:29:13,063 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 00:29:13,064 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 00:29:13,064 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 00:29:13,064 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-21 00:29:13,064 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 00:29:13,064 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 00:29:13,065 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 00:29:13,065 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 00:29:13,066 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 00:29:13,066 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 00:29:13,066 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 00:29:13,066 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 00:29:13,066 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 00:29:13,066 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 00:29:13,067 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 00:29:13,067 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 00:29:13,067 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 00:29:13,067 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 00:29:13,067 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 00:29:13,068 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 00:29:13,068 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 00:29:13,068 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 00:29:13,068 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 00:29:13,068 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 00:29:13,069 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 00:29:13,069 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 00:29:13,069 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 00:29:13,069 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 00:29:13,069 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 00:29:13,070 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 00:29:13,070 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 00:29:13,070 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 00:29:13,070 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 00:29:13,070 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 00:29:13,070 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 00:29:13,071 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 00:29:13,072 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 00:29:13,107 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 00:29:13,117 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 00:29:13,120 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 00:29:13,121 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 00:29:13,122 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 00:29:13,123 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/reverse_array_unsafe_false-valid-deref.i [2018-01-21 00:29:13,274 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 00:29:13,279 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 00:29:13,280 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 00:29:13,280 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 00:29:13,289 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 00:29:13,290 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:29:13" (1/1) ... [2018-01-21 00:29:13,294 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@655b3dab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:29:13, skipping insertion in model container [2018-01-21 00:29:13,295 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:29:13" (1/1) ... [2018-01-21 00:29:13,316 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:29:13,359 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:29:13,483 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:29:13,497 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:29:13,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:29:13 WrapperNode [2018-01-21 00:29:13,505 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 00:29:13,505 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 00:29:13,506 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 00:29:13,506 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 00:29:13,517 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:29:13" (1/1) ... [2018-01-21 00:29:13,517 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:29:13" (1/1) ... [2018-01-21 00:29:13,528 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:29:13" (1/1) ... [2018-01-21 00:29:13,528 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:29:13" (1/1) ... [2018-01-21 00:29:13,531 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:29:13" (1/1) ... [2018-01-21 00:29:13,534 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:29:13" (1/1) ... [2018-01-21 00:29:13,535 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:29:13" (1/1) ... [2018-01-21 00:29:13,537 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 00:29:13,537 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 00:29:13,537 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 00:29:13,537 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 00:29:13,538 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:29:13" (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-21 00:29:13,588 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 00:29:13,589 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 00:29:13,589 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 00:29:13,589 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 00:29:13,589 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 00:29:13,589 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 00:29:13,589 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 00:29:13,589 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 00:29:13,589 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 00:29:13,590 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 00:29:13,590 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 00:29:13,590 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 00:29:13,814 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 00:29:13,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:29:13 BoogieIcfgContainer [2018-01-21 00:29:13,815 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 00:29:13,816 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 00:29:13,816 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 00:29:13,817 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 00:29:13,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 12:29:13" (1/3) ... [2018-01-21 00:29:13,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58dd15c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:29:13, skipping insertion in model container [2018-01-21 00:29:13,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:29:13" (2/3) ... [2018-01-21 00:29:13,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58dd15c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:29:13, skipping insertion in model container [2018-01-21 00:29:13,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:29:13" (3/3) ... [2018-01-21 00:29:13,821 INFO L105 eAbstractionObserver]: Analyzing ICFG reverse_array_unsafe_false-valid-deref.i [2018-01-21 00:29:13,829 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 00:29:13,834 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-21 00:29:13,870 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:29:13,870 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:29:13,870 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:29:13,870 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:29:13,870 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:29:13,870 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:29:13,870 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:29:13,870 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 00:29:13,871 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:29:13,892 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-01-21 00:29:13,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 00:29:13,899 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:29:13,900 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 00:29:13,901 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 00:29:13,906 INFO L82 PathProgramCache]: Analyzing trace with hash 109556, now seen corresponding path program 1 times [2018-01-21 00:29:13,909 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:29:13,954 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:13,954 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:13,954 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:13,955 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:29:13,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:29:13,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:29:14,005 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:29:14,011 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:29:14,019 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:29:14,019 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:29:14,019 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:29:14,019 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:29:14,019 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:29:14,020 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:29:14,020 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:29:14,020 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 00:29:14,020 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:29:14,022 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-01-21 00:29:14,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-21 00:29:14,023 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:29:14,023 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:29:14,023 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:29:14,023 INFO L82 PathProgramCache]: Analyzing trace with hash 964801099, now seen corresponding path program 1 times [2018-01-21 00:29:14,023 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:29:14,024 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:14,025 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:14,025 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:14,025 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:29:14,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:29:14,059 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:29:14,095 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-21 00:29:14,097 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:29:14,097 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:29:14,097 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:29:14,100 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:29:14,197 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:29:14,197 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:29:14,199 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 2 states. [2018-01-21 00:29:14,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:29:14,224 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2018-01-21 00:29:14,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:29:14,226 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-01-21 00:29:14,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:29:14,236 INFO L225 Difference]: With dead ends: 70 [2018-01-21 00:29:14,236 INFO L226 Difference]: Without dead ends: 42 [2018-01-21 00:29:14,239 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:29:14,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-01-21 00:29:14,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-01-21 00:29:14,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-21 00:29:14,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-01-21 00:29:14,278 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 20 [2018-01-21 00:29:14,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:29:14,278 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-01-21 00:29:14,278 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:29:14,279 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-01-21 00:29:14,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-21 00:29:14,279 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:29:14,279 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:29:14,280 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:29:14,280 INFO L82 PathProgramCache]: Analyzing trace with hash -342950740, now seen corresponding path program 1 times [2018-01-21 00:29:14,280 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:29:14,281 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:14,281 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:14,281 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:14,281 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:29:14,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:29:14,303 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:29:14,474 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-21 00:29:14,474 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:29:14,474 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-21 00:29:14,474 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:29:14,476 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 00:29:14,477 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 00:29:14,477 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 00:29:14,477 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 3 states. [2018-01-21 00:29:14,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:29:14,513 INFO L93 Difference]: Finished difference Result 109 states and 122 transitions. [2018-01-21 00:29:14,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 00:29:14,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-01-21 00:29:14,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:29:14,518 INFO L225 Difference]: With dead ends: 109 [2018-01-21 00:29:14,518 INFO L226 Difference]: Without dead ends: 75 [2018-01-21 00:29:14,519 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 00:29:14,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-21 00:29:14,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 43. [2018-01-21 00:29:14,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-21 00:29:14,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-01-21 00:29:14,527 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 25 [2018-01-21 00:29:14,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:29:14,527 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-01-21 00:29:14,527 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 00:29:14,527 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-01-21 00:29:14,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-21 00:29:14,529 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:29:14,529 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:29:14,529 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:29:14,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1957871850, now seen corresponding path program 1 times [2018-01-21 00:29:14,529 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:29:14,531 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:14,531 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:14,531 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:14,531 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:29:14,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:29:14,551 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:29:14,591 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-21 00:29:14,592 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:29:14,592 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 00:29:14,592 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:29:14,592 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 00:29:14,593 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 00:29:14,593 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-21 00:29:14,593 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 4 states. [2018-01-21 00:29:14,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:29:14,625 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2018-01-21 00:29:14,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 00:29:14,626 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-01-21 00:29:14,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:29:14,627 INFO L225 Difference]: With dead ends: 75 [2018-01-21 00:29:14,627 INFO L226 Difference]: Without dead ends: 52 [2018-01-21 00:29:14,628 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-21 00:29:14,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-21 00:29:14,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 45. [2018-01-21 00:29:14,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-21 00:29:14,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2018-01-21 00:29:14,634 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 25 [2018-01-21 00:29:14,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:29:14,634 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2018-01-21 00:29:14,634 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 00:29:14,635 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-01-21 00:29:14,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-21 00:29:14,636 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:29:14,636 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, 1, 1, 1, 1, 1, 1] [2018-01-21 00:29:14,636 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:29:14,636 INFO L82 PathProgramCache]: Analyzing trace with hash -92922, now seen corresponding path program 1 times [2018-01-21 00:29:14,637 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:29:14,637 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:14,637 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:14,638 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:14,638 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:29:14,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:29:14,665 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:29:15,015 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 62 DAG size of output 25 [2018-01-21 00:29:15,499 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:29:15,499 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:29:15,499 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 00:29:15,501 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-01-21 00:29:15,503 INFO L201 CegarAbsIntRunner]: [0], [1], [6], [7], [10], [18], [20], [21], [25], [28], [30], [31], [40], [42], [46], [47], [51], [53], [54], [61], [65], [78], [79], [80], [81], [83], [84], [85], [86] [2018-01-21 00:29:15,567 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 00:29:15,568 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 00:29:15,817 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 00:29:15,819 INFO L268 AbstractInterpreter]: Visited 29 different actions 47 times. Merged at 17 different actions 17 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 29 variables. [2018-01-21 00:29:15,841 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 00:29:15,841 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:29:15,842 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-21 00:29:15,852 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:15,852 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 00:29:15,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:29:15,875 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 00:29:15,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 29 [2018-01-21 00:29:15,992 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:29:15,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2018-01-21 00:29:15,994 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:16,001 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:29:16,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2018-01-21 00:29:16,006 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:29:16,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2018-01-21 00:29:16,007 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:16,014 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:29:16,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 00:29:16,045 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:109, output treesize:26 [2018-01-21 00:29:16,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-01-21 00:29:16,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2018-01-21 00:29:16,106 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:16,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:29:16,115 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:29:16,115 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:4 [2018-01-21 00:29:16,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:29:16,133 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 00:29:16,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2018-01-21 00:29:16,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2018-01-21 00:29:16,312 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:16,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-01-21 00:29:16,313 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:16,318 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 00:29:16,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2018-01-21 00:29:16,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2018-01-21 00:29:16,349 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:16,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-01-21 00:29:16,351 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:16,362 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 00:29:16,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-01-21 00:29:16,378 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:72, output treesize:41 [2018-01-21 00:29:16,443 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:29:16,470 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:29:16,470 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 00:29:16,475 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:16,475 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 00:29:16,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:29:16,506 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 00:29:16,602 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-01-21 00:29:16,603 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:16,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-01-21 00:29:16,651 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:29:16,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2018-01-21 00:29:16,652 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:16,657 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:29:16,663 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 00:29:16,663 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:118, output treesize:29 [2018-01-21 00:29:16,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2018-01-21 00:29:16,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-01-21 00:29:16,740 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:16,751 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:29:16,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:29:16,758 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:4 [2018-01-21 00:29:16,770 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:29:16,770 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 00:29:16,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2018-01-21 00:29:16,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-01-21 00:29:16,825 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:16,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2018-01-21 00:29:16,827 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:16,831 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 00:29:16,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2018-01-21 00:29:16,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2018-01-21 00:29:16,860 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:16,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-01-21 00:29:16,862 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:16,867 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 00:29:16,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-21 00:29:16,877 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:72, output treesize:41 [2018-01-21 00:29:16,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:29:16,909 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 00:29:16,909 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10, 11, 10] total 28 [2018-01-21 00:29:16,909 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 00:29:16,910 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-21 00:29:16,910 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-21 00:29:16,911 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2018-01-21 00:29:16,911 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 18 states. [2018-01-21 00:29:17,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:29:17,542 INFO L93 Difference]: Finished difference Result 102 states and 113 transitions. [2018-01-21 00:29:17,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-21 00:29:17,542 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 30 [2018-01-21 00:29:17,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:29:17,544 INFO L225 Difference]: With dead ends: 102 [2018-01-21 00:29:17,544 INFO L226 Difference]: Without dead ends: 81 [2018-01-21 00:29:17,545 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 97 SyntacticMatches, 9 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=296, Invalid=1186, Unknown=0, NotChecked=0, Total=1482 [2018-01-21 00:29:17,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-21 00:29:17,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 56. [2018-01-21 00:29:17,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-21 00:29:17,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2018-01-21 00:29:17,552 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 30 [2018-01-21 00:29:17,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:29:17,553 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2018-01-21 00:29:17,553 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-21 00:29:17,553 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2018-01-21 00:29:17,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-21 00:29:17,554 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:29:17,554 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:29:17,554 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:29:17,554 INFO L82 PathProgramCache]: Analyzing trace with hash 2111018345, now seen corresponding path program 1 times [2018-01-21 00:29:17,555 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:29:17,556 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:17,556 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:17,556 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:17,556 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:29:17,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:29:17,576 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:29:17,769 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-21 00:29:17,769 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:29:17,769 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-21 00:29:17,769 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:29:17,770 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-21 00:29:17,770 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-21 00:29:17,770 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-01-21 00:29:17,770 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand 11 states. [2018-01-21 00:29:17,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:29:17,985 INFO L93 Difference]: Finished difference Result 128 states and 143 transitions. [2018-01-21 00:29:17,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-21 00:29:17,985 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-01-21 00:29:17,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:29:17,987 INFO L225 Difference]: With dead ends: 128 [2018-01-21 00:29:17,987 INFO L226 Difference]: Without dead ends: 121 [2018-01-21 00:29:17,987 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2018-01-21 00:29:17,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-21 00:29:17,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 89. [2018-01-21 00:29:17,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-21 00:29:17,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 101 transitions. [2018-01-21 00:29:17,995 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 101 transitions. Word has length 32 [2018-01-21 00:29:17,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:29:17,995 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 101 transitions. [2018-01-21 00:29:17,995 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-21 00:29:17,995 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 101 transitions. [2018-01-21 00:29:17,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-21 00:29:17,996 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:29:17,996 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:29:17,996 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:29:17,996 INFO L82 PathProgramCache]: Analyzing trace with hash 2032509349, now seen corresponding path program 1 times [2018-01-21 00:29:17,996 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:29:17,997 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:17,997 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:17,997 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:17,998 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:29:18,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:29:18,009 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:29:18,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:29:18,060 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:29:18,060 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 00:29:18,060 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-01-21 00:29:18,060 INFO L201 CegarAbsIntRunner]: [0], [1], [6], [7], [12], [16], [20], [21], [25], [28], [30], [31], [40], [42], [46], [47], [51], [53], [54], [57], [58], [59], [65], [78], [79], [80], [81], [83], [84], [85], [86] [2018-01-21 00:29:18,062 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 00:29:18,062 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 00:29:18,180 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 00:29:18,181 INFO L268 AbstractInterpreter]: Visited 31 different actions 51 times. Merged at 19 different actions 19 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 30 variables. [2018-01-21 00:29:18,182 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 00:29:18,182 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:29:18,182 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-21 00:29:18,203 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:18,203 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 00:29:18,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:29:18,230 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 00:29:18,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:29:18,245 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 00:29:18,264 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:29:18,286 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:29:18,286 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 00:29:18,290 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:18,291 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 00:29:18,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:29:18,318 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 00:29:18,323 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:29:18,323 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 00:29:18,371 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:29:18,372 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 00:29:18,372 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6] total 9 [2018-01-21 00:29:18,372 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 00:29:18,373 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-21 00:29:18,373 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-21 00:29:18,373 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-01-21 00:29:18,373 INFO L87 Difference]: Start difference. First operand 89 states and 101 transitions. Second operand 8 states. [2018-01-21 00:29:18,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:29:18,450 INFO L93 Difference]: Finished difference Result 185 states and 209 transitions. [2018-01-21 00:29:18,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-21 00:29:18,451 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-01-21 00:29:18,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:29:18,452 INFO L225 Difference]: With dead ends: 185 [2018-01-21 00:29:18,452 INFO L226 Difference]: Without dead ends: 156 [2018-01-21 00:29:18,453 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 119 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-01-21 00:29:18,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-01-21 00:29:18,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 103. [2018-01-21 00:29:18,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-21 00:29:18,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2018-01-21 00:29:18,465 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 32 [2018-01-21 00:29:18,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:29:18,465 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2018-01-21 00:29:18,465 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-21 00:29:18,466 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2018-01-21 00:29:18,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-21 00:29:18,467 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:29:18,467 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:29:18,467 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:29:18,467 INFO L82 PathProgramCache]: Analyzing trace with hash -2121909337, now seen corresponding path program 1 times [2018-01-21 00:29:18,468 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:29:18,468 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:18,469 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:18,469 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:18,469 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:29:18,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:29:18,482 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:29:18,706 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:29:18,706 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:29:18,706 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 00:29:18,706 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-01-21 00:29:18,707 INFO L201 CegarAbsIntRunner]: [0], [1], [6], [7], [12], [18], [20], [21], [25], [28], [30], [31], [40], [42], [46], [47], [51], [53], [54], [57], [58], [59], [65], [78], [79], [80], [81], [83], [84], [85], [86] [2018-01-21 00:29:18,708 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 00:29:18,708 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 00:29:18,842 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 00:29:18,842 INFO L268 AbstractInterpreter]: Visited 31 different actions 51 times. Merged at 19 different actions 19 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 29 variables. [2018-01-21 00:29:18,862 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 00:29:18,862 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:29:18,862 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-21 00:29:18,872 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:18,872 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 00:29:18,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:29:18,885 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 00:29:18,950 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-01-21 00:29:18,950 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:18,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2018-01-21 00:29:18,955 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:29:18,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2018-01-21 00:29:18,957 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:18,966 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:29:18,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:29:19,000 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:127, output treesize:32 [2018-01-21 00:29:19,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-01-21 00:29:19,059 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:29:19,059 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 00:29:19,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-01-21 00:29:19,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:19,064 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:29:19,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:29:19,074 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:4 [2018-01-21 00:29:19,097 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:29:19,097 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 00:29:19,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2018-01-21 00:29:19,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-21 00:29:19,258 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:19,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-01-21 00:29:19,260 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:19,263 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 00:29:19,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-21 00:29:19,267 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:40, output treesize:37 [2018-01-21 00:29:19,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:29:19,320 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:29:19,320 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-21 00:29:19,323 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:19,323 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 00:29:19,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:29:19,353 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 00:29:19,419 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-01-21 00:29:19,420 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:19,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-01-21 00:29:19,444 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 15 treesize of output 14 [2018-01-21 00:29:19,444 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:19,446 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:29:19,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:29:19,452 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:103, output treesize:24 [2018-01-21 00:29:19,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-01-21 00:29:19,651 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:29:19,652 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 00:29:19,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-01-21 00:29:19,653 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:19,669 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:29:19,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:29:19,674 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:4 [2018-01-21 00:29:19,687 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:29:19,687 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 00:29:19,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 55 [2018-01-21 00:29:19,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-01-21 00:29:19,863 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:19,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2018-01-21 00:29:19,865 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:19,869 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:29:19,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 58 [2018-01-21 00:29:19,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2018-01-21 00:29:19,896 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:19,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-01-21 00:29:19,897 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:19,902 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:29:19,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 52 [2018-01-21 00:29:19,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2018-01-21 00:29:19,968 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:19,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-01-21 00:29:19,969 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:19,975 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:29:19,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2018-01-21 00:29:20,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-01-21 00:29:20,016 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:20,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2018-01-21 00:29:20,018 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:20,023 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:29:20,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2018-01-21 00:29:20,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2018-01-21 00:29:20,062 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:20,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-01-21 00:29:20,063 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:20,068 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:29:20,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-21 00:29:20,086 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 5 variables, input treesize:434, output treesize:40 [2018-01-21 00:29:20,282 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:29:20,284 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 00:29:20,284 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12, 14, 13] total 40 [2018-01-21 00:29:20,284 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 00:29:20,285 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-21 00:29:20,285 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-21 00:29:20,286 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1373, Unknown=0, NotChecked=0, Total=1560 [2018-01-21 00:29:20,286 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand 19 states. [2018-01-21 00:29:21,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:29:21,080 INFO L93 Difference]: Finished difference Result 234 states and 263 transitions. [2018-01-21 00:29:21,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-21 00:29:21,081 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 32 [2018-01-21 00:29:21,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:29:21,082 INFO L225 Difference]: With dead ends: 234 [2018-01-21 00:29:21,082 INFO L226 Difference]: Without dead ends: 227 [2018-01-21 00:29:21,084 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 94 SyntacticMatches, 7 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1077 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=685, Invalid=3097, Unknown=0, NotChecked=0, Total=3782 [2018-01-21 00:29:21,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-01-21 00:29:21,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 117. [2018-01-21 00:29:21,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-01-21 00:29:21,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 133 transitions. [2018-01-21 00:29:21,098 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 133 transitions. Word has length 32 [2018-01-21 00:29:21,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:29:21,098 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 133 transitions. [2018-01-21 00:29:21,098 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-21 00:29:21,098 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 133 transitions. [2018-01-21 00:29:21,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-21 00:29:21,100 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:29:21,100 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:29:21,100 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:29:21,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1617625150, now seen corresponding path program 1 times [2018-01-21 00:29:21,100 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:29:21,101 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:21,101 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:21,101 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:21,101 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:29:21,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:29:21,113 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:29:21,703 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:29:21,703 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:29:21,703 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 00:29:21,704 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-01-21 00:29:21,704 INFO L201 CegarAbsIntRunner]: [0], [1], [6], [7], [10], [18], [20], [21], [25], [28], [30], [31], [34], [35], [36], [37], [38], [42], [46], [47], [51], [53], [54], [61], [65], [78], [79], [80], [81], [83], [84], [85], [86] [2018-01-21 00:29:21,705 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 00:29:21,705 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 00:29:21,806 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 00:29:21,807 INFO L268 AbstractInterpreter]: Visited 33 different actions 55 times. Merged at 21 different actions 21 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 31 variables. [2018-01-21 00:29:21,812 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 00:29:21,812 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:29:21,812 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-21 00:29:21,827 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:21,827 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 00:29:21,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:29:21,851 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 00:29:21,994 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:29:21,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-01-21 00:29:21,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-01-21 00:29:21,997 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:22,000 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:29:22,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:29:22,005 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:11 [2018-01-21 00:29:22,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2018-01-21 00:29:22,029 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:29:22,030 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:29:22,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 41 [2018-01-21 00:29:22,031 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:22,079 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:29:22,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 29 [2018-01-21 00:29:22,084 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:29:22,085 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:29:22,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 41 [2018-01-21 00:29:22,085 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:22,093 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:29:22,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 00:29:22,111 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:106, output treesize:25 [2018-01-21 00:29:22,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2018-01-21 00:29:22,189 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:29:22,190 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:29:22,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-01-21 00:29:22,192 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:22,196 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:29:22,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:29:22,209 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:3 [2018-01-21 00:29:22,246 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:29:22,246 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 00:29:22,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-01-21 00:29:22,580 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 00:29:22,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2018-01-21 00:29:22,601 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 00:29:22,602 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 00:29:22,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-01-21 00:29:22,602 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:22,604 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2018-01-21 00:29:22,604 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:22,608 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 00:29:22,616 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 00:29:22,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 49 [2018-01-21 00:29:22,640 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 00:29:22,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2018-01-21 00:29:22,652 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2018-01-21 00:29:22,653 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:22,654 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 00:29:22,655 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 00:29:22,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-01-21 00:29:22,656 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:22,661 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 00:29:22,670 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 00:29:22,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-01-21 00:29:22,690 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:110, output treesize:61 [2018-01-21 00:29:22,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:29:22,828 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:29:22,829 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-21 00:29:22,833 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:22,834 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 00:29:22,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:29:22,872 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 00:29:23,045 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:29:23,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-01-21 00:29:23,082 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:29:23,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-01-21 00:29:23,083 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:23,086 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:29:23,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:29:23,089 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:16 [2018-01-21 00:29:23,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 34 [2018-01-21 00:29:23,121 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:29:23,122 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:29:23,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 43 [2018-01-21 00:29:23,123 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:23,131 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:29:23,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2018-01-21 00:29:23,136 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:29:23,136 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:29:23,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 43 [2018-01-21 00:29:23,137 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:23,145 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:29:23,164 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 00:29:23,164 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:121, output treesize:30 [2018-01-21 00:29:23,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-01-21 00:29:23,242 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:29:23,243 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:29:23,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-01-21 00:29:23,243 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:23,246 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:29:23,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:29:23,249 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:3 [2018-01-21 00:29:23,280 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:29:23,280 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 00:29:23,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 47 [2018-01-21 00:29:23,571 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 00:29:23,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 27 [2018-01-21 00:29:23,586 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 10 [2018-01-21 00:29:23,586 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:23,588 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 00:29:23,588 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 00:29:23,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2018-01-21 00:29:23,589 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:23,591 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 00:29:23,595 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 00:29:23,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-01-21 00:29:23,614 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 00:29:23,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 27 [2018-01-21 00:29:23,635 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 10 [2018-01-21 00:29:23,636 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:23,637 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 00:29:23,638 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 00:29:23,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2018-01-21 00:29:23,639 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:23,643 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 00:29:23,650 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 00:29:23,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-21 00:29:23,665 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:108, output treesize:41 [2018-01-21 00:29:23,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:29:23,703 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 00:29:23,703 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 13, 14, 13] total 49 [2018-01-21 00:29:23,703 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 00:29:23,704 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-21 00:29:23,704 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-21 00:29:23,705 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=2048, Unknown=0, NotChecked=0, Total=2352 [2018-01-21 00:29:23,705 INFO L87 Difference]: Start difference. First operand 117 states and 133 transitions. Second operand 25 states. [2018-01-21 00:29:24,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:29:24,878 INFO L93 Difference]: Finished difference Result 214 states and 240 transitions. [2018-01-21 00:29:24,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-21 00:29:24,878 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 34 [2018-01-21 00:29:24,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:29:24,880 INFO L225 Difference]: With dead ends: 214 [2018-01-21 00:29:24,880 INFO L226 Difference]: Without dead ends: 193 [2018-01-21 00:29:24,881 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 98 SyntacticMatches, 6 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1548 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=725, Invalid=4105, Unknown=0, NotChecked=0, Total=4830 [2018-01-21 00:29:24,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-01-21 00:29:24,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 117. [2018-01-21 00:29:24,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-01-21 00:29:24,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 133 transitions. [2018-01-21 00:29:24,890 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 133 transitions. Word has length 34 [2018-01-21 00:29:24,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:29:24,890 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 133 transitions. [2018-01-21 00:29:24,890 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-21 00:29:24,890 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 133 transitions. [2018-01-21 00:29:24,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-21 00:29:24,891 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:29:24,891 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 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-21 00:29:24,892 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:29:24,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1234541807, now seen corresponding path program 2 times [2018-01-21 00:29:24,892 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:29:24,893 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:24,893 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:24,893 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:24,893 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:29:24,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:29:24,904 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:29:24,966 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:29:24,966 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:29:24,967 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 00:29:24,967 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-21 00:29:24,967 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-21 00:29:24,967 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:29:24,967 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-21 00:29:24,974 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-21 00:29:24,975 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 00:29:24,984 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 00:29:24,998 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 00:29:25,000 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 00:29:25,002 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 00:29:25,046 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:29:25,047 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 00:29:25,064 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:29:25,084 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:29:25,084 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 11 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 11 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 00:29:25,087 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-21 00:29:25,087 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 00:29:25,098 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 00:29:25,110 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 00:29:25,122 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 00:29:25,125 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 00:29:25,181 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:29:25,181 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 00:29:25,210 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:29:25,212 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 00:29:25,213 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7] total 16 [2018-01-21 00:29:25,213 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 00:29:25,213 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-21 00:29:25,213 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-21 00:29:25,213 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2018-01-21 00:29:25,214 INFO L87 Difference]: Start difference. First operand 117 states and 133 transitions. Second operand 11 states. [2018-01-21 00:29:25,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:29:25,307 INFO L93 Difference]: Finished difference Result 209 states and 237 transitions. [2018-01-21 00:29:25,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-21 00:29:25,308 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2018-01-21 00:29:25,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:29:25,309 INFO L225 Difference]: With dead ends: 209 [2018-01-21 00:29:25,309 INFO L226 Difference]: Without dead ends: 180 [2018-01-21 00:29:25,310 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 132 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=190, Unknown=0, NotChecked=0, Total=306 [2018-01-21 00:29:25,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-01-21 00:29:25,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 129. [2018-01-21 00:29:25,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-01-21 00:29:25,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 146 transitions. [2018-01-21 00:29:25,323 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 146 transitions. Word has length 37 [2018-01-21 00:29:25,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:29:25,323 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 146 transitions. [2018-01-21 00:29:25,323 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-21 00:29:25,324 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 146 transitions. [2018-01-21 00:29:25,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-21 00:29:25,325 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:29:25,325 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 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-21 00:29:25,325 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:29:25,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1211909553, now seen corresponding path program 2 times [2018-01-21 00:29:25,326 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:29:25,326 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:25,327 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-21 00:29:25,327 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:25,327 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:29:25,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:29:25,340 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:29:25,536 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:29:25,536 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:29:25,536 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 00:29:25,536 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-21 00:29:25,536 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-21 00:29:25,536 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:29:25,536 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-21 00:29:25,549 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-21 00:29:25,549 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 00:29:25,558 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 00:29:25,561 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 00:29:25,562 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 00:29:25,563 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 00:29:25,675 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:29:25,675 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 00:29:25,737 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:29:25,758 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:29:25,759 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 13 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 13 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 00:29:25,762 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-21 00:29:25,762 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 00:29:25,774 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 00:29:25,786 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 00:29:25,804 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 00:29:25,809 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 00:29:25,819 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:29:25,819 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 00:29:25,859 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:29:25,860 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 00:29:25,861 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7, 8, 7] total 18 [2018-01-21 00:29:25,861 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 00:29:25,861 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-21 00:29:25,861 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-21 00:29:25,862 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2018-01-21 00:29:25,862 INFO L87 Difference]: Start difference. First operand 129 states and 146 transitions. Second operand 13 states. [2018-01-21 00:29:25,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:29:25,972 INFO L93 Difference]: Finished difference Result 248 states and 280 transitions. [2018-01-21 00:29:25,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-21 00:29:25,973 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2018-01-21 00:29:25,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:29:25,974 INFO L225 Difference]: With dead ends: 248 [2018-01-21 00:29:25,974 INFO L226 Difference]: Without dead ends: 204 [2018-01-21 00:29:25,975 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 136 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2018-01-21 00:29:25,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-01-21 00:29:25,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 144. [2018-01-21 00:29:25,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-01-21 00:29:25,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 163 transitions. [2018-01-21 00:29:25,988 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 163 transitions. Word has length 37 [2018-01-21 00:29:25,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:29:25,988 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 163 transitions. [2018-01-21 00:29:25,988 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-21 00:29:25,988 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 163 transitions. [2018-01-21 00:29:25,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-21 00:29:25,989 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:29:25,990 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 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-21 00:29:25,990 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:29:25,990 INFO L82 PathProgramCache]: Analyzing trace with hash 859940133, now seen corresponding path program 3 times [2018-01-21 00:29:25,990 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:29:25,991 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:25,991 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-21 00:29:25,991 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:25,991 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:29:26,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:29:26,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:29:26,023 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:29:26,029 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:29:26,035 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:29:26,036 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:29:26,050 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:29:26,050 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:29:26,050 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:29:26,050 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:29:26,050 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:29:26,050 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:29:26,051 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:29:26,051 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 00:29:26,051 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:29:26,052 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-01-21 00:29:26,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-21 00:29:26,052 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:29:26,052 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:29:26,052 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 00:29:26,053 INFO L82 PathProgramCache]: Analyzing trace with hash -168828260, now seen corresponding path program 1 times [2018-01-21 00:29:26,053 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:29:26,053 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:26,053 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:26,054 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:26,054 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:29:26,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:29:26,058 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:29:26,063 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-21 00:29:26,064 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:29:26,064 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:29:26,064 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:29:26,064 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:29:26,065 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:29:26,065 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:29:26,065 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 2 states. [2018-01-21 00:29:26,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:29:26,067 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2018-01-21 00:29:26,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:29:26,067 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-01-21 00:29:26,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:29:26,068 INFO L225 Difference]: With dead ends: 70 [2018-01-21 00:29:26,068 INFO L226 Difference]: Without dead ends: 40 [2018-01-21 00:29:26,068 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:29:26,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-21 00:29:26,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-01-21 00:29:26,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-21 00:29:26,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2018-01-21 00:29:26,071 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 18 [2018-01-21 00:29:26,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:29:26,071 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2018-01-21 00:29:26,071 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:29:26,071 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2018-01-21 00:29:26,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-21 00:29:26,072 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:29:26,072 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:29:26,072 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 00:29:26,072 INFO L82 PathProgramCache]: Analyzing trace with hash -371306179, now seen corresponding path program 1 times [2018-01-21 00:29:26,072 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:29:26,073 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:26,073 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:26,073 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:26,073 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:29:26,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:29:26,080 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:29:26,128 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-21 00:29:26,129 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:29:26,129 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-21 00:29:26,129 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:29:26,129 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 00:29:26,130 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 00:29:26,130 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 00:29:26,130 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 3 states. [2018-01-21 00:29:26,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:29:26,154 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2018-01-21 00:29:26,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 00:29:26,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-01-21 00:29:26,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:29:26,156 INFO L225 Difference]: With dead ends: 105 [2018-01-21 00:29:26,156 INFO L226 Difference]: Without dead ends: 73 [2018-01-21 00:29:26,156 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 00:29:26,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-21 00:29:26,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 41. [2018-01-21 00:29:26,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-21 00:29:26,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-01-21 00:29:26,160 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 23 [2018-01-21 00:29:26,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:29:26,160 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-01-21 00:29:26,160 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 00:29:26,160 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-01-21 00:29:26,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-21 00:29:26,161 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:29:26,161 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:29:26,161 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-21 00:29:26,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1392374533, now seen corresponding path program 1 times [2018-01-21 00:29:26,161 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:29:26,162 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:26,163 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:26,163 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:26,163 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:29:26,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:29:26,170 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:29:26,222 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-21 00:29:26,222 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:29:26,223 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 00:29:26,223 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:29:26,223 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 00:29:26,223 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 00:29:26,223 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-21 00:29:26,223 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 4 states. [2018-01-21 00:29:26,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:29:26,269 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2018-01-21 00:29:26,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 00:29:26,270 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-01-21 00:29:26,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:29:26,270 INFO L225 Difference]: With dead ends: 71 [2018-01-21 00:29:26,270 INFO L226 Difference]: Without dead ends: 50 [2018-01-21 00:29:26,271 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-21 00:29:26,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-21 00:29:26,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2018-01-21 00:29:26,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-21 00:29:26,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-01-21 00:29:26,274 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 23 [2018-01-21 00:29:26,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:29:26,274 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-01-21 00:29:26,274 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 00:29:26,274 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-01-21 00:29:26,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-21 00:29:26,275 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:29:26,275 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, 1, 1, 1, 1] [2018-01-21 00:29:26,275 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-21 00:29:26,275 INFO L82 PathProgramCache]: Analyzing trace with hash -634636265, now seen corresponding path program 1 times [2018-01-21 00:29:26,275 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:29:26,276 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:26,276 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:26,276 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:26,276 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:29:26,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:29:26,284 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:29:26,321 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-21 00:29:26,322 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:29:26,322 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-21 00:29:26,322 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:29:26,322 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 00:29:26,322 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 00:29:26,322 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 00:29:26,322 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 4 states. [2018-01-21 00:29:26,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:29:26,349 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-01-21 00:29:26,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 00:29:26,349 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-01-21 00:29:26,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:29:26,350 INFO L225 Difference]: With dead ends: 43 [2018-01-21 00:29:26,350 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:29:26,350 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-21 00:29:26,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:29:26,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:29:26,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:29:26,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:29:26,351 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2018-01-21 00:29:26,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:29:26,351 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:29:26,351 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 00:29:26,351 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:29:26,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:29:26,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 12:29:26 BoogieIcfgContainer [2018-01-21 00:29:26,353 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 00:29:26,354 INFO L168 Benchmark]: Toolchain (without parser) took 13080.03 ms. Allocated memory was 303.6 MB in the beginning and 598.7 MB in the end (delta: 295.2 MB). Free memory was 260.9 MB in the beginning and 418.3 MB in the end (delta: -157.5 MB). Peak memory consumption was 137.7 MB. Max. memory is 5.3 GB. [2018-01-21 00:29:26,355 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 303.6 MB. Free memory is still 266.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 00:29:26,355 INFO L168 Benchmark]: CACSL2BoogieTranslator took 225.17 ms. Allocated memory is still 303.6 MB. Free memory was 260.9 MB in the beginning and 250.9 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-21 00:29:26,355 INFO L168 Benchmark]: Boogie Preprocessor took 31.28 ms. Allocated memory is still 303.6 MB. Free memory was 250.9 MB in the beginning and 248.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-21 00:29:26,355 INFO L168 Benchmark]: RCFGBuilder took 278.29 ms. Allocated memory is still 303.6 MB. Free memory was 248.9 MB in the beginning and 232.4 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 5.3 GB. [2018-01-21 00:29:26,355 INFO L168 Benchmark]: TraceAbstraction took 12537.73 ms. Allocated memory was 303.6 MB in the beginning and 598.7 MB in the end (delta: 295.2 MB). Free memory was 232.4 MB in the beginning and 418.3 MB in the end (delta: -186.0 MB). Peak memory consumption was 109.2 MB. Max. memory is 5.3 GB. [2018-01-21 00:29:26,357 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.24 ms. Allocated memory is still 303.6 MB. Free memory is still 266.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 225.17 ms. Allocated memory is still 303.6 MB. Free memory was 260.9 MB in the beginning and 250.9 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.28 ms. Allocated memory is still 303.6 MB. Free memory was 250.9 MB in the beginning and 248.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 278.29 ms. Allocated memory is still 303.6 MB. Free memory was 248.9 MB in the beginning and 232.4 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 12537.73 ms. Allocated memory was 303.6 MB in the beginning and 598.7 MB in the end (delta: 295.2 MB). Free memory was 232.4 MB in the beginning and 418.3 MB in the end (delta: -186.0 MB). Peak memory consumption was 109.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 28 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 315 LocStat_NO_SUPPORTING_DISEQUALITIES : 78 LocStat_NO_DISJUNCTIONS : -56 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 33 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 43 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 34 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.055884 RENAME_VARIABLES(MILLISECONDS) : 0.038066 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.765337 PROJECTAWAY(MILLISECONDS) : 2.728665 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001407 DISJOIN(MILLISECONDS) : 2.646024 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.069477 ADD_EQUALITY(MILLISECONDS) : 0.066986 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.019858 #CONJOIN_DISJUNCTIVE : 62 #RENAME_VARIABLES : 113 #UNFREEZE : 0 #CONJOIN : 92 #PROJECTAWAY : 96 #ADD_WEAK_EQUALITY : 6 #DISJOIN : 1 #RENAME_VARIABLES_DISJUNCTIVE : 111 #ADD_EQUALITY : 44 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 5 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 30 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 339 LocStat_NO_SUPPORTING_DISEQUALITIES : 72 LocStat_NO_DISJUNCTIONS : -60 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 35 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 49 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 37 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.790189 RENAME_VARIABLES(MILLISECONDS) : 0.035090 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.496663 PROJECTAWAY(MILLISECONDS) : 1.795826 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001932 DISJOIN(MILLISECONDS) : 0.758439 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.065798 ADD_EQUALITY(MILLISECONDS) : 0.032966 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.019285 #CONJOIN_DISJUNCTIVE : 70 #RENAME_VARIABLES : 127 #UNFREEZE : 0 #CONJOIN : 102 #PROJECTAWAY : 105 #ADD_WEAK_EQUALITY : 6 #DISJOIN : 2 #RENAME_VARIABLES_DISJUNCTIVE : 123 #ADD_EQUALITY : 50 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 5 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 30 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 360 LocStat_NO_SUPPORTING_DISEQUALITIES : 93 LocStat_NO_DISJUNCTIONS : -60 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 35 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 47 TransStat_NO_SUPPORTING_DISEQUALITIES : 7 TransStat_NO_DISJUNCTIONS : 37 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.908382 RENAME_VARIABLES(MILLISECONDS) : 0.031343 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.668828 PROJECTAWAY(MILLISECONDS) : 2.626317 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.002734 DISJOIN(MILLISECONDS) : 0.684483 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.058715 ADD_EQUALITY(MILLISECONDS) : 0.026154 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.011725 #CONJOIN_DISJUNCTIVE : 69 #RENAME_VARIABLES : 127 #UNFREEZE : 0 #CONJOIN : 101 #PROJECTAWAY : 105 #ADD_WEAK_EQUALITY : 6 #DISJOIN : 2 #RENAME_VARIABLES_DISJUNCTIVE : 123 #ADD_EQUALITY : 48 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 6 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 32 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 358 LocStat_NO_SUPPORTING_DISEQUALITIES : 93 LocStat_NO_DISJUNCTIONS : -64 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 37 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 47 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 38 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.684511 RENAME_VARIABLES(MILLISECONDS) : 0.026779 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.462888 PROJECTAWAY(MILLISECONDS) : 0.895558 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.002446 DISJOIN(MILLISECONDS) : 0.500592 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.049150 ADD_EQUALITY(MILLISECONDS) : 0.039759 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.012256 #CONJOIN_DISJUNCTIVE : 71 #RENAME_VARIABLES : 129 #UNFREEZE : 0 #CONJOIN : 101 #PROJECTAWAY : 108 #ADD_WEAK_EQUALITY : 8 #DISJOIN : 1 #RENAME_VARIABLES_DISJUNCTIVE : 127 #ADD_EQUALITY : 49 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 3 procedures, 45 locations, 3 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=0, 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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L541] int i, j, tmp; [L542] int length = __VERIFIER_nondet_int(); [L543] COND FALSE !(length < 1) VAL [length=2] [L544] COND TRUE length % 2 == 0 [L544] length++ VAL [length=3] [L545] EXPR, FCALL __builtin_alloca (length) VAL [__builtin_alloca (length)={9:0}, length=3] [L545] int *arr = __builtin_alloca (length); [L546] i=0 VAL [__builtin_alloca (length)={9:0}, arr={9:0}, i=0, length=3] [L546] COND TRUE i