/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/id_i10_o10-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 21:55:33,220 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 21:55:33,225 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 21:55:33,267 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 21:55:33,267 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 21:55:33,279 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 21:55:33,282 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 21:55:33,286 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 21:55:33,290 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 21:55:33,293 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 21:55:33,295 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 21:55:33,296 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 21:55:33,296 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 21:55:33,300 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 21:55:33,303 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 21:55:33,305 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 21:55:33,307 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 21:55:33,308 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 21:55:33,311 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 21:55:33,320 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 21:55:33,322 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 21:55:33,323 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 21:55:33,324 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 21:55:33,325 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 21:55:33,328 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 21:55:33,328 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 21:55:33,329 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 21:55:33,332 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 21:55:33,333 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 21:55:33,335 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 21:55:33,335 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 21:55:33,336 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 21:55:33,337 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 21:55:33,338 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 21:55:33,339 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 21:55:33,339 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 21:55:33,340 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 21:55:33,340 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 21:55:33,341 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 21:55:33,342 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 21:55:33,343 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 21:55:33,344 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-09-04 21:55:33,364 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 21:55:33,364 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 21:55:33,367 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 21:55:33,367 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 21:55:33,367 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 21:55:33,367 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 21:55:33,368 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 21:55:33,368 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 21:55:33,368 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 21:55:33,368 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 21:55:33,370 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 21:55:33,370 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 21:55:33,370 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 21:55:33,370 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 21:55:33,371 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 21:55:33,371 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 21:55:33,371 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 21:55:33,371 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 21:55:33,372 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 21:55:33,372 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 21:55:33,372 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 21:55:33,372 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 21:55:33,372 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-09-04 21:55:33,846 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 21:55:33,872 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 21:55:33,879 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 21:55:33,881 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 21:55:33,884 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 21:55:33,885 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_i10_o10-1.c [2020-09-04 21:55:33,973 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/5cebecea0/3f184acb4b2243ab8917dda8d0bc120d/FLAG985981b9a [2020-09-04 21:55:34,555 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 21:55:34,556 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/id_i10_o10-1.c [2020-09-04 21:55:34,565 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/5cebecea0/3f184acb4b2243ab8917dda8d0bc120d/FLAG985981b9a [2020-09-04 21:55:34,892 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/5cebecea0/3f184acb4b2243ab8917dda8d0bc120d [2020-09-04 21:55:34,908 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 21:55:34,911 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 21:55:34,912 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 21:55:34,912 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 21:55:34,917 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 21:55:34,918 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 09:55:34" (1/1) ... [2020-09-04 21:55:34,923 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13482720 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:55:34, skipping insertion in model container [2020-09-04 21:55:34,924 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 09:55:34" (1/1) ... [2020-09-04 21:55:34,933 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 21:55:34,959 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 21:55:35,166 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 21:55:35,172 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 21:55:35,193 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 21:55:35,212 INFO L208 MainTranslator]: Completed translation [2020-09-04 21:55:35,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:55:35 WrapperNode [2020-09-04 21:55:35,213 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 21:55:35,214 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 21:55:35,215 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 21:55:35,215 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 21:55:35,234 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:55:35" (1/1) ... [2020-09-04 21:55:35,234 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:55:35" (1/1) ... [2020-09-04 21:55:35,241 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:55:35" (1/1) ... [2020-09-04 21:55:35,242 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:55:35" (1/1) ... [2020-09-04 21:55:35,246 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:55:35" (1/1) ... [2020-09-04 21:55:35,249 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:55:35" (1/1) ... [2020-09-04 21:55:35,250 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:55:35" (1/1) ... [2020-09-04 21:55:35,252 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 21:55:35,253 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 21:55:35,253 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 21:55:35,253 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 21:55:35,255 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:55:35" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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 [2020-09-04 21:55:35,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 21:55:35,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 21:55:35,418 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-09-04 21:55:35,419 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 21:55:35,419 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 21:55:35,419 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 21:55:35,419 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-09-04 21:55:35,419 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 21:55:35,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 21:55:35,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 21:55:35,643 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 21:55:35,644 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-04 21:55:35,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 09:55:35 BoogieIcfgContainer [2020-09-04 21:55:35,658 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 21:55:35,663 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 21:55:35,668 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 21:55:35,677 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 21:55:35,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 09:55:34" (1/3) ... [2020-09-04 21:55:35,681 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c5d0432 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 09:55:35, skipping insertion in model container [2020-09-04 21:55:35,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:55:35" (2/3) ... [2020-09-04 21:55:35,683 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c5d0432 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 09:55:35, skipping insertion in model container [2020-09-04 21:55:35,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 09:55:35" (3/3) ... [2020-09-04 21:55:35,689 INFO L109 eAbstractionObserver]: Analyzing ICFG id_i10_o10-1.c [2020-09-04 21:55:35,724 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 21:55:35,750 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 21:55:35,786 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 21:55:35,814 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 21:55:35,814 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 21:55:35,815 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-04 21:55:35,815 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 21:55:35,815 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 21:55:35,815 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 21:55:35,815 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 21:55:35,815 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 21:55:35,834 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2020-09-04 21:55:35,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-09-04 21:55:35,849 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:35,851 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:55:35,851 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:35,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:35,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1037734449, now seen corresponding path program 1 times [2020-09-04 21:55:35,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:35,872 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1874540050] [2020-09-04 21:55:35,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:35,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:36,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:36,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:36,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:36,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:36,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 21:55:36,140 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1874540050] [2020-09-04 21:55:36,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 21:55:36,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 21:55:36,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049784160] [2020-09-04 21:55:36,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 21:55:36,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:36,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 21:55:36,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 21:55:36,175 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 5 states. [2020-09-04 21:55:36,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:36,268 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2020-09-04 21:55:36,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 21:55:36,270 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-09-04 21:55:36,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:36,284 INFO L225 Difference]: With dead ends: 37 [2020-09-04 21:55:36,284 INFO L226 Difference]: Without dead ends: 23 [2020-09-04 21:55:36,289 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-04 21:55:36,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-09-04 21:55:36,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-09-04 21:55:36,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-09-04 21:55:36,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2020-09-04 21:55:36,348 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 16 [2020-09-04 21:55:36,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:36,348 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2020-09-04 21:55:36,349 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 21:55:36,349 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2020-09-04 21:55:36,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-09-04 21:55:36,352 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:36,352 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:55:36,352 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 21:55:36,353 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:36,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:36,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1478812441, now seen corresponding path program 1 times [2020-09-04 21:55:36,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:36,354 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1583475887] [2020-09-04 21:55:36,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:36,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:36,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:36,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:36,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:36,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:36,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:36,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:36,500 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-04 21:55:36,500 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1583475887] [2020-09-04 21:55:36,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:55:36,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-09-04 21:55:36,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766234786] [2020-09-04 21:55:36,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 21:55:36,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:36,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 21:55:36,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-04 21:55:36,507 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 6 states. [2020-09-04 21:55:36,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:36,608 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2020-09-04 21:55:36,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 21:55:36,609 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-09-04 21:55:36,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:36,611 INFO L225 Difference]: With dead ends: 34 [2020-09-04 21:55:36,611 INFO L226 Difference]: Without dead ends: 28 [2020-09-04 21:55:36,613 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-09-04 21:55:36,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-09-04 21:55:36,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-09-04 21:55:36,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-09-04 21:55:36,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2020-09-04 21:55:36,624 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 24 [2020-09-04 21:55:36,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:36,625 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2020-09-04 21:55:36,625 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 21:55:36,625 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-09-04 21:55:36,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-09-04 21:55:36,626 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:36,627 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:55:36,627 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 21:55:36,627 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:36,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:36,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1463730447, now seen corresponding path program 2 times [2020-09-04 21:55:36,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:36,629 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1891555594] [2020-09-04 21:55:36,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:36,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:36,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:36,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:36,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:36,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:36,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:36,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:36,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:36,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:36,796 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-09-04 21:55:36,797 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1891555594] [2020-09-04 21:55:36,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:55:36,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-04 21:55:36,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504224060] [2020-09-04 21:55:36,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 21:55:36,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:36,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 21:55:36,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-04 21:55:36,799 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 7 states. [2020-09-04 21:55:36,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:36,871 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2020-09-04 21:55:36,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 21:55:36,872 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2020-09-04 21:55:36,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:36,873 INFO L225 Difference]: With dead ends: 39 [2020-09-04 21:55:36,873 INFO L226 Difference]: Without dead ends: 33 [2020-09-04 21:55:36,874 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-09-04 21:55:36,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-09-04 21:55:36,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-09-04 21:55:36,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-09-04 21:55:36,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2020-09-04 21:55:36,886 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 32 [2020-09-04 21:55:36,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:36,886 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2020-09-04 21:55:36,887 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 21:55:36,887 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-09-04 21:55:36,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-09-04 21:55:36,888 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:36,889 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:55:36,889 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 21:55:36,889 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:36,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:36,890 INFO L82 PathProgramCache]: Analyzing trace with hash 23346727, now seen corresponding path program 3 times [2020-09-04 21:55:36,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:36,891 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [195010832] [2020-09-04 21:55:36,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:36,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:36,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:36,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:36,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:36,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:36,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:36,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:37,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:37,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:37,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:37,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:37,092 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-09-04 21:55:37,092 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [195010832] [2020-09-04 21:55:37,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:55:37,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-09-04 21:55:37,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466402852] [2020-09-04 21:55:37,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 21:55:37,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:37,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 21:55:37,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-09-04 21:55:37,095 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 8 states. [2020-09-04 21:55:37,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:37,187 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2020-09-04 21:55:37,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 21:55:37,188 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2020-09-04 21:55:37,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:37,190 INFO L225 Difference]: With dead ends: 44 [2020-09-04 21:55:37,190 INFO L226 Difference]: Without dead ends: 38 [2020-09-04 21:55:37,191 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-09-04 21:55:37,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-09-04 21:55:37,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-09-04 21:55:37,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-09-04 21:55:37,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2020-09-04 21:55:37,202 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 40 [2020-09-04 21:55:37,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:37,203 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2020-09-04 21:55:37,203 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 21:55:37,203 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2020-09-04 21:55:37,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-09-04 21:55:37,205 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:37,205 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:55:37,206 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 21:55:37,208 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:37,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:37,209 INFO L82 PathProgramCache]: Analyzing trace with hash -649675855, now seen corresponding path program 4 times [2020-09-04 21:55:37,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:37,209 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [793475801] [2020-09-04 21:55:37,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:37,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:37,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:37,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:37,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:37,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:37,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:37,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:37,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:37,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:37,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:37,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:37,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:37,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:37,530 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-09-04 21:55:37,531 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [793475801] [2020-09-04 21:55:37,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:55:37,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-09-04 21:55:37,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991870364] [2020-09-04 21:55:37,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 21:55:37,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:37,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 21:55:37,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-09-04 21:55:37,534 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 9 states. [2020-09-04 21:55:37,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:37,626 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2020-09-04 21:55:37,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 21:55:37,627 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2020-09-04 21:55:37,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:37,628 INFO L225 Difference]: With dead ends: 49 [2020-09-04 21:55:37,628 INFO L226 Difference]: Without dead ends: 43 [2020-09-04 21:55:37,629 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2020-09-04 21:55:37,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-09-04 21:55:37,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-09-04 21:55:37,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-09-04 21:55:37,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2020-09-04 21:55:37,640 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 48 [2020-09-04 21:55:37,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:37,641 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2020-09-04 21:55:37,641 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 21:55:37,641 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2020-09-04 21:55:37,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-09-04 21:55:37,643 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:37,644 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:55:37,644 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 21:55:37,644 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:37,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:37,645 INFO L82 PathProgramCache]: Analyzing trace with hash 899977063, now seen corresponding path program 5 times [2020-09-04 21:55:37,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:37,645 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1150634834] [2020-09-04 21:55:37,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:37,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:37,681 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:37,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:37,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:37,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:37,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:37,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:37,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:37,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:37,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:37,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:37,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:37,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:37,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:37,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:37,858 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-09-04 21:55:37,859 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1150634834] [2020-09-04 21:55:37,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:55:37,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-09-04 21:55:37,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825101871] [2020-09-04 21:55:37,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 21:55:37,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:37,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 21:55:37,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-09-04 21:55:37,862 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 10 states. [2020-09-04 21:55:37,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:37,983 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2020-09-04 21:55:37,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 21:55:37,984 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2020-09-04 21:55:37,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:37,986 INFO L225 Difference]: With dead ends: 54 [2020-09-04 21:55:37,986 INFO L226 Difference]: Without dead ends: 48 [2020-09-04 21:55:37,987 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2020-09-04 21:55:37,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-09-04 21:55:37,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-09-04 21:55:37,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-09-04 21:55:37,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2020-09-04 21:55:38,000 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 56 [2020-09-04 21:55:38,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:38,000 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2020-09-04 21:55:38,001 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 21:55:38,001 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2020-09-04 21:55:38,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-09-04 21:55:38,004 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:38,004 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:55:38,004 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 21:55:38,005 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:38,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:38,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1000802417, now seen corresponding path program 6 times [2020-09-04 21:55:38,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:38,006 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [157032594] [2020-09-04 21:55:38,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:38,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:38,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:38,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:38,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:38,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:38,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:38,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:38,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:38,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:38,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:38,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:38,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:38,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:38,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:38,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:38,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:38,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:38,280 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-09-04 21:55:38,281 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [157032594] [2020-09-04 21:55:38,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:55:38,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-09-04 21:55:38,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976878528] [2020-09-04 21:55:38,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 21:55:38,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:38,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 21:55:38,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-09-04 21:55:38,283 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 11 states. [2020-09-04 21:55:38,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:38,400 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2020-09-04 21:55:38,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 21:55:38,401 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2020-09-04 21:55:38,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:38,403 INFO L225 Difference]: With dead ends: 59 [2020-09-04 21:55:38,403 INFO L226 Difference]: Without dead ends: 53 [2020-09-04 21:55:38,404 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2020-09-04 21:55:38,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-09-04 21:55:38,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2020-09-04 21:55:38,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-09-04 21:55:38,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2020-09-04 21:55:38,415 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 64 [2020-09-04 21:55:38,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:38,416 INFO L479 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2020-09-04 21:55:38,416 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 21:55:38,416 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2020-09-04 21:55:38,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-09-04 21:55:38,417 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:38,418 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:55:38,418 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 21:55:38,418 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:38,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:38,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1977618599, now seen corresponding path program 7 times [2020-09-04 21:55:38,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:38,419 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1775287588] [2020-09-04 21:55:38,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:38,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:38,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:38,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:38,453 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:38,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:38,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:38,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:38,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:38,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:38,561 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:38,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:38,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:38,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:38,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:38,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:38,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:38,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:38,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:38,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:38,699 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-09-04 21:55:38,700 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1775287588] [2020-09-04 21:55:38,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:55:38,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-09-04 21:55:38,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113489515] [2020-09-04 21:55:38,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 21:55:38,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:38,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 21:55:38,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-09-04 21:55:38,703 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 12 states. [2020-09-04 21:55:38,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:38,848 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2020-09-04 21:55:38,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 21:55:38,849 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 72 [2020-09-04 21:55:38,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:38,851 INFO L225 Difference]: With dead ends: 64 [2020-09-04 21:55:38,851 INFO L226 Difference]: Without dead ends: 58 [2020-09-04 21:55:38,852 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2020-09-04 21:55:38,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-09-04 21:55:38,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2020-09-04 21:55:38,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-09-04 21:55:38,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2020-09-04 21:55:38,863 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 72 [2020-09-04 21:55:38,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:38,864 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2020-09-04 21:55:38,864 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 21:55:38,864 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2020-09-04 21:55:38,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-09-04 21:55:38,866 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:38,866 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:55:38,866 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 21:55:38,866 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:38,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:38,867 INFO L82 PathProgramCache]: Analyzing trace with hash 555623729, now seen corresponding path program 8 times [2020-09-04 21:55:38,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:38,867 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [299862031] [2020-09-04 21:55:38,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:38,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:38,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:38,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:38,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:38,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:38,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:39,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:39,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:39,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:39,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:39,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:39,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:39,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:39,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:39,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:39,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:39,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:39,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:39,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:39,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:39,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:39,316 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-09-04 21:55:39,317 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [299862031] [2020-09-04 21:55:39,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:55:39,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-09-04 21:55:39,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257287194] [2020-09-04 21:55:39,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 21:55:39,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:39,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 21:55:39,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2020-09-04 21:55:39,322 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 13 states. [2020-09-04 21:55:39,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:39,517 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2020-09-04 21:55:39,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-04 21:55:39,519 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 80 [2020-09-04 21:55:39,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:39,521 INFO L225 Difference]: With dead ends: 69 [2020-09-04 21:55:39,521 INFO L226 Difference]: Without dead ends: 63 [2020-09-04 21:55:39,525 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2020-09-04 21:55:39,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-09-04 21:55:39,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-09-04 21:55:39,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-09-04 21:55:39,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2020-09-04 21:55:39,546 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 80 [2020-09-04 21:55:39,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:39,548 INFO L479 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2020-09-04 21:55:39,548 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 21:55:39,548 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2020-09-04 21:55:39,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-09-04 21:55:39,550 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:39,550 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:55:39,551 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 21:55:39,551 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:39,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:39,551 INFO L82 PathProgramCache]: Analyzing trace with hash 777699815, now seen corresponding path program 9 times [2020-09-04 21:55:39,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:39,552 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1300479442] [2020-09-04 21:55:39,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:39,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:39,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:39,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:39,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:39,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:39,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:39,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:39,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:39,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:39,768 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:39,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:39,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:39,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:39,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:39,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:39,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:39,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:39,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:39,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:39,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:39,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:39,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:39,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:40,038 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2020-09-04 21:55:40,039 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1300479442] [2020-09-04 21:55:40,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:55:40,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-09-04 21:55:40,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573707009] [2020-09-04 21:55:40,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 21:55:40,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:40,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 21:55:40,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2020-09-04 21:55:40,043 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 14 states. [2020-09-04 21:55:40,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:40,222 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2020-09-04 21:55:40,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-04 21:55:40,224 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 88 [2020-09-04 21:55:40,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:40,226 INFO L225 Difference]: With dead ends: 74 [2020-09-04 21:55:40,229 INFO L226 Difference]: Without dead ends: 68 [2020-09-04 21:55:40,230 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=200, Invalid=352, Unknown=0, NotChecked=0, Total=552 [2020-09-04 21:55:40,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-09-04 21:55:40,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2020-09-04 21:55:40,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-09-04 21:55:40,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2020-09-04 21:55:40,247 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 88 [2020-09-04 21:55:40,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:40,248 INFO L479 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2020-09-04 21:55:40,248 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 21:55:40,248 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2020-09-04 21:55:40,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-09-04 21:55:40,252 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:40,252 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:55:40,252 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 21:55:40,252 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:40,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:40,255 INFO L82 PathProgramCache]: Analyzing trace with hash 2145915377, now seen corresponding path program 10 times [2020-09-04 21:55:40,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:40,255 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [907336617] [2020-09-04 21:55:40,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:40,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 21:55:40,283 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 21:55:40,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 21:55:40,303 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 21:55:40,339 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-04 21:55:40,339 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-04 21:55:40,340 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 21:55:40,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 09:55:40 BoogieIcfgContainer [2020-09-04 21:55:40,419 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 21:55:40,422 INFO L168 Benchmark]: Toolchain (without parser) took 5511.18 ms. Allocated memory was 140.0 MB in the beginning and 282.6 MB in the end (delta: 142.6 MB). Free memory was 103.4 MB in the beginning and 142.3 MB in the end (delta: -38.8 MB). Peak memory consumption was 103.8 MB. Max. memory is 7.1 GB. [2020-09-04 21:55:40,423 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 140.0 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.7 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-04 21:55:40,424 INFO L168 Benchmark]: CACSL2BoogieTranslator took 301.89 ms. Allocated memory is still 140.0 MB. Free memory was 103.2 MB in the beginning and 94.0 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2020-09-04 21:55:40,425 INFO L168 Benchmark]: Boogie Preprocessor took 38.18 ms. Allocated memory is still 140.0 MB. Free memory was 94.0 MB in the beginning and 92.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-09-04 21:55:40,425 INFO L168 Benchmark]: RCFGBuilder took 405.09 ms. Allocated memory was 140.0 MB in the beginning and 203.4 MB in the end (delta: 63.4 MB). Free memory was 92.6 MB in the beginning and 171.9 MB in the end (delta: -79.3 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. [2020-09-04 21:55:40,426 INFO L168 Benchmark]: TraceAbstraction took 4755.84 ms. Allocated memory was 203.4 MB in the beginning and 282.6 MB in the end (delta: 79.2 MB). Free memory was 171.2 MB in the beginning and 142.3 MB in the end (delta: 29.0 MB). Peak memory consumption was 108.1 MB. Max. memory is 7.1 GB. [2020-09-04 21:55:40,430 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 140.0 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.7 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 301.89 ms. Allocated memory is still 140.0 MB. Free memory was 103.2 MB in the beginning and 94.0 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.18 ms. Allocated memory is still 140.0 MB. Free memory was 94.0 MB in the beginning and 92.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 405.09 ms. Allocated memory was 140.0 MB in the beginning and 203.4 MB in the end (delta: 63.4 MB). Free memory was 92.6 MB in the beginning and 171.9 MB in the end (delta: -79.3 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4755.84 ms. Allocated memory was 203.4 MB in the beginning and 282.6 MB in the end (delta: 79.2 MB). Free memory was 171.2 MB in the beginning and 142.3 MB in the end (delta: 29.0 MB). Peak memory consumption was 108.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L10] int input = 10; VAL [input=10] [L11] CALL, EXPR id(input) VAL [\old(x)=10] [L5] COND FALSE !(x==0) VAL [\old(x)=10, x=10] [L6] CALL, EXPR id(x-1) VAL [\old(x)=9] [L5] COND FALSE !(x==0) VAL [\old(x)=9, x=9] [L6] CALL, EXPR id(x-1) VAL [\old(x)=8] [L5] COND FALSE !(x==0) VAL [\old(x)=8, x=8] [L6] CALL, EXPR id(x-1) VAL [\old(x)=7] [L5] COND FALSE !(x==0) VAL [\old(x)=7, x=7] [L6] CALL, EXPR id(x-1) VAL [\old(x)=6] [L5] COND FALSE !(x==0) VAL [\old(x)=6, x=6] [L6] CALL, EXPR id(x-1) VAL [\old(x)=5] [L5] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L6] CALL, EXPR id(x-1) VAL [\old(x)=4] [L5] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L6] CALL, EXPR id(x-1) VAL [\old(x)=3] [L5] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L6] CALL, EXPR id(x-1) VAL [\old(x)=2] [L5] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L6] CALL, EXPR id(x-1) VAL [\old(x)=1] [L5] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L6] CALL, EXPR id(x-1) VAL [\old(x)=0] [L5] COND TRUE x==0 VAL [\old(x)=0, x=0] [L5] return 0; VAL [\old(x)=0, \result=0, x=0] [L6] RET, EXPR id(x-1) VAL [\old(x)=1, id(x-1)=0, x=1] [L6] return id(x-1) + 1; VAL [\old(x)=1, \result=1, id(x-1)=0, x=1] [L6] RET, EXPR id(x-1) VAL [\old(x)=2, id(x-1)=1, x=2] [L6] return id(x-1) + 1; VAL [\old(x)=2, \result=2, id(x-1)=1, x=2] [L6] RET, EXPR id(x-1) VAL [\old(x)=3, id(x-1)=2, x=3] [L6] return id(x-1) + 1; VAL [\old(x)=3, \result=3, id(x-1)=2, x=3] [L6] RET, EXPR id(x-1) VAL [\old(x)=4, id(x-1)=3, x=4] [L6] return id(x-1) + 1; VAL [\old(x)=4, \result=4, id(x-1)=3, x=4] [L6] RET, EXPR id(x-1) VAL [\old(x)=5, id(x-1)=4, x=5] [L6] return id(x-1) + 1; VAL [\old(x)=5, \result=5, id(x-1)=4, x=5] [L6] RET, EXPR id(x-1) VAL [\old(x)=6, id(x-1)=5, x=6] [L6] return id(x-1) + 1; VAL [\old(x)=6, \result=6, id(x-1)=5, x=6] [L6] RET, EXPR id(x-1) VAL [\old(x)=7, id(x-1)=6, x=7] [L6] return id(x-1) + 1; VAL [\old(x)=7, \result=7, id(x-1)=6, x=7] [L6] RET, EXPR id(x-1) VAL [\old(x)=8, id(x-1)=7, x=8] [L6] return id(x-1) + 1; VAL [\old(x)=8, \result=8, id(x-1)=7, x=8] [L6] RET, EXPR id(x-1) VAL [\old(x)=9, id(x-1)=8, x=9] [L6] return id(x-1) + 1; VAL [\old(x)=9, \result=9, id(x-1)=8, x=9] [L6] RET, EXPR id(x-1) VAL [\old(x)=10, id(x-1)=9, x=10] [L6] return id(x-1) + 1; VAL [\old(x)=10, \result=10, id(x-1)=9, x=10] [L11] RET, EXPR id(input) VAL [id(input)=10, input=10] [L11] int result = id(input); VAL [id(input)=10, input=10, result=10] [L12] COND TRUE result == 10 VAL [input=10, result=10] [L13] __VERIFIER_error() VAL [input=10, result=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 4.5s, OverallIterations: 11, TraceHistogramMax: 11, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 184 SDtfs, 320 SDslu, 660 SDs, 0 SdLazy, 275 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 270 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 616 NumberOfCodeBlocks, 616 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 510 ConstructedInterpolants, 0 QuantifiedInterpolants, 77760 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 1 PerfectInterpolantSequences, 450/1140 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...