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_alloca_unsafe_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 00:29:07,014 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 00:29:07,015 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 00:29:07,030 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 00:29:07,031 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 00:29:07,032 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 00:29:07,033 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 00:29:07,034 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 00:29:07,036 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 00:29:07,036 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 00:29:07,037 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 00:29:07,037 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 00:29:07,038 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 00:29:07,038 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 00:29:07,039 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 00:29:07,042 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 00:29:07,044 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 00:29:07,046 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 00:29:07,048 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 00:29:07,049 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 00:29:07,051 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 00:29:07,051 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 00:29:07,052 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 00:29:07,053 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 00:29:07,054 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 00:29:07,055 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 00:29:07,055 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 00:29:07,056 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 00:29:07,056 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 00:29:07,056 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 00:29:07,057 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 00:29:07,057 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:07,067 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 00:29:07,067 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 00:29:07,068 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 00:29:07,068 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 00:29:07,069 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 00:29:07,069 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-21 00:29:07,069 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 00:29:07,069 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 00:29:07,070 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 00:29:07,070 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 00:29:07,070 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 00:29:07,071 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 00:29:07,071 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 00:29:07,071 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 00:29:07,071 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 00:29:07,071 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 00:29:07,071 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 00:29:07,072 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 00:29:07,072 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 00:29:07,072 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 00:29:07,072 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 00:29:07,072 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 00:29:07,073 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 00:29:07,073 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 00:29:07,073 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 00:29:07,073 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 00:29:07,074 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 00:29:07,074 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 00:29:07,074 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 00:29:07,074 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 00:29:07,074 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 00:29:07,074 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 00:29:07,075 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 00:29:07,075 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 00:29:07,075 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 00:29:07,075 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 00:29:07,075 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 00:29:07,076 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 00:29:07,076 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 00:29:07,111 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 00:29:07,124 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 00:29:07,128 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 00:29:07,129 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 00:29:07,130 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 00:29:07,131 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/reverse_array_alloca_unsafe_false-valid-deref.i [2018-01-21 00:29:07,315 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 00:29:07,320 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 00:29:07,321 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 00:29:07,321 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 00:29:07,327 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 00:29:07,328 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:29:07" (1/1) ... [2018-01-21 00:29:07,332 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@533d743e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:29:07, skipping insertion in model container [2018-01-21 00:29:07,332 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:29:07" (1/1) ... [2018-01-21 00:29:07,351 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:29:07,391 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:29:07,513 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:29:07,528 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:29:07,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:29:07 WrapperNode [2018-01-21 00:29:07,536 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 00:29:07,536 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 00:29:07,536 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 00:29:07,537 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 00:29:07,554 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:07" (1/1) ... [2018-01-21 00:29:07,554 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:07" (1/1) ... [2018-01-21 00:29:07,565 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:07" (1/1) ... [2018-01-21 00:29:07,565 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:07" (1/1) ... [2018-01-21 00:29:07,568 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:07" (1/1) ... [2018-01-21 00:29:07,571 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:07" (1/1) ... [2018-01-21 00:29:07,572 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:07" (1/1) ... [2018-01-21 00:29:07,574 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 00:29:07,574 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 00:29:07,574 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 00:29:07,574 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 00:29:07,575 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:29:07" (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:07,626 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 00:29:07,626 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 00:29:07,627 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 00:29:07,627 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 00:29:07,627 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 00:29:07,627 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 00:29:07,627 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 00:29:07,627 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 00:29:07,627 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 00:29:07,627 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 00:29:07,627 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 00:29:07,627 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 00:29:07,830 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 00:29:07,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:29:07 BoogieIcfgContainer [2018-01-21 00:29:07,830 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 00:29:07,831 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 00:29:07,831 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 00:29:07,833 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 00:29:07,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 12:29:07" (1/3) ... [2018-01-21 00:29:07,834 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77ff28e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:29:07, skipping insertion in model container [2018-01-21 00:29:07,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:29:07" (2/3) ... [2018-01-21 00:29:07,834 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77ff28e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:29:07, skipping insertion in model container [2018-01-21 00:29:07,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:29:07" (3/3) ... [2018-01-21 00:29:07,836 INFO L105 eAbstractionObserver]: Analyzing ICFG reverse_array_alloca_unsafe_false-valid-deref.i [2018-01-21 00:29:07,842 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 00:29:07,848 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-21 00:29:07,899 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:29:07,899 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:29:07,899 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:29:07,899 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:29:07,900 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:29:07,900 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:29:07,900 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:29:07,900 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 00:29:07,901 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:29:07,921 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-01-21 00:29:07,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 00:29:07,926 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:29:07,927 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 00:29:07,927 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 00:29:07,931 INFO L82 PathProgramCache]: Analyzing trace with hash 109556, now seen corresponding path program 1 times [2018-01-21 00:29:07,933 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:29:07,974 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:07,974 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:08,002 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:08,002 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:29:08,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:29:08,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:29:08,055 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:29:08,061 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:29:08,066 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:29:08,066 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:29:08,066 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:29:08,066 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:29:08,066 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:29:08,067 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:29:08,067 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:29:08,067 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 00:29:08,067 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:29:08,068 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-01-21 00:29:08,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-21 00:29:08,069 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:29:08,070 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:08,070 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:29:08,070 INFO L82 PathProgramCache]: Analyzing trace with hash 964801099, now seen corresponding path program 1 times [2018-01-21 00:29:08,070 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:29:08,071 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:08,071 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:08,071 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:08,071 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:29:08,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:29:08,110 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:08,150 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:08,152 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:29:08,152 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:29:08,152 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:29:08,155 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:29:08,171 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:29:08,171 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:29:08,174 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 2 states. [2018-01-21 00:29:08,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:29:08,262 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2018-01-21 00:29:08,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:29:08,264 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-01-21 00:29:08,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:29:08,275 INFO L225 Difference]: With dead ends: 70 [2018-01-21 00:29:08,275 INFO L226 Difference]: Without dead ends: 42 [2018-01-21 00:29:08,279 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:08,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-01-21 00:29:08,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-01-21 00:29:08,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-21 00:29:08,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-01-21 00:29:08,317 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 20 [2018-01-21 00:29:08,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:29:08,318 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-01-21 00:29:08,318 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:29:08,318 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-01-21 00:29:08,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-21 00:29:08,319 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:29:08,319 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:08,319 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:29:08,319 INFO L82 PathProgramCache]: Analyzing trace with hash -342950740, now seen corresponding path program 1 times [2018-01-21 00:29:08,319 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:29:08,320 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:08,320 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:08,320 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:08,320 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:29:08,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:29:08,342 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:08,485 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:08,485 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:29:08,485 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-21 00:29:08,486 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:29:08,487 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 00:29:08,487 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 00:29:08,487 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 00:29:08,488 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 3 states. [2018-01-21 00:29:08,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:29:08,526 INFO L93 Difference]: Finished difference Result 109 states and 122 transitions. [2018-01-21 00:29:08,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 00:29:08,526 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-01-21 00:29:08,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:29:08,529 INFO L225 Difference]: With dead ends: 109 [2018-01-21 00:29:08,530 INFO L226 Difference]: Without dead ends: 75 [2018-01-21 00:29:08,530 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:08,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-21 00:29:08,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 43. [2018-01-21 00:29:08,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-21 00:29:08,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-01-21 00:29:08,537 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 25 [2018-01-21 00:29:08,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:29:08,537 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-01-21 00:29:08,537 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 00:29:08,537 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-01-21 00:29:08,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-21 00:29:08,538 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:29:08,538 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:08,538 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:29:08,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1957871850, now seen corresponding path program 1 times [2018-01-21 00:29:08,539 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:29:08,539 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:08,540 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:08,540 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:08,540 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:29:08,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:29:08,558 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:08,606 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:08,607 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:29:08,607 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 00:29:08,607 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:29:08,607 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 00:29:08,608 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 00:29:08,608 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-21 00:29:08,608 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 4 states. [2018-01-21 00:29:08,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:29:08,670 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2018-01-21 00:29:08,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 00:29:08,671 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-01-21 00:29:08,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:29:08,672 INFO L225 Difference]: With dead ends: 75 [2018-01-21 00:29:08,672 INFO L226 Difference]: Without dead ends: 52 [2018-01-21 00:29:08,673 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:08,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-21 00:29:08,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 45. [2018-01-21 00:29:08,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-21 00:29:08,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2018-01-21 00:29:08,679 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 25 [2018-01-21 00:29:08,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:29:08,679 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2018-01-21 00:29:08,680 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 00:29:08,680 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-01-21 00:29:08,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-21 00:29:08,681 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:29:08,681 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:08,681 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:29:08,681 INFO L82 PathProgramCache]: Analyzing trace with hash -92922, now seen corresponding path program 1 times [2018-01-21 00:29:08,682 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:29:08,683 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:08,683 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:08,683 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:08,683 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:29:08,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:29:08,712 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:09,132 WARN L146 SmtUtils]: Spent 169ms on a formula simplification. DAG size of input: 64 DAG size of output 32 [2018-01-21 00:29:09,346 WARN L146 SmtUtils]: Spent 190ms on a formula simplification. DAG size of input: 71 DAG size of output 39 [2018-01-21 00:29:09,542 WARN L146 SmtUtils]: Spent 147ms on a formula simplification. DAG size of input: 71 DAG size of output 39 [2018-01-21 00:29:09,720 WARN L146 SmtUtils]: Spent 157ms on a formula simplification. DAG size of input: 62 DAG size of output 36 [2018-01-21 00:29:09,876 WARN L146 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 59 DAG size of output 29 [2018-01-21 00:29:09,930 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:09,930 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:29:09,930 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 00:29:09,931 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-01-21 00:29:09,933 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:09,982 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 00:29:09,982 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 00:29:10,203 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 00:29:10,205 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:10,221 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 00:29:10,221 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:29:10,221 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:10,237 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:10,237 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 00:29:10,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:29:10,262 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 00:29:10,382 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:10,387 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:29:10,388 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:10,389 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:10,396 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:29:10,399 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:10,403 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:29:10,404 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:10,404 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:10,412 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:29:10,456 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:10,456 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:109, output treesize:26 [2018-01-21 00:29:10,541 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:10,545 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:10,546 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:10,550 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:29:10,554 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:10,555 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:4 [2018-01-21 00:29:10,576 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:10,577 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 00:29:10,788 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:10,807 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:10,808 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:10,812 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:10,812 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:10,818 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 00:29:10,837 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:10,852 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:10,852 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:10,854 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:10,854 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:10,859 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 00:29:10,869 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:10,870 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:72, output treesize:41 [2018-01-21 00:29:10,921 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:10,942 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:29:10,943 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:10,947 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:10,947 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 00:29:10,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:29:10,987 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 00:29:11,073 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-01-21 00:29:11,074 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:11,091 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:11,094 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:29:11,095 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:11,095 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:11,100 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:29:11,106 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:11,106 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:118, output treesize:29 [2018-01-21 00:29:11,191 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:11,193 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:11,193 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:11,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:11,199 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:11,199 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:4 [2018-01-21 00:29:11,208 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:11,208 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 00:29:11,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 36 treesize of output 32 [2018-01-21 00:29:11,259 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:11,259 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:11,261 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:11,261 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:11,267 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 00:29:11,284 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:11,304 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:11,305 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:11,306 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:11,307 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:11,320 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 00:29:11,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-21 00:29:11,363 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:72, output treesize:41 [2018-01-21 00:29:11,390 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:11,393 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 00:29:11,393 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10, 11, 10] total 27 [2018-01-21 00:29:11,393 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 00:29:11,394 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-21 00:29:11,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-21 00:29:11,405 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2018-01-21 00:29:11,406 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 17 states. [2018-01-21 00:29:12,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:29:12,074 INFO L93 Difference]: Finished difference Result 102 states and 113 transitions. [2018-01-21 00:29:12,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-21 00:29:12,075 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2018-01-21 00:29:12,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:29:12,076 INFO L225 Difference]: With dead ends: 102 [2018-01-21 00:29:12,076 INFO L226 Difference]: Without dead ends: 81 [2018-01-21 00:29:12,077 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 97 SyntacticMatches, 10 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=274, Invalid=1132, Unknown=0, NotChecked=0, Total=1406 [2018-01-21 00:29:12,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-21 00:29:12,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 56. [2018-01-21 00:29:12,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-21 00:29:12,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2018-01-21 00:29:12,085 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 30 [2018-01-21 00:29:12,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:29:12,085 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2018-01-21 00:29:12,085 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-21 00:29:12,085 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2018-01-21 00:29:12,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-21 00:29:12,086 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:29:12,087 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:12,087 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:29:12,087 INFO L82 PathProgramCache]: Analyzing trace with hash 2111018345, now seen corresponding path program 1 times [2018-01-21 00:29:12,087 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:29:12,088 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:12,088 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:12,088 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:12,089 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:29:12,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:29:12,109 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:12,267 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:12,267 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:29:12,268 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-21 00:29:12,268 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:29:12,268 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-21 00:29:12,268 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-21 00:29:12,268 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-01-21 00:29:12,268 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand 11 states. [2018-01-21 00:29:12,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:29:12,462 INFO L93 Difference]: Finished difference Result 128 states and 143 transitions. [2018-01-21 00:29:12,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-21 00:29:12,463 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-01-21 00:29:12,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:29:12,464 INFO L225 Difference]: With dead ends: 128 [2018-01-21 00:29:12,464 INFO L226 Difference]: Without dead ends: 121 [2018-01-21 00:29:12,464 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:12,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-21 00:29:12,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 89. [2018-01-21 00:29:12,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-21 00:29:12,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 101 transitions. [2018-01-21 00:29:12,472 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 101 transitions. Word has length 32 [2018-01-21 00:29:12,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:29:12,472 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 101 transitions. [2018-01-21 00:29:12,472 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-21 00:29:12,472 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 101 transitions. [2018-01-21 00:29:12,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-21 00:29:12,473 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:29:12,473 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:12,473 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:29:12,473 INFO L82 PathProgramCache]: Analyzing trace with hash 2032509349, now seen corresponding path program 1 times [2018-01-21 00:29:12,473 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:29:12,474 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:12,474 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:12,474 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:12,474 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:29:12,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:29:12,483 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:12,519 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:12,519 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:29:12,519 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 00:29:12,519 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-01-21 00:29:12,519 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:12,520 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 00:29:12,521 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 00:29:12,675 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 00:29:12,675 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:12,701 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 00:29:12,701 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:29:12,701 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:12,708 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:12,709 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 00:29:12,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:29:12,731 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 00:29:12,760 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:12,760 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 00:29:12,809 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:12,830 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:29:12,830 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:12,833 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:12,833 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 00:29:12,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:29:12,858 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 00:29:12,862 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:12,862 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 00:29:12,904 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:12,906 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 00:29:12,906 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6] total 9 [2018-01-21 00:29:12,906 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 00:29:12,907 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-21 00:29:12,907 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-21 00:29:12,907 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-01-21 00:29:12,907 INFO L87 Difference]: Start difference. First operand 89 states and 101 transitions. Second operand 8 states. [2018-01-21 00:29:12,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:29:12,998 INFO L93 Difference]: Finished difference Result 185 states and 209 transitions. [2018-01-21 00:29:12,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-21 00:29:12,999 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-01-21 00:29:12,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:29:13,000 INFO L225 Difference]: With dead ends: 185 [2018-01-21 00:29:13,000 INFO L226 Difference]: Without dead ends: 156 [2018-01-21 00:29:13,000 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 119 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-01-21 00:29:13,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-01-21 00:29:13,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 103. [2018-01-21 00:29:13,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-21 00:29:13,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2018-01-21 00:29:13,011 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 32 [2018-01-21 00:29:13,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:29:13,011 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2018-01-21 00:29:13,012 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-21 00:29:13,012 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2018-01-21 00:29:13,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-21 00:29:13,013 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:29:13,013 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:13,013 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:29:13,013 INFO L82 PathProgramCache]: Analyzing trace with hash -2121909337, now seen corresponding path program 1 times [2018-01-21 00:29:13,013 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:29:13,014 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:13,014 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:13,014 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:13,014 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:29:13,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:29:13,028 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:13,227 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:13,227 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:29:13,228 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 00:29:13,228 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-01-21 00:29:13,228 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:13,229 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 00:29:13,230 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 00:29:13,368 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 00:29:13,369 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:13,376 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 00:29:13,376 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:29:13,376 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:13,381 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:13,381 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 00:29:13,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:29:13,394 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 00:29:13,472 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-01-21 00:29:13,472 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:13,475 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:13,478 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:29:13,478 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:13,479 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:13,487 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:29:13,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:29:13,504 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:127, output treesize:32 [2018-01-21 00:29:13,555 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:13,559 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:29:13,559 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 00:29:13,560 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:13,561 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:13,565 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:29:13,570 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:13,570 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:4 [2018-01-21 00:29:13,581 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:13,581 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 00:29:13,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 35 treesize of output 31 [2018-01-21 00:29:13,750 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:13,751 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:13,752 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:13,752 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:13,756 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 00:29:13,761 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:13,761 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:40, output treesize:37 [2018-01-21 00:29:13,795 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:13,815 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:29:13,816 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:13,818 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:13,819 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 00:29:13,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:29:13,849 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 00:29:13,881 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-01-21 00:29:13,882 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:13,915 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:13,916 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:13,917 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:13,919 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:29:13,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:29:13,924 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:103, output treesize:24 [2018-01-21 00:29:14,091 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:14,103 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:29:14,103 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 00:29:14,104 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:14,105 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:14,111 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:29:14,117 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:14,117 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:4 [2018-01-21 00:29:14,131 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:14,131 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 00:29:14,261 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:14,286 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:14,287 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:14,288 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:14,288 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:14,292 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:29:14,294 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:14,319 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:14,319 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:14,323 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:14,324 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:14,331 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:29:14,381 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:14,411 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:14,411 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:14,413 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:14,414 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:14,422 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:29:14,445 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:14,465 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:14,466 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:14,467 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:14,468 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:14,473 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:29:14,491 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:14,513 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:14,513 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:14,516 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:14,516 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:14,527 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:29:14,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-21 00:29:14,550 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 5 variables, input treesize:434, output treesize:40 [2018-01-21 00:29:14,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:14,689 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 00:29:14,689 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12, 14, 13] total 39 [2018-01-21 00:29:14,689 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 00:29:14,689 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-21 00:29:14,690 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-21 00:29:14,690 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1283, Unknown=0, NotChecked=0, Total=1482 [2018-01-21 00:29:14,691 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand 19 states. [2018-01-21 00:29:15,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:29:15,478 INFO L93 Difference]: Finished difference Result 234 states and 263 transitions. [2018-01-21 00:29:15,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-21 00:29:15,478 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 32 [2018-01-21 00:29:15,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:29:15,479 INFO L225 Difference]: With dead ends: 234 [2018-01-21 00:29:15,479 INFO L226 Difference]: Without dead ends: 227 [2018-01-21 00:29:15,481 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 95 SyntacticMatches, 7 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1069 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=696, Invalid=2964, Unknown=0, NotChecked=0, Total=3660 [2018-01-21 00:29:15,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-01-21 00:29:15,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 117. [2018-01-21 00:29:15,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-01-21 00:29:15,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 133 transitions. [2018-01-21 00:29:15,495 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 133 transitions. Word has length 32 [2018-01-21 00:29:15,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:29:15,495 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 133 transitions. [2018-01-21 00:29:15,495 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-21 00:29:15,495 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 133 transitions. [2018-01-21 00:29:15,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-21 00:29:15,496 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:29:15,497 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:15,497 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:29:15,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1617625150, now seen corresponding path program 1 times [2018-01-21 00:29:15,497 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:29:15,498 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:15,498 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:15,498 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:15,498 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:29:15,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:29:15,512 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:16,469 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,469 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:29:16,469 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 00:29:16,469 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-01-21 00:29:16,469 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:16,470 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 00:29:16,470 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 00:29:16,561 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 00:29:16,561 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:16,562 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 00:29:16,562 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:29:16,562 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:16,567 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:16,567 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 00:29:16,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:29:16,580 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 00:29:16,684 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:29:16,685 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:16,687 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:16,688 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:16,691 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,696 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:16,696 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:11 [2018-01-21 00:29:16,762 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:16,765 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:29:16,766 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:29:16,766 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:16,767 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:16,775 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,777 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:16,780 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:29:16,781 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:29:16,781 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:16,782 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:16,815 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,830 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,830 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:106, output treesize:25 [2018-01-21 00:29:16,877 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,879 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:29:16,880 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:29:16,880 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:16,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:16,884 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,886 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,886 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:3 [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,902 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 00:29:17,276 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:17,278 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 00:29:17,278 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:17,286 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 00:29:17,286 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 00:29:17,287 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:17,287 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:17,288 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:17,288 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:17,292 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 00:29:17,300 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 00:29:17,320 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:17,322 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 00:29:17,322 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:17,331 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 00:29:17,332 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 00:29:17,332 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:17,332 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:17,334 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:17,334 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:17,339 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 00:29:17,347 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 00:29:17,362 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:17,363 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:110, output treesize:61 [2018-01-21 00:29:17,468 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:17,489 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:29:17,489 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:17,492 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:17,492 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 00:29:17,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:29:17,529 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 00:29:17,722 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:29:17,723 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:17,725 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:29:17,725 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:17,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:17,729 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:29:17,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:29:17,733 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:16 [2018-01-21 00:29:17,766 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:17,768 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:29:17,769 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:29:17,770 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:17,770 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:17,778 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:29:17,780 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:17,782 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:29:17,783 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:29:17,784 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:17,784 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:17,791 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:29:17,809 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:17,809 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:121, output treesize:30 [2018-01-21 00:29:17,904 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:17,906 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:29:17,907 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:29:17,907 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:17,908 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:17,911 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:29:17,914 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:17,914 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:3 [2018-01-21 00:29:17,939 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:17,939 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 00:29:18,240 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:18,252 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 00:29:18,253 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:18,270 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:18,270 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:18,272 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 00:29:18,272 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 00:29:18,272 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:18,273 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:18,276 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 00:29:18,281 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 00:29:18,295 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:18,298 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 00:29:18,298 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:18,332 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:18,332 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:18,334 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 00:29:18,334 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 00:29:18,334 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:18,335 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:18,338 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 00:29:18,343 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 00:29:18,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-21 00:29:18,354 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:108, output treesize:41 [2018-01-21 00:29:18,403 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,405 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 00:29:18,406 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 13, 14, 13] total 51 [2018-01-21 00:29:18,406 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 00:29:18,406 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-21 00:29:18,407 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-21 00:29:18,407 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=2248, Unknown=0, NotChecked=0, Total=2550 [2018-01-21 00:29:18,408 INFO L87 Difference]: Start difference. First operand 117 states and 133 transitions. Second operand 26 states. [2018-01-21 00:29:20,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:29:20,364 INFO L93 Difference]: Finished difference Result 250 states and 281 transitions. [2018-01-21 00:29:20,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-01-21 00:29:20,364 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 34 [2018-01-21 00:29:20,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:29:20,365 INFO L225 Difference]: With dead ends: 250 [2018-01-21 00:29:20,365 INFO L226 Difference]: Without dead ends: 220 [2018-01-21 00:29:20,367 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 97 SyntacticMatches, 6 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2138 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1046, Invalid=5926, Unknown=0, NotChecked=0, Total=6972 [2018-01-21 00:29:20,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-01-21 00:29:20,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 109. [2018-01-21 00:29:20,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-01-21 00:29:20,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 122 transitions. [2018-01-21 00:29:20,377 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 122 transitions. Word has length 34 [2018-01-21 00:29:20,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:29:20,377 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 122 transitions. [2018-01-21 00:29:20,377 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-21 00:29:20,378 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 122 transitions. [2018-01-21 00:29:20,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-21 00:29:20,379 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:29:20,379 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:20,379 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:29:20,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1234541807, now seen corresponding path program 2 times [2018-01-21 00:29:20,380 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:29:20,380 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:20,380 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:20,381 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:20,381 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:29:20,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:29:20,391 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:20,442 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:20,442 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:29:20,442 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 00:29:20,442 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-21 00:29:20,442 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:20,442 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:29:20,442 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:20,447 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-21 00:29:20,447 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 00:29:20,456 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 00:29:20,459 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 00:29:20,460 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 00:29:20,462 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 00:29:20,509 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:20,509 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 00:29:20,528 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:20,548 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:29:20,548 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:20,551 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-21 00:29:20,552 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 00:29:20,563 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 00:29:20,574 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 00:29:20,587 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 00:29:20,590 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 00:29:20,628 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:20,628 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 00:29:20,655 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:20,657 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 00:29:20,657 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7] total 16 [2018-01-21 00:29:20,657 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 00:29:20,657 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-21 00:29:20,658 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-21 00:29:20,658 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2018-01-21 00:29:20,658 INFO L87 Difference]: Start difference. First operand 109 states and 122 transitions. Second operand 11 states. [2018-01-21 00:29:20,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:29:20,734 INFO L93 Difference]: Finished difference Result 201 states and 226 transitions. [2018-01-21 00:29:20,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-21 00:29:20,734 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2018-01-21 00:29:20,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:29:20,735 INFO L225 Difference]: With dead ends: 201 [2018-01-21 00:29:20,735 INFO L226 Difference]: Without dead ends: 172 [2018-01-21 00:29:20,735 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:20,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-01-21 00:29:20,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 121. [2018-01-21 00:29:20,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-01-21 00:29:20,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 135 transitions. [2018-01-21 00:29:20,743 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 135 transitions. Word has length 37 [2018-01-21 00:29:20,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:29:20,744 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 135 transitions. [2018-01-21 00:29:20,744 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-21 00:29:20,744 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 135 transitions. [2018-01-21 00:29:20,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-21 00:29:20,744 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:29:20,745 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:20,745 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:29:20,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1211909553, now seen corresponding path program 2 times [2018-01-21 00:29:20,745 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:29:20,745 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:20,745 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-21 00:29:20,745 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:20,746 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:29:20,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:29:20,757 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:20,975 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:20,975 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:29:20,975 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 00:29:20,976 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-21 00:29:20,976 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:20,976 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:29:20,976 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:20,984 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-21 00:29:20,984 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 00:29:20,993 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 00:29:20,997 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 00:29:20,998 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 00:29:21,000 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 00:29:21,124 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:21,124 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 00:29:21,178 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:21,198 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:29:21,199 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:21,202 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-21 00:29:21,202 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 00:29:21,220 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 00:29:21,231 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 00:29:21,243 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 00:29:21,247 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 00:29:21,251 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:21,252 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 00:29:21,269 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:21,271 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 00:29:21,271 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7, 8, 7] total 18 [2018-01-21 00:29:21,271 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 00:29:21,272 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-21 00:29:21,272 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-21 00:29:21,272 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2018-01-21 00:29:21,272 INFO L87 Difference]: Start difference. First operand 121 states and 135 transitions. Second operand 13 states. [2018-01-21 00:29:21,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:29:21,432 INFO L93 Difference]: Finished difference Result 232 states and 258 transitions. [2018-01-21 00:29:21,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-21 00:29:21,432 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2018-01-21 00:29:21,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:29:21,433 INFO L225 Difference]: With dead ends: 232 [2018-01-21 00:29:21,433 INFO L226 Difference]: Without dead ends: 194 [2018-01-21 00:29:21,434 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:21,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-01-21 00:29:21,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 126. [2018-01-21 00:29:21,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-01-21 00:29:21,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 142 transitions. [2018-01-21 00:29:21,442 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 142 transitions. Word has length 37 [2018-01-21 00:29:21,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:29:21,443 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 142 transitions. [2018-01-21 00:29:21,443 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-21 00:29:21,443 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 142 transitions. [2018-01-21 00:29:21,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-21 00:29:21,443 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:29:21,443 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:21,443 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:29:21,444 INFO L82 PathProgramCache]: Analyzing trace with hash 859940133, now seen corresponding path program 3 times [2018-01-21 00:29:21,444 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:29:21,444 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:21,444 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-21 00:29:21,445 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:21,445 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:29:21,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:29:21,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:29:21,473 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:29:21,480 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:29:21,486 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:29:21,487 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:29:21,501 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:29:21,501 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:29:21,502 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:29:21,502 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:29:21,502 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:29:21,502 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:29:21,502 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:29:21,502 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 00:29:21,502 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:29:21,503 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-01-21 00:29:21,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-21 00:29:21,504 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:29:21,504 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:21,504 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 00:29:21,504 INFO L82 PathProgramCache]: Analyzing trace with hash -168828260, now seen corresponding path program 1 times [2018-01-21 00:29:21,504 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:29:21,505 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:21,505 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:21,505 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:21,505 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:29:21,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:29:21,509 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,513 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:21,514 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:29:21,514 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:29:21,514 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:29:21,514 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:29:21,514 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:29:21,514 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:29:21,515 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 2 states. [2018-01-21 00:29:21,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:29:21,516 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2018-01-21 00:29:21,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:29:21,516 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-01-21 00:29:21,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:29:21,516 INFO L225 Difference]: With dead ends: 70 [2018-01-21 00:29:21,517 INFO L226 Difference]: Without dead ends: 40 [2018-01-21 00:29:21,517 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:21,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-21 00:29:21,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-01-21 00:29:21,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-21 00:29:21,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2018-01-21 00:29:21,519 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 18 [2018-01-21 00:29:21,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:29:21,519 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2018-01-21 00:29:21,519 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:29:21,519 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2018-01-21 00:29:21,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-21 00:29:21,519 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:29:21,520 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:21,520 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 00:29:21,520 INFO L82 PathProgramCache]: Analyzing trace with hash -371306179, now seen corresponding path program 1 times [2018-01-21 00:29:21,520 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:29:21,521 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:21,521 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:21,521 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:21,521 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:29:21,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:29:21,526 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,601 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:21,601 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:29:21,601 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-21 00:29:21,601 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:29:21,602 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 00:29:21,602 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 00:29:21,602 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 00:29:21,602 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 3 states. [2018-01-21 00:29:21,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:29:21,672 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2018-01-21 00:29:21,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 00:29:21,672 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-01-21 00:29:21,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:29:21,673 INFO L225 Difference]: With dead ends: 105 [2018-01-21 00:29:21,673 INFO L226 Difference]: Without dead ends: 73 [2018-01-21 00:29:21,673 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:21,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-21 00:29:21,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 41. [2018-01-21 00:29:21,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-21 00:29:21,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-01-21 00:29:21,675 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 23 [2018-01-21 00:29:21,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:29:21,675 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-01-21 00:29:21,675 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 00:29:21,675 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-01-21 00:29:21,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-21 00:29:21,676 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:29:21,676 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:21,676 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-21 00:29:21,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1392374533, now seen corresponding path program 1 times [2018-01-21 00:29:21,676 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:29:21,677 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:21,677 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:21,677 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:21,677 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:29:21,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:29:21,682 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,713 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:21,713 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:29:21,713 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 00:29:21,714 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:29:21,714 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 00:29:21,714 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 00:29:21,714 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-21 00:29:21,714 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 4 states. [2018-01-21 00:29:21,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:29:21,737 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2018-01-21 00:29:21,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 00:29:21,738 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-01-21 00:29:21,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:29:21,738 INFO L225 Difference]: With dead ends: 71 [2018-01-21 00:29:21,738 INFO L226 Difference]: Without dead ends: 50 [2018-01-21 00:29:21,739 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:21,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-21 00:29:21,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2018-01-21 00:29:21,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-21 00:29:21,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-01-21 00:29:21,740 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 23 [2018-01-21 00:29:21,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:29:21,741 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-01-21 00:29:21,741 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 00:29:21,741 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-01-21 00:29:21,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-21 00:29:21,741 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:29:21,741 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:21,741 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-21 00:29:21,741 INFO L82 PathProgramCache]: Analyzing trace with hash -634636265, now seen corresponding path program 1 times [2018-01-21 00:29:21,742 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:29:21,742 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:21,742 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:21,743 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:21,743 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:29:21,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:29:21,750 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,806 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:21,806 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:29:21,806 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-21 00:29:21,806 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:29:21,807 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 00:29:21,807 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 00:29:21,807 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 00:29:21,807 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 4 states. [2018-01-21 00:29:21,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:29:21,822 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-01-21 00:29:21,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 00:29:21,822 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-01-21 00:29:21,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:29:21,822 INFO L225 Difference]: With dead ends: 43 [2018-01-21 00:29:21,822 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:29:21,823 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:21,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:29:21,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:29:21,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:29:21,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:29:21,823 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2018-01-21 00:29:21,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:29:21,823 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:29:21,823 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 00:29:21,824 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:29:21,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:29:21,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 12:29:21 BoogieIcfgContainer [2018-01-21 00:29:21,826 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 00:29:21,827 INFO L168 Benchmark]: Toolchain (without parser) took 14511.47 ms. Allocated memory was 303.6 MB in the beginning and 615.0 MB in the end (delta: 311.4 MB). Free memory was 261.9 MB in the beginning and 496.6 MB in the end (delta: -234.7 MB). Peak memory consumption was 76.7 MB. Max. memory is 5.3 GB. [2018-01-21 00:29:21,827 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 303.6 MB. Free memory is still 267.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 00:29:21,827 INFO L168 Benchmark]: CACSL2BoogieTranslator took 215.31 ms. Allocated memory is still 303.6 MB. Free memory was 260.9 MB in the beginning and 250.7 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-21 00:29:21,828 INFO L168 Benchmark]: Boogie Preprocessor took 37.33 ms. Allocated memory is still 303.6 MB. Free memory was 250.7 MB in the beginning and 248.7 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:21,828 INFO L168 Benchmark]: RCFGBuilder took 256.60 ms. Allocated memory is still 303.6 MB. Free memory was 248.7 MB in the beginning and 232.2 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:21,828 INFO L168 Benchmark]: TraceAbstraction took 13995.02 ms. Allocated memory was 303.6 MB in the beginning and 615.0 MB in the end (delta: 311.4 MB). Free memory was 232.2 MB in the beginning and 496.6 MB in the end (delta: -264.4 MB). Peak memory consumption was 47.0 MB. Max. memory is 5.3 GB. [2018-01-21 00:29:21,829 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 303.6 MB. Free memory is still 267.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 215.31 ms. Allocated memory is still 303.6 MB. Free memory was 260.9 MB in the beginning and 250.7 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 37.33 ms. Allocated memory is still 303.6 MB. Free memory was 250.7 MB in the beginning and 248.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 256.60 ms. Allocated memory is still 303.6 MB. Free memory was 248.7 MB in the beginning and 232.2 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 13995.02 ms. Allocated memory was 303.6 MB in the beginning and 615.0 MB in the end (delta: 311.4 MB). Free memory was 232.2 MB in the beginning and 496.6 MB in the end (delta: -264.4 MB). Peak memory consumption was 47.0 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 : 56 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) : 0.706699 RENAME_VARIABLES(MILLISECONDS) : 0.028288 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.469111 PROJECTAWAY(MILLISECONDS) : 1.847369 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.002215 DISJOIN(MILLISECONDS) : 2.501851 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.049007 ADD_EQUALITY(MILLISECONDS) : 0.032670 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.024829 #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.933659 RENAME_VARIABLES(MILLISECONDS) : 0.030381 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.671248 PROJECTAWAY(MILLISECONDS) : 1.918037 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.002960 DISJOIN(MILLISECONDS) : 0.841198 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.058541 ADD_EQUALITY(MILLISECONDS) : 0.040621 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.024330 #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) : 1.775437 RENAME_VARIABLES(MILLISECONDS) : 0.030069 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.211488 PROJECTAWAY(MILLISECONDS) : 2.423234 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.002476 DISJOIN(MILLISECONDS) : 0.704954 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.057528 ADD_EQUALITY(MILLISECONDS) : 0.030459 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.016904 #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 : 67 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.622547 RENAME_VARIABLES(MILLISECONDS) : 0.025712 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.399197 PROJECTAWAY(MILLISECONDS) : 0.818750 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.002170 DISJOIN(MILLISECONDS) : 0.406918 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.047987 ADD_EQUALITY(MILLISECONDS) : 0.026685 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.011663 #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*sizeof(int)) VAL [__builtin_alloca (length*sizeof(int))={13:0}, length=3] [L545] int *arr = __builtin_alloca (length*sizeof(int)); [L546] i=0 VAL [__builtin_alloca (length*sizeof(int))={13:0}, arr={13:0}, i=0, length=3] [L546] COND TRUE i