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_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/array-memsafety/reverse_array_unsafe_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-20 21:54:45,160 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-20 21:54:45,162 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-20 21:54:45,180 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-20 21:54:45,180 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-20 21:54:45,181 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-20 21:54:45,182 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-20 21:54:45,184 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-20 21:54:45,187 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-20 21:54:45,188 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-20 21:54:45,189 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-20 21:54:45,189 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-20 21:54:45,190 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-20 21:54:45,191 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-20 21:54:45,192 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-20 21:54:45,195 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-20 21:54:45,197 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-20 21:54:45,199 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-20 21:54:45,201 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-20 21:54:45,202 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-20 21:54:45,205 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-20 21:54:45,205 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-20 21:54:45,205 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-20 21:54:45,207 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-20 21:54:45,208 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-20 21:54:45,209 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-20 21:54:45,209 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-20 21:54:45,210 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-20 21:54:45,210 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-20 21:54:45,211 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-20 21:54:45,211 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-20 21:54:45,212 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Camel+AI_EQ.epf [2018-01-20 21:54:45,222 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-20 21:54:45,222 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-20 21:54:45,223 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-20 21:54:45,223 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-20 21:54:45,224 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-20 21:54:45,224 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-20 21:54:45,224 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-20 21:54:45,225 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-20 21:54:45,225 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-20 21:54:45,225 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-20 21:54:45,225 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-20 21:54:45,226 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-20 21:54:45,226 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-20 21:54:45,226 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-20 21:54:45,226 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-20 21:54:45,226 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-20 21:54:45,226 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-20 21:54:45,227 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-20 21:54:45,227 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-20 21:54:45,227 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-20 21:54:45,227 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-20 21:54:45,227 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-20 21:54:45,228 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-20 21:54:45,228 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-20 21:54:45,228 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-20 21:54:45,228 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-20 21:54:45,228 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-20 21:54:45,229 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-20 21:54:45,229 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-20 21:54:45,229 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-20 21:54:45,229 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-20 21:54:45,229 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-20 21:54:45,229 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-20 21:54:45,230 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-20 21:54:45,230 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-20 21:54:45,231 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-20 21:54:45,231 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-20 21:54:45,266 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-20 21:54:45,278 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-20 21:54:45,282 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-20 21:54:45,284 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-20 21:54:45,284 INFO L276 PluginConnector]: CDTParser initialized [2018-01-20 21:54:45,285 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-20 21:54:45,469 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-20 21:54:45,472 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-20 21:54:45,473 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-20 21:54:45,473 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-20 21:54:45,478 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-20 21:54:45,479 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 09:54:45" (1/1) ... [2018-01-20 21:54:45,482 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fcefd7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:54:45, skipping insertion in model container [2018-01-20 21:54:45,482 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 09:54:45" (1/1) ... [2018-01-20 21:54:45,499 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 21:54:45,539 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 21:54:45,649 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 21:54:45,665 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 21:54:45,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:54:45 WrapperNode [2018-01-20 21:54:45,672 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-20 21:54:45,673 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-20 21:54:45,673 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-20 21:54:45,673 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-20 21:54:45,690 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:54:45" (1/1) ... [2018-01-20 21:54:45,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:54:45" (1/1) ... [2018-01-20 21:54:45,701 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:54:45" (1/1) ... [2018-01-20 21:54:45,701 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:54:45" (1/1) ... [2018-01-20 21:54:45,704 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:54:45" (1/1) ... [2018-01-20 21:54:45,707 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:54:45" (1/1) ... [2018-01-20 21:54:45,708 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:54:45" (1/1) ... [2018-01-20 21:54:45,710 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-20 21:54:45,710 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-20 21:54:45,710 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-20 21:54:45,710 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-20 21:54:45,711 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:54:45" (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-20 21:54:45,757 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-20 21:54:45,757 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-20 21:54:45,758 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-20 21:54:45,758 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-20 21:54:45,758 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-20 21:54:45,758 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-20 21:54:45,758 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-20 21:54:45,758 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-20 21:54:45,759 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-20 21:54:45,759 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-20 21:54:45,759 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-20 21:54:45,759 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-20 21:54:45,957 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-20 21:54:45,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 09:54:45 BoogieIcfgContainer [2018-01-20 21:54:45,958 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-20 21:54:45,959 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-20 21:54:45,959 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-20 21:54:45,961 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-20 21:54:45,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.01 09:54:45" (1/3) ... [2018-01-20 21:54:45,962 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e77f7ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 09:54:45, skipping insertion in model container [2018-01-20 21:54:45,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:54:45" (2/3) ... [2018-01-20 21:54:45,962 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e77f7ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 09:54:45, skipping insertion in model container [2018-01-20 21:54:45,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 09:54:45" (3/3) ... [2018-01-20 21:54:45,964 INFO L105 eAbstractionObserver]: Analyzing ICFG reverse_array_unsafe_false-valid-deref.i [2018-01-20 21:54:45,971 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-20 21:54:45,976 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-20 21:54:46,024 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 21:54:46,025 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 21:54:46,025 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 21:54:46,025 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 21:54:46,025 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 21:54:46,025 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 21:54:46,026 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 21:54:46,026 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-20 21:54:46,027 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 21:54:46,047 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-01-20 21:54:46,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-20 21:54:46,054 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:54:46,055 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-20 21:54:46,055 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-20 21:54:46,060 INFO L82 PathProgramCache]: Analyzing trace with hash 109556, now seen corresponding path program 1 times [2018-01-20 21:54:46,063 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:54:46,063 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:54:46,116 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:46,117 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:54:46,117 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:46,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 21:54:46,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 21:54:46,169 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 21:54:46,175 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 21:54:46,180 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 21:54:46,180 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 21:54:46,181 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 21:54:46,181 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 21:54:46,181 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 21:54:46,181 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 21:54:46,181 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 21:54:46,181 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-20 21:54:46,181 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 21:54:46,182 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-01-20 21:54:46,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-20 21:54:46,184 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:54:46,184 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-20 21:54:46,184 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 21:54:46,184 INFO L82 PathProgramCache]: Analyzing trace with hash 964801099, now seen corresponding path program 1 times [2018-01-20 21:54:46,184 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:54:46,184 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:54:46,185 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:46,185 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:54:46,186 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:46,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:54:46,220 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:54:46,254 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-20 21:54:46,257 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 21:54:46,257 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 21:54:46,259 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 21:54:46,274 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 21:54:46,275 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 21:54:46,277 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 2 states. [2018-01-20 21:54:46,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:54:46,365 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2018-01-20 21:54:46,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 21:54:46,366 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-01-20 21:54:46,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:54:46,374 INFO L225 Difference]: With dead ends: 70 [2018-01-20 21:54:46,374 INFO L226 Difference]: Without dead ends: 42 [2018-01-20 21:54:46,376 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-20 21:54:46,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-01-20 21:54:46,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-01-20 21:54:46,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-20 21:54:46,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-01-20 21:54:46,406 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 20 [2018-01-20 21:54:46,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:54:46,406 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-01-20 21:54:46,406 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 21:54:46,407 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-01-20 21:54:46,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-20 21:54:46,407 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:54:46,407 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-20 21:54:46,408 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 21:54:46,408 INFO L82 PathProgramCache]: Analyzing trace with hash -342950740, now seen corresponding path program 1 times [2018-01-20 21:54:46,408 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:54:46,408 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:54:46,409 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:46,409 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:54:46,409 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:46,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:54:46,435 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:54:46,575 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-20 21:54:46,575 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 21:54:46,575 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-20 21:54:46,577 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 21:54:46,577 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 21:54:46,578 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 21:54:46,578 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 3 states. [2018-01-20 21:54:46,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:54:46,618 INFO L93 Difference]: Finished difference Result 109 states and 122 transitions. [2018-01-20 21:54:46,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 21:54:46,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-01-20 21:54:46,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:54:46,622 INFO L225 Difference]: With dead ends: 109 [2018-01-20 21:54:46,623 INFO L226 Difference]: Without dead ends: 75 [2018-01-20 21:54:46,624 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-20 21:54:46,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-20 21:54:46,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 43. [2018-01-20 21:54:46,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-20 21:54:46,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-01-20 21:54:46,629 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 25 [2018-01-20 21:54:46,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:54:46,630 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-01-20 21:54:46,630 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 21:54:46,630 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-01-20 21:54:46,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-20 21:54:46,631 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:54:46,631 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-20 21:54:46,631 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 21:54:46,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1957871850, now seen corresponding path program 1 times [2018-01-20 21:54:46,632 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:54:46,632 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:54:46,633 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:46,633 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:54:46,633 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:46,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:54:46,653 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:54:46,697 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-20 21:54:46,697 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 21:54:46,697 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-20 21:54:46,698 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 21:54:46,698 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 21:54:46,698 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-20 21:54:46,698 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 4 states. [2018-01-20 21:54:46,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:54:46,790 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2018-01-20 21:54:46,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-20 21:54:46,790 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-01-20 21:54:46,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:54:46,792 INFO L225 Difference]: With dead ends: 75 [2018-01-20 21:54:46,792 INFO L226 Difference]: Without dead ends: 52 [2018-01-20 21:54:46,792 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-20 21:54:46,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-20 21:54:46,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 45. [2018-01-20 21:54:46,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-20 21:54:46,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2018-01-20 21:54:46,798 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 25 [2018-01-20 21:54:46,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:54:46,799 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2018-01-20 21:54:46,799 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 21:54:46,799 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-01-20 21:54:46,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-20 21:54:46,800 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:54:46,800 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-20 21:54:46,800 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 21:54:46,801 INFO L82 PathProgramCache]: Analyzing trace with hash -92922, now seen corresponding path program 1 times [2018-01-20 21:54:46,801 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:54:46,801 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:54:46,802 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:46,802 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:54:46,802 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:46,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:54:46,824 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:54:47,594 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-20 21:54:47,594 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 21:54:47,594 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-20 21:54:47,605 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:54:47,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:54:47,655 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 21:54:47,738 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-01-20 21:54:47,739 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 21:54:47,764 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-20 21:54:47,769 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:54:47,771 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-20 21:54:47,772 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 21:54:47,778 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 21:54:47,783 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-20 21:54:47,784 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:109, output treesize:26 [2018-01-20 21:54:47,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-01-20 21:54:47,873 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-20 21:54:47,873 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 21:54:47,877 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 21:54:47,883 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-20 21:54:47,884 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:4 [2018-01-20 21:54:47,915 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-20 21:54:47,944 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 21:54:47,944 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 18 [2018-01-20 21:54:47,945 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-20 21:54:47,945 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-20 21:54:47,946 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2018-01-20 21:54:47,946 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 18 states. [2018-01-20 21:54:48,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:54:48,562 INFO L93 Difference]: Finished difference Result 102 states and 113 transitions. [2018-01-20 21:54:48,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-20 21:54:48,562 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 30 [2018-01-20 21:54:48,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:54:48,564 INFO L225 Difference]: With dead ends: 102 [2018-01-20 21:54:48,564 INFO L226 Difference]: Without dead ends: 81 [2018-01-20 21:54:48,565 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2018-01-20 21:54:48,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-20 21:54:48,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 56. [2018-01-20 21:54:48,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-20 21:54:48,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2018-01-20 21:54:48,573 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 30 [2018-01-20 21:54:48,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:54:48,574 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2018-01-20 21:54:48,574 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-20 21:54:48,574 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2018-01-20 21:54:48,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-20 21:54:48,575 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:54:48,575 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-20 21:54:48,576 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 21:54:48,576 INFO L82 PathProgramCache]: Analyzing trace with hash 2111018345, now seen corresponding path program 1 times [2018-01-20 21:54:48,576 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:54:48,576 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:54:48,577 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:48,578 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:54:48,578 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:48,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:54:48,598 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:54:48,767 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-20 21:54:48,767 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 21:54:48,768 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-20 21:54:48,768 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-20 21:54:48,768 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-20 21:54:48,768 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-01-20 21:54:48,768 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand 11 states. [2018-01-20 21:54:49,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:54:49,024 INFO L93 Difference]: Finished difference Result 128 states and 143 transitions. [2018-01-20 21:54:49,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-20 21:54:49,024 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-01-20 21:54:49,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:54:49,026 INFO L225 Difference]: With dead ends: 128 [2018-01-20 21:54:49,026 INFO L226 Difference]: Without dead ends: 121 [2018-01-20 21:54:49,026 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-20 21:54:49,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-20 21:54:49,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 89. [2018-01-20 21:54:49,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-20 21:54:49,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 101 transitions. [2018-01-20 21:54:49,037 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 101 transitions. Word has length 32 [2018-01-20 21:54:49,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:54:49,037 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 101 transitions. [2018-01-20 21:54:49,037 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-20 21:54:49,037 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 101 transitions. [2018-01-20 21:54:49,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-20 21:54:49,039 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:54:49,039 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-20 21:54:49,039 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 21:54:49,039 INFO L82 PathProgramCache]: Analyzing trace with hash 2032509349, now seen corresponding path program 1 times [2018-01-20 21:54:49,039 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:54:49,039 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:54:49,040 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:49,040 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:54:49,040 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:49,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:54:49,053 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:54:49,108 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-20 21:54:49,108 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 21:54:49,109 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 21:54:49,122 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:54:49,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:54:49,140 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 21:54:49,199 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-20 21:54:49,232 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 21:54:49,232 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-01-20 21:54:49,233 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-20 21:54:49,233 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-20 21:54:49,233 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2018-01-20 21:54:49,233 INFO L87 Difference]: Start difference. First operand 89 states and 101 transitions. Second operand 8 states. [2018-01-20 21:54:49,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:54:49,336 INFO L93 Difference]: Finished difference Result 185 states and 209 transitions. [2018-01-20 21:54:49,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-20 21:54:49,336 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-01-20 21:54:49,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:54:49,337 INFO L225 Difference]: With dead ends: 185 [2018-01-20 21:54:49,337 INFO L226 Difference]: Without dead ends: 156 [2018-01-20 21:54:49,338 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=48, Unknown=0, NotChecked=0, Total=90 [2018-01-20 21:54:49,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-01-20 21:54:49,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 103. [2018-01-20 21:54:49,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-20 21:54:49,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2018-01-20 21:54:49,349 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 32 [2018-01-20 21:54:49,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:54:49,349 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2018-01-20 21:54:49,349 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-20 21:54:49,349 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2018-01-20 21:54:49,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-20 21:54:49,351 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:54:49,351 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-20 21:54:49,351 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 21:54:49,351 INFO L82 PathProgramCache]: Analyzing trace with hash -2121909337, now seen corresponding path program 1 times [2018-01-20 21:54:49,351 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:54:49,351 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:54:49,352 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:49,352 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:54:49,352 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:49,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:54:49,367 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:54:49,535 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-20 21:54:49,535 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 21:54:49,535 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-20 21:54:49,541 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:54:49,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:54:49,556 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 21:54:49,641 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-01-20 21:54:49,642 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 21:54:49,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 27 treesize of output 22 [2018-01-20 21:54:49,664 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:54:49,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 22 treesize of output 34 [2018-01-20 21:54:49,665 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 21:54:49,670 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 21:54:49,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 21:54:49,676 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:127, output treesize:32 [2018-01-20 21:54:49,724 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-20 21:54:49,726 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 21:54:49,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 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-20 21:54:49,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 21:54:49,730 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 21:54:49,733 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-20 21:54:49,733 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:4 [2018-01-20 21:54:49,741 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-20 21:54:49,761 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 21:54:49,762 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 19 [2018-01-20 21:54:49,762 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-20 21:54:49,762 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-20 21:54:49,762 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2018-01-20 21:54:49,762 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand 19 states. [2018-01-20 21:54:50,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:54:50,614 INFO L93 Difference]: Finished difference Result 234 states and 263 transitions. [2018-01-20 21:54:50,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-20 21:54:50,614 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 32 [2018-01-20 21:54:50,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:54:50,616 INFO L225 Difference]: With dead ends: 234 [2018-01-20 21:54:50,616 INFO L226 Difference]: Without dead ends: 227 [2018-01-20 21:54:50,617 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=368, Invalid=1272, Unknown=0, NotChecked=0, Total=1640 [2018-01-20 21:54:50,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-01-20 21:54:50,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 117. [2018-01-20 21:54:50,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-01-20 21:54:50,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 133 transitions. [2018-01-20 21:54:50,631 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 133 transitions. Word has length 32 [2018-01-20 21:54:50,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:54:50,631 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 133 transitions. [2018-01-20 21:54:50,631 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-20 21:54:50,631 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 133 transitions. [2018-01-20 21:54:50,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-20 21:54:50,633 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:54:50,633 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-20 21:54:50,633 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 21:54:50,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1617625150, now seen corresponding path program 1 times [2018-01-20 21:54:50,634 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:54:50,634 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:54:50,635 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:50,635 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:54:50,635 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:50,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:54:50,649 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:54:51,300 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-20 21:54:51,300 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 21:54:51,300 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 21:54:51,309 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:54:51,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:54:51,330 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 21:54:51,482 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:54:51,483 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-20 21:54:51,485 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-20 21:54:51,487 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 21:54:51,490 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 21:54:51,494 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-20 21:54:51,494 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:11 [2018-01-20 21:54:51,519 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-20 21:54:51,522 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:54:51,523 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:54:51,524 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-20 21:54:51,524 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 21:54:51,532 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 21:54:51,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2018-01-20 21:54:51,537 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:54:51,538 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:54:51,539 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-20 21:54:51,539 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 21:54:51,547 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 21:54:51,563 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-20 21:54:51,563 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:106, output treesize:25 [2018-01-20 21:54:51,617 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-20 21:54:51,619 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:54:51,620 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:54:51,620 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-20 21:54:51,621 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 21:54:51,623 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 21:54:51,625 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-20 21:54:51,626 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:3 [2018-01-20 21:54:51,641 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-20 21:54:51,662 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 21:54:51,662 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 25 [2018-01-20 21:54:51,663 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-20 21:54:51,663 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-20 21:54:51,663 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2018-01-20 21:54:51,663 INFO L87 Difference]: Start difference. First operand 117 states and 133 transitions. Second operand 25 states. [2018-01-20 21:54:52,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:54:52,596 INFO L93 Difference]: Finished difference Result 214 states and 240 transitions. [2018-01-20 21:54:52,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-20 21:54:52,596 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 34 [2018-01-20 21:54:52,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:54:52,597 INFO L225 Difference]: With dead ends: 214 [2018-01-20 21:54:52,598 INFO L226 Difference]: Without dead ends: 193 [2018-01-20 21:54:52,599 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=347, Invalid=1723, Unknown=0, NotChecked=0, Total=2070 [2018-01-20 21:54:52,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-01-20 21:54:52,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 117. [2018-01-20 21:54:52,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-01-20 21:54:52,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 133 transitions. [2018-01-20 21:54:52,609 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 133 transitions. Word has length 34 [2018-01-20 21:54:52,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:54:52,609 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 133 transitions. [2018-01-20 21:54:52,610 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-20 21:54:52,610 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 133 transitions. [2018-01-20 21:54:52,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-20 21:54:52,611 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:54:52,611 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-20 21:54:52,611 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 21:54:52,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1234541807, now seen corresponding path program 2 times [2018-01-20 21:54:52,611 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:54:52,611 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:54:52,612 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:52,612 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:54:52,612 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:52,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:54:52,621 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:54:52,689 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-20 21:54:52,689 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 21:54:52,689 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-20 21:54:52,696 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-20 21:54:52,706 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 21:54:52,710 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 21:54:52,712 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 21:54:52,713 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 21:54:52,769 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-20 21:54:52,791 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 21:54:52,791 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-01-20 21:54:52,792 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-20 21:54:52,792 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-20 21:54:52,792 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-01-20 21:54:52,792 INFO L87 Difference]: Start difference. First operand 117 states and 133 transitions. Second operand 11 states. [2018-01-20 21:54:52,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:54:52,878 INFO L93 Difference]: Finished difference Result 209 states and 237 transitions. [2018-01-20 21:54:52,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-20 21:54:52,878 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2018-01-20 21:54:52,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:54:52,880 INFO L225 Difference]: With dead ends: 209 [2018-01-20 21:54:52,880 INFO L226 Difference]: Without dead ends: 180 [2018-01-20 21:54:52,881 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2018-01-20 21:54:52,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-01-20 21:54:52,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 129. [2018-01-20 21:54:52,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-01-20 21:54:52,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 146 transitions. [2018-01-20 21:54:52,893 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 146 transitions. Word has length 37 [2018-01-20 21:54:52,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:54:52,894 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 146 transitions. [2018-01-20 21:54:52,894 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-20 21:54:52,894 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 146 transitions. [2018-01-20 21:54:52,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-20 21:54:52,896 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:54:52,896 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-20 21:54:52,896 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 21:54:52,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1211909553, now seen corresponding path program 2 times [2018-01-20 21:54:52,896 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:54:52,896 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:54:52,897 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:52,897 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 21:54:52,898 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:52,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:54:52,911 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:54:53,111 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-20 21:54:53,112 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 21:54:53,112 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 21:54:53,118 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-20 21:54:53,127 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 21:54:53,130 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 21:54:53,131 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 21:54:53,133 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 21:54:53,206 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-20 21:54:53,227 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 21:54:53,227 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-01-20 21:54:53,227 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-20 21:54:53,227 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-20 21:54:53,228 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2018-01-20 21:54:53,228 INFO L87 Difference]: Start difference. First operand 129 states and 146 transitions. Second operand 13 states. [2018-01-20 21:54:53,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:54:53,332 INFO L93 Difference]: Finished difference Result 248 states and 280 transitions. [2018-01-20 21:54:53,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-20 21:54:53,334 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2018-01-20 21:54:53,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:54:53,336 INFO L225 Difference]: With dead ends: 248 [2018-01-20 21:54:53,336 INFO L226 Difference]: Without dead ends: 204 [2018-01-20 21:54:53,337 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2018-01-20 21:54:53,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-01-20 21:54:53,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 144. [2018-01-20 21:54:53,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-01-20 21:54:53,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 163 transitions. [2018-01-20 21:54:53,350 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 163 transitions. Word has length 37 [2018-01-20 21:54:53,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:54:53,350 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 163 transitions. [2018-01-20 21:54:53,350 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-20 21:54:53,350 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 163 transitions. [2018-01-20 21:54:53,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-20 21:54:53,351 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:54:53,351 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-20 21:54:53,351 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 21:54:53,352 INFO L82 PathProgramCache]: Analyzing trace with hash 859940133, now seen corresponding path program 3 times [2018-01-20 21:54:53,352 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:54:53,352 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:54:53,352 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:53,353 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 21:54:53,353 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:53,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 21:54:53,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 21:54:53,385 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 21:54:53,392 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 21:54:53,399 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 21:54:53,399 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 21:54:53,414 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 21:54:53,414 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 21:54:53,415 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 21:54:53,415 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 21:54:53,415 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 21:54:53,415 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 21:54:53,415 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 21:54:53,415 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-20 21:54:53,415 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 21:54:53,416 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-01-20 21:54:53,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-20 21:54:53,417 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:54:53,417 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-20 21:54:53,417 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-20 21:54:53,417 INFO L82 PathProgramCache]: Analyzing trace with hash -168828260, now seen corresponding path program 1 times [2018-01-20 21:54:53,418 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:54:53,418 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:54:53,418 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:53,419 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:54:53,419 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:53,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:54:53,424 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:54:53,429 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-20 21:54:53,429 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 21:54:53,429 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 21:54:53,429 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 21:54:53,430 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 21:54:53,430 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 21:54:53,430 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 2 states. [2018-01-20 21:54:53,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:54:53,432 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2018-01-20 21:54:53,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 21:54:53,433 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-01-20 21:54:53,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:54:53,433 INFO L225 Difference]: With dead ends: 70 [2018-01-20 21:54:53,433 INFO L226 Difference]: Without dead ends: 40 [2018-01-20 21:54:53,434 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-20 21:54:53,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-20 21:54:53,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-01-20 21:54:53,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-20 21:54:53,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2018-01-20 21:54:53,436 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 18 [2018-01-20 21:54:53,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:54:53,437 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2018-01-20 21:54:53,437 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 21:54:53,437 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2018-01-20 21:54:53,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-20 21:54:53,437 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:54:53,437 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-20 21:54:53,437 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-20 21:54:53,438 INFO L82 PathProgramCache]: Analyzing trace with hash -371306179, now seen corresponding path program 1 times [2018-01-20 21:54:53,438 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:54:53,438 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:54:53,439 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:53,439 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:54:53,439 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:53,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:54:53,445 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:54:53,494 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-20 21:54:53,494 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 21:54:53,494 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-20 21:54:53,495 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 21:54:53,495 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 21:54:53,495 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 21:54:53,495 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 3 states. [2018-01-20 21:54:53,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:54:53,524 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2018-01-20 21:54:53,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 21:54:53,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-01-20 21:54:53,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:54:53,525 INFO L225 Difference]: With dead ends: 105 [2018-01-20 21:54:53,525 INFO L226 Difference]: Without dead ends: 73 [2018-01-20 21:54:53,526 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-20 21:54:53,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-20 21:54:53,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 41. [2018-01-20 21:54:53,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-20 21:54:53,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-01-20 21:54:53,529 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 23 [2018-01-20 21:54:53,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:54:53,529 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-01-20 21:54:53,529 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 21:54:53,529 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-01-20 21:54:53,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-20 21:54:53,530 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:54:53,530 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-20 21:54:53,530 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-20 21:54:53,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1392374533, now seen corresponding path program 1 times [2018-01-20 21:54:53,530 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:54:53,530 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:54:53,531 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:53,531 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:54:53,531 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:53,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:54:53,538 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:54:53,562 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-20 21:54:53,563 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 21:54:53,563 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-20 21:54:53,563 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 21:54:53,563 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 21:54:53,563 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-20 21:54:53,564 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 4 states. [2018-01-20 21:54:53,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:54:53,592 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2018-01-20 21:54:53,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-20 21:54:53,593 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-01-20 21:54:53,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:54:53,593 INFO L225 Difference]: With dead ends: 71 [2018-01-20 21:54:53,594 INFO L226 Difference]: Without dead ends: 50 [2018-01-20 21:54:53,594 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-20 21:54:53,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-20 21:54:53,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2018-01-20 21:54:53,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-20 21:54:53,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-01-20 21:54:53,597 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 23 [2018-01-20 21:54:53,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:54:53,597 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-01-20 21:54:53,597 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 21:54:53,597 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-01-20 21:54:53,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-20 21:54:53,598 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:54:53,598 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-20 21:54:53,598 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-20 21:54:53,598 INFO L82 PathProgramCache]: Analyzing trace with hash -634636265, now seen corresponding path program 1 times [2018-01-20 21:54:53,598 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:54:53,598 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:54:53,599 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:53,599 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:54:53,599 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:53,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:54:53,607 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:54:53,654 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-20 21:54:53,654 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 21:54:53,655 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-20 21:54:53,655 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 21:54:53,655 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 21:54:53,655 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-20 21:54:53,656 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 4 states. [2018-01-20 21:54:53,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:54:53,682 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-01-20 21:54:53,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 21:54:53,682 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-01-20 21:54:53,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:54:53,683 INFO L225 Difference]: With dead ends: 43 [2018-01-20 21:54:53,683 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 21:54:53,683 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-20 21:54:53,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 21:54:53,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 21:54:53,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 21:54:53,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 21:54:53,684 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2018-01-20 21:54:53,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:54:53,684 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 21:54:53,685 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 21:54:53,685 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 21:54:53,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 21:54:53,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.01 09:54:53 BoogieIcfgContainer [2018-01-20 21:54:53,688 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-20 21:54:53,689 INFO L168 Benchmark]: Toolchain (without parser) took 8220.01 ms. Allocated memory was 307.8 MB in the beginning and 563.6 MB in the end (delta: 255.9 MB). Free memory was 266.1 MB in the beginning and 322.5 MB in the end (delta: -56.4 MB). Peak memory consumption was 199.4 MB. Max. memory is 5.3 GB. [2018-01-20 21:54:53,691 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 307.8 MB. Free memory is still 272.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-20 21:54:53,691 INFO L168 Benchmark]: CACSL2BoogieTranslator took 199.15 ms. Allocated memory is still 307.8 MB. Free memory was 265.1 MB in the beginning and 255.0 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-20 21:54:53,692 INFO L168 Benchmark]: Boogie Preprocessor took 37.20 ms. Allocated memory is still 307.8 MB. Free memory was 255.0 MB in the beginning and 253.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-20 21:54:53,692 INFO L168 Benchmark]: RCFGBuilder took 248.22 ms. Allocated memory is still 307.8 MB. Free memory was 253.0 MB in the beginning and 236.4 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 5.3 GB. [2018-01-20 21:54:53,693 INFO L168 Benchmark]: TraceAbstraction took 7729.79 ms. Allocated memory was 307.8 MB in the beginning and 563.6 MB in the end (delta: 255.9 MB). Free memory was 236.4 MB in the beginning and 322.5 MB in the end (delta: -86.1 MB). Peak memory consumption was 169.7 MB. Max. memory is 5.3 GB. [2018-01-20 21:54:53,695 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.20 ms. Allocated memory is still 307.8 MB. Free memory is still 272.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 199.15 ms. Allocated memory is still 307.8 MB. Free memory was 265.1 MB in the beginning and 255.0 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 37.20 ms. Allocated memory is still 307.8 MB. Free memory was 255.0 MB in the beginning and 253.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 248.22 ms. Allocated memory is still 307.8 MB. Free memory was 253.0 MB in the beginning and 236.4 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 7729.79 ms. Allocated memory was 307.8 MB in the beginning and 563.6 MB in the end (delta: 255.9 MB). Free memory was 236.4 MB in the beginning and 322.5 MB in the end (delta: -86.1 MB). Peak memory consumption was 169.7 MB. Max. memory is 5.3 GB. * 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