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_smtcomp.epf -i ../../../trunk/examples/svcomp/array-memsafety/reverse_array_unsafe_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 10:05:47,137 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 10:05:47,139 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 10:05:47,156 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 10:05:47,157 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 10:05:47,158 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 10:05:47,159 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 10:05:47,161 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 10:05:47,163 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 10:05:47,164 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 10:05:47,165 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 10:05:47,166 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 10:05:47,167 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 10:05:47,168 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 10:05:47,169 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 10:05:47,171 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 10:05:47,174 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 10:05:47,176 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 10:05:47,177 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 10:05:47,178 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 10:05:47,181 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 10:05:47,181 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 10:05:47,181 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 10:05:47,182 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 10:05:47,183 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 10:05:47,185 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 10:05:47,185 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 10:05:47,186 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 10:05:47,186 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 10:05:47,186 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 10:05:47,187 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 10:05:47,187 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_smtcomp.epf [2018-01-21 10:05:47,197 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 10:05:47,197 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 10:05:47,198 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 10:05:47,198 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 10:05:47,199 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 10:05:47,199 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 10:05:47,199 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-21 10:05:47,199 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 10:05:47,200 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 10:05:47,200 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 10:05:47,200 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 10:05:47,201 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 10:05:47,201 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 10:05:47,201 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 10:05:47,201 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 10:05:47,201 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 10:05:47,202 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 10:05:47,202 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 10:05:47,202 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 10:05:47,202 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 10:05:47,202 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 10:05:47,203 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 10:05:47,203 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 10:05:47,203 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 10:05:47,203 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 10:05:47,204 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 10:05:47,204 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 10:05:47,204 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 10:05:47,204 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 10:05:47,204 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 10:05:47,205 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 10:05:47,205 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 10:05:47,205 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 10:05:47,205 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 10:05:47,205 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 10:05:47,205 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 10:05:47,206 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 10:05:47,207 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 10:05:47,207 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 10:05:47,244 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 10:05:47,256 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 10:05:47,261 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 10:05:47,262 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 10:05:47,263 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 10:05:47,264 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/reverse_array_unsafe_false-valid-deref.i [2018-01-21 10:05:47,434 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 10:05:47,439 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 10:05:47,440 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 10:05:47,441 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 10:05:47,448 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 10:05:47,449 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 10:05:47" (1/1) ... [2018-01-21 10:05:47,453 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 10:05:47, skipping insertion in model container [2018-01-21 10:05:47,453 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 10:05:47" (1/1) ... [2018-01-21 10:05:47,474 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 10:05:47,515 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 10:05:47,643 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 10:05:47,660 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 10:05:47,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:05:47 WrapperNode [2018-01-21 10:05:47,668 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 10:05:47,669 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 10:05:47,669 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 10:05:47,669 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 10:05:47,685 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:05:47" (1/1) ... [2018-01-21 10:05:47,686 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:05:47" (1/1) ... [2018-01-21 10:05:47,694 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:05:47" (1/1) ... [2018-01-21 10:05:47,694 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:05:47" (1/1) ... [2018-01-21 10:05:47,699 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:05:47" (1/1) ... [2018-01-21 10:05:47,704 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:05:47" (1/1) ... [2018-01-21 10:05:47,705 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:05:47" (1/1) ... [2018-01-21 10:05:47,708 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 10:05:47,708 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 10:05:47,708 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 10:05:47,708 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 10:05:47,709 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:05:47" (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 10:05:47,761 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 10:05:47,762 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 10:05:47,762 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 10:05:47,762 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 10:05:47,762 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 10:05:47,762 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 10:05:47,762 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 10:05:47,762 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 10:05:47,762 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 10:05:47,762 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 10:05:47,763 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 10:05:47,763 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 10:05:47,965 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 10:05:47,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 10:05:47 BoogieIcfgContainer [2018-01-21 10:05:47,965 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 10:05:47,966 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 10:05:47,966 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 10:05:47,968 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 10:05:47,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 10:05:47" (1/3) ... [2018-01-21 10:05:47,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12feb96e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 10:05:47, skipping insertion in model container [2018-01-21 10:05:47,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:05:47" (2/3) ... [2018-01-21 10:05:47,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12feb96e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 10:05:47, skipping insertion in model container [2018-01-21 10:05:47,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 10:05:47" (3/3) ... [2018-01-21 10:05:47,971 INFO L105 eAbstractionObserver]: Analyzing ICFG reverse_array_unsafe_false-valid-deref.i [2018-01-21 10:05:47,977 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 10:05:47,983 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-21 10:05:48,035 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:05:48,035 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:05:48,036 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:05:48,036 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:05:48,036 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:05:48,036 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:05:48,036 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:05:48,036 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 10:05:48,037 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:05:48,058 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-01-21 10:05:48,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 10:05:48,064 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:05:48,065 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 10:05:48,066 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 10:05:48,071 INFO L82 PathProgramCache]: Analyzing trace with hash 109556, now seen corresponding path program 1 times [2018-01-21 10:05:48,074 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:05:48,120 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:05:48,120 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:05:48,120 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:05:48,121 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:05:48,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:05:48,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:05:48,177 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 10:05:48,185 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:05:48,192 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:05:48,192 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:05:48,192 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:05:48,192 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:05:48,192 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:05:48,193 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:05:48,193 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:05:48,193 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 10:05:48,193 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:05:48,195 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-01-21 10:05:48,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-21 10:05:48,197 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:05:48,197 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 10:05:48,197 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 10:05:48,198 INFO L82 PathProgramCache]: Analyzing trace with hash 964801099, now seen corresponding path program 1 times [2018-01-21 10:05:48,198 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:05:48,199 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:05:48,199 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:05:48,199 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:05:48,200 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:05:48,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:05:48,238 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:05:48,277 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 10:05:48,278 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:05:48,278 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 10:05:48,278 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:05:48,280 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 10:05:48,291 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 10:05:48,291 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 10:05:48,293 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 2 states. [2018-01-21 10:05:48,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:05:48,381 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2018-01-21 10:05:48,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 10:05:48,382 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-01-21 10:05:48,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:05:48,391 INFO L225 Difference]: With dead ends: 70 [2018-01-21 10:05:48,391 INFO L226 Difference]: Without dead ends: 42 [2018-01-21 10:05:48,393 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 10:05:48,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-01-21 10:05:48,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-01-21 10:05:48,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-21 10:05:48,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-01-21 10:05:48,426 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 20 [2018-01-21 10:05:48,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:05:48,427 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-01-21 10:05:48,427 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 10:05:48,427 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-01-21 10:05:48,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-21 10:05:48,428 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:05:48,428 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 10:05:48,428 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 10:05:48,429 INFO L82 PathProgramCache]: Analyzing trace with hash -342950740, now seen corresponding path program 1 times [2018-01-21 10:05:48,429 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:05:48,430 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:05:48,430 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:05:48,430 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:05:48,430 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:05:48,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:05:48,454 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:05:48,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 10:05:48,606 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:05:48,606 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-21 10:05:48,606 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:05:48,608 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 10:05:48,609 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 10:05:48,609 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 10:05:48,609 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 3 states. [2018-01-21 10:05:48,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:05:48,651 INFO L93 Difference]: Finished difference Result 109 states and 122 transitions. [2018-01-21 10:05:48,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 10:05:48,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-01-21 10:05:48,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:05:48,656 INFO L225 Difference]: With dead ends: 109 [2018-01-21 10:05:48,657 INFO L226 Difference]: Without dead ends: 75 [2018-01-21 10:05:48,658 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 10:05:48,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-21 10:05:48,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 43. [2018-01-21 10:05:48,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-21 10:05:48,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-01-21 10:05:48,664 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 25 [2018-01-21 10:05:48,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:05:48,664 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-01-21 10:05:48,664 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 10:05:48,664 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-01-21 10:05:48,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-21 10:05:48,666 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:05:48,666 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 10:05:48,666 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 10:05:48,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1957871850, now seen corresponding path program 1 times [2018-01-21 10:05:48,666 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:05:48,668 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:05:48,668 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:05:48,668 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:05:48,668 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:05:48,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:05:48,688 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:05:48,733 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 10:05:48,734 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:05:48,734 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 10:05:48,734 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:05:48,735 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 10:05:48,735 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 10:05:48,735 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-21 10:05:48,735 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 4 states. [2018-01-21 10:05:48,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:05:48,826 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2018-01-21 10:05:48,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 10:05:48,827 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-01-21 10:05:48,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:05:48,828 INFO L225 Difference]: With dead ends: 75 [2018-01-21 10:05:48,828 INFO L226 Difference]: Without dead ends: 52 [2018-01-21 10:05:48,829 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 10:05:48,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-21 10:05:48,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 45. [2018-01-21 10:05:48,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-21 10:05:48,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2018-01-21 10:05:48,836 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 25 [2018-01-21 10:05:48,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:05:48,836 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2018-01-21 10:05:48,836 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 10:05:48,836 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-01-21 10:05:48,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-21 10:05:48,838 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:05:48,838 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 10:05:48,838 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 10:05:48,838 INFO L82 PathProgramCache]: Analyzing trace with hash -92922, now seen corresponding path program 1 times [2018-01-21 10:05:48,838 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:05:48,839 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:05:48,839 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:05:48,839 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:05:48,840 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:05:48,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:05:48,869 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:05:49,637 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 10:05:49,638 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:05:49,638 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 10:05:49,639 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-01-21 10:05:49,642 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 10:05:49,712 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 10:05:49,712 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 10:05:55,150 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 10:05:55,151 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 10:05:55,166 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 10:05:55,166 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:05:55,167 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 10:05:55,173 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:05:55,174 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 10:05:55,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:05:55,197 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:05:55,308 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 10:05:55,315 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:05:55,316 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 10:05:55,317 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:05:55,347 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:05:55,351 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 10:05:55,354 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:05:55,355 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 10:05:55,356 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 10:05:55,364 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:05:55,387 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 10:05:55,388 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:109, output treesize:26 [2018-01-21 10:05:55,449 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 10:05:55,452 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 10:05:55,453 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:05:55,458 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:05:55,462 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 10:05:55,462 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:4 [2018-01-21 10:05:55,485 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 10:05:55,485 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:05:55,640 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 10:05:55,675 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 10:05:55,676 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:05:55,679 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 10:05:55,679 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 10:05:55,685 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 10:05:55,700 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 10:05:55,727 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 10:05:55,728 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-21 10:05:55,729 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 10:05:55,730 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-21 10:05:55,742 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 10:05:55,755 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 10:05:55,755 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:72, output treesize:41 [2018-01-21 10:05:55,844 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 10:05:55,866 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:05:55,866 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 10:05:55,871 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:05:55,871 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 10:05:55,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:05:55,900 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:05:55,970 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-01-21 10:05:55,971 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 10:05:55,996 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 10:05:55,999 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:05:56,000 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 10:05:56,000 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 10:05:56,005 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:05:56,011 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 10:05:56,011 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:118, output treesize:29 [2018-01-21 10:05:56,068 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 10:05:56,071 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 10:05:56,072 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:05:56,077 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:05:56,082 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 10:05:56,083 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:4 [2018-01-21 10:05:56,098 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 10:05:56,100 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:05:56,145 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 10:05:56,161 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 10:05:56,161 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:05:56,163 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 10:05:56,163 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 10:05:56,168 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 10:05:56,181 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 10:05:56,196 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 10:05:56,197 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-21 10:05:56,199 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 10:05:56,200 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-21 10:05:56,210 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 10:05:56,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-21 10:05:56,225 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:72, output treesize:41 [2018-01-21 10:05:56,249 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 10:05:56,252 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 10:05:56,252 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10, 11, 10] total 28 [2018-01-21 10:05:56,252 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 10:05:56,252 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-21 10:05:56,253 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-21 10:05:56,253 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2018-01-21 10:05:56,253 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 18 states. [2018-01-21 10:05:56,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:05:56,863 INFO L93 Difference]: Finished difference Result 102 states and 113 transitions. [2018-01-21 10:05:56,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-21 10:05:56,864 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 30 [2018-01-21 10:05:56,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:05:56,865 INFO L225 Difference]: With dead ends: 102 [2018-01-21 10:05:56,865 INFO L226 Difference]: Without dead ends: 81 [2018-01-21 10:05:56,866 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 97 SyntacticMatches, 9 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=296, Invalid=1186, Unknown=0, NotChecked=0, Total=1482 [2018-01-21 10:05:56,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-21 10:05:56,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 56. [2018-01-21 10:05:56,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-21 10:05:56,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2018-01-21 10:05:56,875 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 30 [2018-01-21 10:05:56,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:05:56,875 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2018-01-21 10:05:56,875 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-21 10:05:56,875 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2018-01-21 10:05:56,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-21 10:05:56,876 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:05:56,876 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 10:05:56,877 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 10:05:56,877 INFO L82 PathProgramCache]: Analyzing trace with hash 2111018345, now seen corresponding path program 1 times [2018-01-21 10:05:56,877 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:05:56,878 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:05:56,878 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:05:56,878 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:05:56,879 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:05:56,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:05:56,900 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:05:57,133 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 10:05:57,133 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:05:57,133 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-21 10:05:57,133 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:05:57,134 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-21 10:05:57,134 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-21 10:05:57,134 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-01-21 10:05:57,134 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand 11 states. [2018-01-21 10:05:57,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:05:57,364 INFO L93 Difference]: Finished difference Result 128 states and 143 transitions. [2018-01-21 10:05:57,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-21 10:05:57,364 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-01-21 10:05:57,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:05:57,365 INFO L225 Difference]: With dead ends: 128 [2018-01-21 10:05:57,365 INFO L226 Difference]: Without dead ends: 121 [2018-01-21 10:05:57,366 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 10:05:57,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-21 10:05:57,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 89. [2018-01-21 10:05:57,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-21 10:05:57,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 101 transitions. [2018-01-21 10:05:57,374 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 101 transitions. Word has length 32 [2018-01-21 10:05:57,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:05:57,375 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 101 transitions. [2018-01-21 10:05:57,375 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-21 10:05:57,375 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 101 transitions. [2018-01-21 10:05:57,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-21 10:05:57,376 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:05:57,376 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 10:05:57,376 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 10:05:57,376 INFO L82 PathProgramCache]: Analyzing trace with hash 2032509349, now seen corresponding path program 1 times [2018-01-21 10:05:57,376 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:05:57,377 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:05:57,377 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:05:57,377 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:05:57,377 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:05:57,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:05:57,392 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:05:57,433 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 10:05:57,433 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:05:57,434 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 10:05:57,434 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-01-21 10:05:57,434 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 10:05:57,436 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 10:05:57,436 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 10:05:59,113 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 10:05:59,113 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 10:05:59,115 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 10:05:59,115 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:05:59,115 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 10:05:59,120 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:05:59,120 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 10:05:59,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:05:59,133 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:05:59,156 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 10:05:59,156 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:05:59,177 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 10:05:59,196 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:05:59,196 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 10:05:59,199 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:05:59,200 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 10:05:59,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:05:59,225 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:05:59,228 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 10:05:59,229 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:05:59,246 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:05:59,247 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 10:05:59,247 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6] total 9 [2018-01-21 10:05:59,248 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 10:05:59,248 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-21 10:05:59,248 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-21 10:05:59,248 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-01-21 10:05:59,248 INFO L87 Difference]: Start difference. First operand 89 states and 101 transitions. Second operand 8 states. [2018-01-21 10:05:59,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:05:59,338 INFO L93 Difference]: Finished difference Result 185 states and 209 transitions. [2018-01-21 10:05:59,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-21 10:05:59,338 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-01-21 10:05:59,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:05:59,339 INFO L225 Difference]: With dead ends: 185 [2018-01-21 10:05:59,339 INFO L226 Difference]: Without dead ends: 156 [2018-01-21 10:05:59,339 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 119 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-01-21 10:05:59,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-01-21 10:05:59,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 103. [2018-01-21 10:05:59,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-21 10:05:59,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2018-01-21 10:05:59,350 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 32 [2018-01-21 10:05:59,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:05:59,351 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2018-01-21 10:05:59,351 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-21 10:05:59,351 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2018-01-21 10:05:59,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-21 10:05:59,352 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:05:59,353 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 10:05:59,353 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 10:05:59,353 INFO L82 PathProgramCache]: Analyzing trace with hash -2121909337, now seen corresponding path program 1 times [2018-01-21 10:05:59,353 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:05:59,354 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:05:59,354 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:05:59,354 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:05:59,354 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:05:59,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:05:59,369 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:05:59,521 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 10:05:59,521 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:05:59,521 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 10:05:59,521 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-01-21 10:05:59,521 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 10:05:59,523 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 10:05:59,523 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 10:06:00,960 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 10:06:00,960 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 10:06:00,964 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 10:06:00,964 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:06:00,964 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 10:06:00,974 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:06:00,974 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 10:06:00,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:06:00,988 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:06:01,077 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-01-21 10:06:01,077 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 10:06:01,079 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 10:06:01,082 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:06:01,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 10:06:01,083 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 10:06:01,091 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:06:01,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:06:01,122 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:127, output treesize:32 [2018-01-21 10:06:01,172 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 10:06:01,174 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:06:01,174 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 10:06:01,175 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 10:06:01,175 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:06:01,179 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:06:01,205 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 10:06:01,205 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:4 [2018-01-21 10:06:01,225 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 10:06:01,225 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:06:01,396 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 10:06:01,410 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 10:06:01,410 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:06:01,411 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 10:06:01,411 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 10:06:01,415 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 10:06:01,420 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 10:06:01,420 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:40, output treesize:37 [2018-01-21 10:06:01,448 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 10:06:01,469 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:06:01,469 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 10:06:01,472 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:06:01,472 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 10:06:01,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:06:01,510 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:06:01,575 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-01-21 10:06:01,575 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 10:06:01,590 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 10:06:01,592 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 10:06:01,592 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 10:06:01,594 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:06:01,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:06:01,600 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:103, output treesize:24 [2018-01-21 10:06:01,807 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 10:06:01,810 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:06:01,811 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 10:06:01,813 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 10:06:01,813 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:06:01,818 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:06:01,822 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 10:06:01,823 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:4 [2018-01-21 10:06:01,844 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 10:06:01,845 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:06:01,971 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 10:06:01,995 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 10:06:01,995 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:06:01,996 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 10:06:01,997 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 10:06:02,000 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:06:02,002 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 10:06:02,028 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 10:06:02,028 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-21 10:06:02,029 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 10:06:02,030 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-21 10:06:02,034 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:06:02,076 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 10:06:02,103 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 10:06:02,104 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-21 10:06:02,105 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 10:06:02,106 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-21 10:06:02,113 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:06:02,135 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 10:06:02,155 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 10:06:02,155 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-21 10:06:02,157 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 10:06:02,157 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-21 10:06:02,163 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:06:02,180 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 10:06:02,200 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 10:06:02,201 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-01-21 10:06:02,202 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 10:06:02,202 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-01-21 10:06:02,206 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:06:02,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-21 10:06:02,224 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 5 variables, input treesize:434, output treesize:40 [2018-01-21 10:06:04,988 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 10:06:04,990 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 10:06:04,990 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12, 14, 13] total 40 [2018-01-21 10:06:04,990 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 10:06:04,990 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-21 10:06:04,991 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-21 10:06:04,991 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1372, Unknown=1, NotChecked=0, Total=1560 [2018-01-21 10:06:04,991 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand 19 states. [2018-01-21 10:06:05,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:06:05,796 INFO L93 Difference]: Finished difference Result 234 states and 263 transitions. [2018-01-21 10:06:05,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-21 10:06:05,797 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 32 [2018-01-21 10:06:05,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:06:05,798 INFO L225 Difference]: With dead ends: 234 [2018-01-21 10:06:05,798 INFO L226 Difference]: Without dead ends: 227 [2018-01-21 10:06:05,799 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 94 SyntacticMatches, 7 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1077 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=685, Invalid=3096, Unknown=1, NotChecked=0, Total=3782 [2018-01-21 10:06:05,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-01-21 10:06:05,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 117. [2018-01-21 10:06:05,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-01-21 10:06:05,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 133 transitions. [2018-01-21 10:06:05,811 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 133 transitions. Word has length 32 [2018-01-21 10:06:05,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:06:05,811 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 133 transitions. [2018-01-21 10:06:05,811 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-21 10:06:05,811 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 133 transitions. [2018-01-21 10:06:05,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-21 10:06:05,813 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:06:05,813 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 10:06:05,813 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 10:06:05,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1617625150, now seen corresponding path program 1 times [2018-01-21 10:06:05,814 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:06:05,815 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:06:05,815 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:06:05,815 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:06:05,815 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:06:05,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:06:05,826 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:06:06,545 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 10:06:06,545 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:06:06,545 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 10:06:06,545 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-01-21 10:06:06,545 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 10:06:06,546 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 10:06:06,547 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 10:06:14,524 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 10:06:14,524 INFO L268 AbstractInterpreter]: Visited 33 different actions 77 times. Merged at 21 different actions 42 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 31 variables. [2018-01-21 10:06:14,538 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 10:06:14,538 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:06:14,539 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 10:06:14,543 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:06:14,543 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 10:06:14,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:06:14,560 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:06:14,658 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:06:14,659 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 10:06:14,661 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 10:06:14,662 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:06:14,665 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:06:14,669 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 10:06:14,670 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:11 [2018-01-21 10:06:14,690 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-01-21 10:06:14,690 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 10:06:14,704 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 26 treesize of output 21 [2018-01-21 10:06:14,706 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:06:14,707 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:06:14,708 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 10:06:14,708 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 10:06:14,716 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:06:14,721 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 10:06:14,722 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:106, output treesize:25 [2018-01-21 10:06:14,785 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 10:06:14,788 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:06:14,789 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:06:14,789 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 10:06:14,790 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:06:14,794 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:06:14,797 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 10:06:14,797 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:3 [2018-01-21 10:06:14,820 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 10:06:14,820 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:06:15,185 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 10:06:15,187 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 10:06:15,188 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 10:06:15,196 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 10:06:15,197 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 10:06:15,197 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 10:06:15,197 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 10:06:15,199 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 10:06:15,199 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 10:06:15,204 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 10:06:15,212 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 10:06:15,231 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 10:06:15,233 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 10:06:15,234 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 10:06:15,244 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 10:06:15,244 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-21 10:06:15,246 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 10:06:15,246 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 10:06:15,247 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 10:06:15,247 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-21 10:06:15,252 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 10:06:15,261 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 10:06:15,280 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 10:06:15,280 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:110, output treesize:61 [2018-01-21 10:06:15,367 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 10:06:15,388 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:06:15,389 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 10:06:15,392 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:06:15,392 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 10:06:15,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:06:15,430 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:06:15,595 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:06:15,595 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 10:06:15,598 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:06:15,599 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 10:06:15,599 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:06:15,602 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:06:15,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:06:15,607 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:16 [2018-01-21 10:06:15,644 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 10:06:15,647 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:06:15,648 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:06:15,648 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 10:06:15,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:06:15,658 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:06:15,661 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 10:06:15,664 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:06:15,664 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:06:15,665 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 10:06:15,665 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 10:06:15,673 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:06:15,695 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 10:06:15,695 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:121, output treesize:30 [2018-01-21 10:06:15,771 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 10:06:15,773 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:06:15,774 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:06:15,774 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 10:06:15,774 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:06:15,777 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:06:15,780 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 10:06:15,780 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:3 [2018-01-21 10:06:15,806 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 10:06:15,806 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:06:16,110 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 10:06:16,112 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 10:06:16,112 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 10:06:16,128 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 10:06:16,128 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 10:06:16,130 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 10:06:16,130 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 10:06:16,131 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 10:06:16,131 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 10:06:16,134 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 10:06:16,140 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 10:06:16,156 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 10:06:16,158 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 10:06:16,158 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 10:06:16,176 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 10:06:16,177 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-21 10:06:16,178 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 10:06:16,179 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 10:06:16,179 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 10:06:16,180 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-21 10:06:16,183 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 10:06:16,193 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 10:06:16,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-21 10:06:16,205 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:108, output treesize:41 [2018-01-21 10:06:16,244 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 10:06:16,246 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 10:06:16,246 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 13, 14, 13] total 49 [2018-01-21 10:06:16,246 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 10:06:16,247 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-21 10:06:16,247 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-21 10:06:16,248 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=2048, Unknown=0, NotChecked=0, Total=2352 [2018-01-21 10:06:16,248 INFO L87 Difference]: Start difference. First operand 117 states and 133 transitions. Second operand 25 states. [2018-01-21 10:06:17,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:06:17,401 INFO L93 Difference]: Finished difference Result 214 states and 240 transitions. [2018-01-21 10:06:17,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-21 10:06:17,402 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 34 [2018-01-21 10:06:17,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:06:17,403 INFO L225 Difference]: With dead ends: 214 [2018-01-21 10:06:17,404 INFO L226 Difference]: Without dead ends: 193 [2018-01-21 10:06:17,406 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 98 SyntacticMatches, 6 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1548 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=725, Invalid=4105, Unknown=0, NotChecked=0, Total=4830 [2018-01-21 10:06:17,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-01-21 10:06:17,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 117. [2018-01-21 10:06:17,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-01-21 10:06:17,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 133 transitions. [2018-01-21 10:06:17,417 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 133 transitions. Word has length 34 [2018-01-21 10:06:17,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:06:17,417 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 133 transitions. [2018-01-21 10:06:17,417 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-21 10:06:17,417 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 133 transitions. [2018-01-21 10:06:17,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-21 10:06:17,419 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:06:17,419 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 10:06:17,419 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 10:06:17,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1234541807, now seen corresponding path program 2 times [2018-01-21 10:06:17,419 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:06:17,420 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:06:17,420 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:06:17,420 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:06:17,421 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:06:17,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:06:17,431 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:06:17,503 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 10:06:17,503 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:06:17,503 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 10:06:17,503 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-21 10:06:17,503 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-21 10:06:17,503 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:06:17,503 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 10:06:17,514 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-21 10:06:17,514 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 10:06:17,524 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:06:17,527 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:06:17,528 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 10:06:17,530 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:06:17,582 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 10:06:17,582 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:06:17,607 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 10:06:17,628 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:06:17,628 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 10:06:17,631 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-21 10:06:17,631 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 10:06:17,642 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:06:17,655 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:06:17,667 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 10:06:17,671 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:06:17,711 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 10:06:17,712 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:06:17,743 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 10:06:17,746 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 10:06:17,747 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7] total 16 [2018-01-21 10:06:17,747 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 10:06:17,747 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-21 10:06:17,747 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-21 10:06:17,747 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2018-01-21 10:06:17,747 INFO L87 Difference]: Start difference. First operand 117 states and 133 transitions. Second operand 11 states. [2018-01-21 10:06:17,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:06:17,846 INFO L93 Difference]: Finished difference Result 209 states and 237 transitions. [2018-01-21 10:06:17,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-21 10:06:17,846 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2018-01-21 10:06:17,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:06:17,847 INFO L225 Difference]: With dead ends: 209 [2018-01-21 10:06:17,847 INFO L226 Difference]: Without dead ends: 180 [2018-01-21 10:06:17,848 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 10:06:17,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-01-21 10:06:17,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 129. [2018-01-21 10:06:17,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-01-21 10:06:17,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 146 transitions. [2018-01-21 10:06:17,856 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 146 transitions. Word has length 37 [2018-01-21 10:06:17,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:06:17,856 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 146 transitions. [2018-01-21 10:06:17,856 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-21 10:06:17,856 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 146 transitions. [2018-01-21 10:06:17,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-21 10:06:17,857 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:06:17,857 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 10:06:17,857 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 10:06:17,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1211909553, now seen corresponding path program 2 times [2018-01-21 10:06:17,858 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:06:17,858 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:06:17,858 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-21 10:06:17,858 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:06:17,859 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:06:17,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:06:17,870 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:06:18,055 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 10:06:18,056 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:06:18,056 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 10:06:18,056 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-21 10:06:18,056 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-21 10:06:18,056 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:06:18,057 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 10:06:18,064 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-21 10:06:18,065 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 10:06:18,075 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:06:18,080 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:06:18,081 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 10:06:18,083 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:06:18,165 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 10:06:18,165 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:06:18,255 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 10:06:18,275 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:06:18,275 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 10:06:18,278 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-21 10:06:18,278 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 10:06:18,288 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:06:18,299 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:06:18,311 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 10:06:18,315 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:06:18,322 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 10:06:18,323 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:06:18,332 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 10:06:18,333 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 10:06:18,333 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7, 8, 7] total 18 [2018-01-21 10:06:18,333 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 10:06:18,334 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-21 10:06:18,334 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-21 10:06:18,334 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2018-01-21 10:06:18,334 INFO L87 Difference]: Start difference. First operand 129 states and 146 transitions. Second operand 13 states. [2018-01-21 10:06:18,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:06:18,438 INFO L93 Difference]: Finished difference Result 248 states and 280 transitions. [2018-01-21 10:06:18,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-21 10:06:18,438 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2018-01-21 10:06:18,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:06:18,440 INFO L225 Difference]: With dead ends: 248 [2018-01-21 10:06:18,440 INFO L226 Difference]: Without dead ends: 204 [2018-01-21 10:06:18,441 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 10:06:18,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-01-21 10:06:18,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 144. [2018-01-21 10:06:18,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-01-21 10:06:18,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 163 transitions. [2018-01-21 10:06:18,454 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 163 transitions. Word has length 37 [2018-01-21 10:06:18,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:06:18,454 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 163 transitions. [2018-01-21 10:06:18,455 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-21 10:06:18,455 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 163 transitions. [2018-01-21 10:06:18,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-21 10:06:18,456 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:06:18,456 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 10:06:18,456 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 10:06:18,456 INFO L82 PathProgramCache]: Analyzing trace with hash 859940133, now seen corresponding path program 3 times [2018-01-21 10:06:18,456 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:06:18,457 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:06:18,457 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-21 10:06:18,457 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:06:18,457 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:06:18,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:06:18,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:06:18,489 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 10:06:18,495 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:06:18,501 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:06:18,501 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:06:18,516 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:06:18,517 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:06:18,517 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:06:18,517 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:06:18,517 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:06:18,517 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:06:18,517 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:06:18,517 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 10:06:18,517 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:06:18,518 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-01-21 10:06:18,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-21 10:06:18,519 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:06:18,519 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 10:06:18,519 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 10:06:18,519 INFO L82 PathProgramCache]: Analyzing trace with hash -168828260, now seen corresponding path program 1 times [2018-01-21 10:06:18,519 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:06:18,520 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:06:18,520 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:06:18,520 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:06:18,520 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:06:18,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:06:18,526 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:06:18,531 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 10:06:18,531 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:06:18,531 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 10:06:18,532 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:06:18,532 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 10:06:18,532 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 10:06:18,532 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 10:06:18,532 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 2 states. [2018-01-21 10:06:18,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:06:18,533 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2018-01-21 10:06:18,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 10:06:18,534 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-01-21 10:06:18,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:06:18,534 INFO L225 Difference]: With dead ends: 70 [2018-01-21 10:06:18,534 INFO L226 Difference]: Without dead ends: 40 [2018-01-21 10:06:18,535 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 10:06:18,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-21 10:06:18,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-01-21 10:06:18,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-21 10:06:18,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2018-01-21 10:06:18,536 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 18 [2018-01-21 10:06:18,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:06:18,536 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2018-01-21 10:06:18,537 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 10:06:18,537 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2018-01-21 10:06:18,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-21 10:06:18,537 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:06:18,537 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 10:06:18,537 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 10:06:18,537 INFO L82 PathProgramCache]: Analyzing trace with hash -371306179, now seen corresponding path program 1 times [2018-01-21 10:06:18,537 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:06:18,538 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:06:18,538 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:06:18,538 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:06:18,538 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:06:18,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:06:18,543 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:06:18,586 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 10:06:18,586 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:06:18,587 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-21 10:06:18,587 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:06:18,587 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 10:06:18,587 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 10:06:18,587 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 10:06:18,587 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 3 states. [2018-01-21 10:06:18,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:06:18,603 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2018-01-21 10:06:18,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 10:06:18,604 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-01-21 10:06:18,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:06:18,604 INFO L225 Difference]: With dead ends: 105 [2018-01-21 10:06:18,604 INFO L226 Difference]: Without dead ends: 73 [2018-01-21 10:06:18,605 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 10:06:18,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-21 10:06:18,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 41. [2018-01-21 10:06:18,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-21 10:06:18,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-01-21 10:06:18,607 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 23 [2018-01-21 10:06:18,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:06:18,607 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-01-21 10:06:18,607 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 10:06:18,607 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-01-21 10:06:18,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-21 10:06:18,607 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:06:18,607 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 10:06:18,607 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-21 10:06:18,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1392374533, now seen corresponding path program 1 times [2018-01-21 10:06:18,608 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:06:18,608 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:06:18,608 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:06:18,609 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:06:18,609 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:06:18,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:06:18,614 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:06:18,632 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 10:06:18,632 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:06:18,632 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 10:06:18,632 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:06:18,632 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 10:06:18,633 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 10:06:18,633 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-21 10:06:18,633 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 4 states. [2018-01-21 10:06:18,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:06:18,652 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2018-01-21 10:06:18,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 10:06:18,653 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-01-21 10:06:18,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:06:18,653 INFO L225 Difference]: With dead ends: 71 [2018-01-21 10:06:18,653 INFO L226 Difference]: Without dead ends: 50 [2018-01-21 10:06:18,653 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 10:06:18,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-21 10:06:18,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2018-01-21 10:06:18,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-21 10:06:18,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-01-21 10:06:18,655 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 23 [2018-01-21 10:06:18,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:06:18,655 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-01-21 10:06:18,655 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 10:06:18,655 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-01-21 10:06:18,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-21 10:06:18,656 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:06:18,656 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 10:06:18,656 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-21 10:06:18,656 INFO L82 PathProgramCache]: Analyzing trace with hash -634636265, now seen corresponding path program 1 times [2018-01-21 10:06:18,656 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:06:18,657 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:06:18,657 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:06:18,657 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:06:18,657 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:06:18,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:06:18,665 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:06:18,726 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 10:06:18,726 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:06:18,726 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-21 10:06:18,726 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:06:18,727 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 10:06:18,727 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 10:06:18,727 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 10:06:18,727 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 4 states. [2018-01-21 10:06:18,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:06:18,750 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-01-21 10:06:18,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 10:06:18,750 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-01-21 10:06:18,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:06:18,751 INFO L225 Difference]: With dead ends: 43 [2018-01-21 10:06:18,751 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 10:06:18,751 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 10:06:18,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 10:06:18,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 10:06:18,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 10:06:18,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 10:06:18,751 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2018-01-21 10:06:18,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:06:18,752 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 10:06:18,752 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 10:06:18,752 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 10:06:18,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 10:06:18,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 10:06:18 BoogieIcfgContainer [2018-01-21 10:06:18,754 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 10:06:18,755 INFO L168 Benchmark]: Toolchain (without parser) took 31320.88 ms. Allocated memory was 306.7 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 265.0 MB in the beginning and 1.1 GB in the end (delta: -824.0 MB). Peak memory consumption was 361.4 MB. Max. memory is 5.3 GB. [2018-01-21 10:06:18,755 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 306.7 MB. Free memory is still 271.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 10:06:18,756 INFO L168 Benchmark]: CACSL2BoogieTranslator took 227.90 ms. Allocated memory is still 306.7 MB. Free memory was 264.0 MB in the beginning and 253.9 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-21 10:06:18,756 INFO L168 Benchmark]: Boogie Preprocessor took 39.25 ms. Allocated memory is still 306.7 MB. Free memory was 253.9 MB in the beginning and 251.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-21 10:06:18,756 INFO L168 Benchmark]: RCFGBuilder took 257.19 ms. Allocated memory is still 306.7 MB. Free memory was 251.9 MB in the beginning and 235.3 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 5.3 GB. [2018-01-21 10:06:18,756 INFO L168 Benchmark]: TraceAbstraction took 30788.49 ms. Allocated memory was 306.7 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 235.3 MB in the beginning and 1.1 GB in the end (delta: -853.7 MB). Peak memory consumption was 331.7 MB. Max. memory is 5.3 GB. [2018-01-21 10:06:18,759 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.25 ms. Allocated memory is still 306.7 MB. Free memory is still 271.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 227.90 ms. Allocated memory is still 306.7 MB. Free memory was 264.0 MB in the beginning and 253.9 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 39.25 ms. Allocated memory is still 306.7 MB. Free memory was 253.9 MB in the beginning and 251.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 257.19 ms. Allocated memory is still 306.7 MB. Free memory was 251.9 MB in the beginning and 235.3 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 30788.49 ms. Allocated memory was 306.7 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 235.3 MB in the beginning and 1.1 GB in the end (delta: -853.7 MB). Peak memory consumption was 331.7 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 : 16 LocStat_MAX_SIZEOF_WEQEDGELABEL : 3 LocStat_NO_SUPPORTING_EQUALITIES : 319 LocStat_NO_SUPPORTING_DISEQUALITIES : 76 LocStat_NO_DISJUNCTIONS : -56 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 33 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 43 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 34 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 31.829357 RENAME_VARIABLES(MILLISECONDS) : 0.015483 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 31.610111 PROJECTAWAY(MILLISECONDS) : 264.813626 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.118747 DISJOIN(MILLISECONDS) : 5.383870 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.029822 ADD_EQUALITY(MILLISECONDS) : 0.080752 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.039574 #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 : 4 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 361 LocStat_NO_SUPPORTING_DISEQUALITIES : 77 LocStat_NO_DISJUNCTIONS : -60 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 35 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 49 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 37 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 35.702409 RENAME_VARIABLES(MILLISECONDS) : 0.017941 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 35.529486 PROJECTAWAY(MILLISECONDS) : 45.285423 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.079140 DISJOIN(MILLISECONDS) : 1.832854 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.032160 ADD_EQUALITY(MILLISECONDS) : 0.021557 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.011401 #CONJOIN_DISJUNCTIVE : 73 #RENAME_VARIABLES : 136 #UNFREEZE : 0 #CONJOIN : 109 #PROJECTAWAY : 112 #ADD_WEAK_EQUALITY : 6 #DISJOIN : 5 #RENAME_VARIABLES_DISJUNCTIVE : 132 #ADD_EQUALITY : 50 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 5 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 30 LocStat_MAX_WEQGRAPH_SIZE : 4 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 382 LocStat_NO_SUPPORTING_DISEQUALITIES : 98 LocStat_NO_DISJUNCTIONS : -60 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 35 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 47 TransStat_NO_SUPPORTING_DISEQUALITIES : 7 TransStat_NO_DISJUNCTIONS : 37 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 15.581433 RENAME_VARIABLES(MILLISECONDS) : 0.012880 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 15.416333 PROJECTAWAY(MILLISECONDS) : 48.214133 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.084612 DISJOIN(MILLISECONDS) : 1.536127 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.025164 ADD_EQUALITY(MILLISECONDS) : 0.024458 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.007801 #CONJOIN_DISJUNCTIVE : 72 #RENAME_VARIABLES : 136 #UNFREEZE : 0 #CONJOIN : 108 #PROJECTAWAY : 112 #ADD_WEAK_EQUALITY : 6 #DISJOIN : 5 #RENAME_VARIABLES_DISJUNCTIVE : 132 #ADD_EQUALITY : 48 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 6 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 32 LocStat_MAX_WEQGRAPH_SIZE : 11 LocStat_MAX_SIZEOF_WEQEDGELABEL : 3 LocStat_NO_SUPPORTING_EQUALITIES : 364 LocStat_NO_SUPPORTING_DISEQUALITIES : 91 LocStat_NO_DISJUNCTIONS : -64 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 37 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 47 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 38 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 9.187720 RENAME_VARIABLES(MILLISECONDS) : 0.012117 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 8.995973 PROJECTAWAY(MILLISECONDS) : 79.201789 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.060858 DISJOIN(MILLISECONDS) : 1.838672 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.022830 ADD_EQUALITY(MILLISECONDS) : 0.015719 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.009545 #CONJOIN_DISJUNCTIVE : 113 #RENAME_VARIABLES : 217 #UNFREEZE : 0 #CONJOIN : 148 #PROJECTAWAY : 154 #ADD_WEAK_EQUALITY : 8 #DISJOIN : 9 #RENAME_VARIABLES_DISJUNCTIVE : 214 #ADD_EQUALITY : 49 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 3 procedures, 45 locations, 3 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L541] int i, j, tmp; [L542] int length = __VERIFIER_nondet_int(); [L543] COND FALSE !(length < 1) VAL [length=2] [L544] COND TRUE length % 2 == 0 [L544] length++ VAL [length=3] [L545] EXPR, FCALL __builtin_alloca (length) VAL [__builtin_alloca (length)={9:0}, length=3] [L545] int *arr = __builtin_alloca (length); [L546] i=0 VAL [__builtin_alloca (length)={9:0}, arr={9:0}, i=0, length=3] [L546] COND TRUE i