/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_i15_o15-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 21:55:36,782 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 21:55:36,786 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 21:55:36,814 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 21:55:36,814 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 21:55:36,816 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 21:55:36,817 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 21:55:36,819 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 21:55:36,821 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 21:55:36,822 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 21:55:36,823 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 21:55:36,824 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 21:55:36,824 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 21:55:36,826 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 21:55:36,827 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 21:55:36,828 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 21:55:36,829 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 21:55:36,830 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 21:55:36,832 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 21:55:36,834 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 21:55:36,836 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 21:55:36,840 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 21:55:36,841 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 21:55:36,842 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 21:55:36,847 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 21:55:36,847 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 21:55:36,847 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 21:55:36,848 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 21:55:36,851 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 21:55:36,853 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 21:55:36,854 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 21:55:36,855 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 21:55:36,856 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 21:55:36,857 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 21:55:36,859 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 21:55:36,860 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 21:55:36,860 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 21:55:36,861 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 21:55:36,861 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 21:55:36,863 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 21:55:36,864 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 21:55:36,865 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:36,900 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 21:55:36,900 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 21:55:36,905 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 21:55:36,905 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 21:55:36,905 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 21:55:36,905 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 21:55:36,906 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 21:55:36,906 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 21:55:36,906 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 21:55:36,906 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 21:55:36,906 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 21:55:36,907 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 21:55:36,908 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 21:55:36,909 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 21:55:36,909 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 21:55:36,909 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 21:55:36,909 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 21:55:36,909 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 21:55:36,910 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 21:55:36,910 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 21:55:36,910 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 21:55:36,911 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 21:55:36,911 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:37,413 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 21:55:37,429 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 21:55:37,436 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 21:55:37,438 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 21:55:37,438 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 21:55:37,440 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_i15_o15-2.c [2020-09-04 21:55:37,530 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/5f314c304/200473fde1b64881a0633c797ad22194/FLAG9b66ceb69 [2020-09-04 21:55:38,061 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 21:55:38,062 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/id_i15_o15-2.c [2020-09-04 21:55:38,070 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/5f314c304/200473fde1b64881a0633c797ad22194/FLAG9b66ceb69 [2020-09-04 21:55:38,408 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/5f314c304/200473fde1b64881a0633c797ad22194 [2020-09-04 21:55:38,423 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 21:55:38,425 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 21:55:38,426 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 21:55:38,427 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 21:55:38,431 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 21:55:38,432 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 09:55:38" (1/1) ... [2020-09-04 21:55:38,436 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c096cad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:55:38, skipping insertion in model container [2020-09-04 21:55:38,436 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 09:55:38" (1/1) ... [2020-09-04 21:55:38,445 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 21:55:38,472 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 21:55:38,686 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 21:55:38,691 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 21:55:38,707 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 21:55:38,722 INFO L208 MainTranslator]: Completed translation [2020-09-04 21:55:38,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:55:38 WrapperNode [2020-09-04 21:55:38,723 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 21:55:38,723 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 21:55:38,724 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 21:55:38,724 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 21:55:38,737 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:38" (1/1) ... [2020-09-04 21:55:38,737 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:38" (1/1) ... [2020-09-04 21:55:38,742 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:38" (1/1) ... [2020-09-04 21:55:38,742 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:38" (1/1) ... [2020-09-04 21:55:38,746 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:38" (1/1) ... [2020-09-04 21:55:38,748 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:38" (1/1) ... [2020-09-04 21:55:38,749 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:38" (1/1) ... [2020-09-04 21:55:38,751 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 21:55:38,752 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 21:55:38,752 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 21:55:38,752 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 21:55:38,753 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:55:38" (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:38,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 21:55:38,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 21:55:38,912 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-09-04 21:55:38,912 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 21:55:38,912 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 21:55:38,912 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 21:55:38,912 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-09-04 21:55:38,913 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 21:55:38,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 21:55:38,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 21:55:39,113 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 21:55:39,114 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-04 21:55:39,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 09:55:39 BoogieIcfgContainer [2020-09-04 21:55:39,120 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 21:55:39,137 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 21:55:39,137 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 21:55:39,149 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 21:55:39,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 09:55:38" (1/3) ... [2020-09-04 21:55:39,153 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4183dbcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 09:55:39, skipping insertion in model container [2020-09-04 21:55:39,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:55:38" (2/3) ... [2020-09-04 21:55:39,157 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4183dbcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 09:55:39, skipping insertion in model container [2020-09-04 21:55:39,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 09:55:39" (3/3) ... [2020-09-04 21:55:39,163 INFO L109 eAbstractionObserver]: Analyzing ICFG id_i15_o15-2.c [2020-09-04 21:55:39,195 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 21:55:39,207 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 21:55:39,248 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 21:55:39,275 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 21:55:39,275 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 21:55:39,276 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-04 21:55:39,276 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 21:55:39,276 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 21:55:39,276 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 21:55:39,276 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 21:55:39,277 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 21:55:39,295 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2020-09-04 21:55:39,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-09-04 21:55:39,308 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:39,309 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:39,310 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:39,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:39,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1037734449, now seen corresponding path program 1 times [2020-09-04 21:55:39,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:39,327 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1275777786] [2020-09-04 21:55:39,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:39,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:39,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:39,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:39,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:39,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:39,595 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:39,596 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1275777786] [2020-09-04 21:55:39,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 21:55:39,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 21:55:39,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065923378] [2020-09-04 21:55:39,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 21:55:39,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:39,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 21:55:39,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 21:55:39,623 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 5 states. [2020-09-04 21:55:39,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:39,731 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2020-09-04 21:55:39,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 21:55:39,734 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-09-04 21:55:39,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:39,746 INFO L225 Difference]: With dead ends: 37 [2020-09-04 21:55:39,746 INFO L226 Difference]: Without dead ends: 23 [2020-09-04 21:55:39,752 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:39,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-09-04 21:55:39,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-09-04 21:55:39,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-09-04 21:55:39,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2020-09-04 21:55:39,803 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 16 [2020-09-04 21:55:39,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:39,803 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2020-09-04 21:55:39,803 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 21:55:39,804 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2020-09-04 21:55:39,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-09-04 21:55:39,806 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:39,806 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:39,806 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 21:55:39,807 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:39,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:39,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1478812441, now seen corresponding path program 1 times [2020-09-04 21:55:39,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:39,808 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1210589073] [2020-09-04 21:55:39,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:39,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:39,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:39,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:39,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:39,865 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,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:39,944 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:39,945 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1210589073] [2020-09-04 21:55:39,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:55:39,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-09-04 21:55:39,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306172479] [2020-09-04 21:55:39,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 21:55:39,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:39,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 21:55:39,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-04 21:55:39,950 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 6 states. [2020-09-04 21:55:40,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:40,031 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2020-09-04 21:55:40,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 21:55:40,032 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-09-04 21:55:40,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:40,033 INFO L225 Difference]: With dead ends: 34 [2020-09-04 21:55:40,034 INFO L226 Difference]: Without dead ends: 28 [2020-09-04 21:55:40,035 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:40,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-09-04 21:55:40,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-09-04 21:55:40,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-09-04 21:55:40,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2020-09-04 21:55:40,046 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 24 [2020-09-04 21:55:40,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:40,047 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2020-09-04 21:55:40,047 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 21:55:40,047 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-09-04 21:55:40,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-09-04 21:55:40,049 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:40,049 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:40,050 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 21:55:40,050 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:40,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:40,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1463730447, now seen corresponding path program 2 times [2020-09-04 21:55:40,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:40,051 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [138827021] [2020-09-04 21:55:40,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:40,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:40,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:40,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:40,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:40,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:40,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:40,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:40,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:40,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:40,231 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:40,231 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [138827021] [2020-09-04 21:55:40,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:55:40,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-04 21:55:40,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617301831] [2020-09-04 21:55:40,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 21:55:40,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:40,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 21:55:40,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-04 21:55:40,234 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 7 states. [2020-09-04 21:55:40,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:40,315 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2020-09-04 21:55:40,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 21:55:40,316 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2020-09-04 21:55:40,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:40,317 INFO L225 Difference]: With dead ends: 39 [2020-09-04 21:55:40,317 INFO L226 Difference]: Without dead ends: 33 [2020-09-04 21:55:40,318 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-09-04 21:55:40,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-09-04 21:55:40,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-09-04 21:55:40,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-09-04 21:55:40,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2020-09-04 21:55:40,330 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 32 [2020-09-04 21:55:40,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:40,331 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2020-09-04 21:55:40,331 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 21:55:40,332 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-09-04 21:55:40,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-09-04 21:55:40,335 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:40,335 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:40,336 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 21:55:40,336 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:40,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:40,337 INFO L82 PathProgramCache]: Analyzing trace with hash 23346727, now seen corresponding path program 3 times [2020-09-04 21:55:40,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:40,337 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1491549050] [2020-09-04 21:55:40,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:40,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:40,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:40,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:40,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:40,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:40,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:40,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:40,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:40,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:40,542 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:40,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:40,585 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:40,586 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1491549050] [2020-09-04 21:55:40,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:55:40,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-09-04 21:55:40,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505665647] [2020-09-04 21:55:40,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 21:55:40,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:40,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 21:55:40,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-09-04 21:55:40,588 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 8 states. [2020-09-04 21:55:40,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:40,675 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2020-09-04 21:55:40,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 21:55:40,676 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2020-09-04 21:55:40,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:40,678 INFO L225 Difference]: With dead ends: 44 [2020-09-04 21:55:40,678 INFO L226 Difference]: Without dead ends: 38 [2020-09-04 21:55:40,679 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-09-04 21:55:40,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-09-04 21:55:40,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-09-04 21:55:40,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-09-04 21:55:40,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2020-09-04 21:55:40,691 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 40 [2020-09-04 21:55:40,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:40,692 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2020-09-04 21:55:40,692 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 21:55:40,692 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2020-09-04 21:55:40,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-09-04 21:55:40,694 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:40,694 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:40,694 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 21:55:40,695 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:40,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:40,695 INFO L82 PathProgramCache]: Analyzing trace with hash -649675855, now seen corresponding path program 4 times [2020-09-04 21:55:40,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:40,696 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [226296734] [2020-09-04 21:55:40,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:40,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:40,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:40,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:40,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:40,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:40,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:40,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:40,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:40,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:40,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:40,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:40,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:40,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:40,995 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:40,995 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [226296734] [2020-09-04 21:55:40,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:55:40,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-09-04 21:55:40,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240628618] [2020-09-04 21:55:40,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 21:55:40,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:40,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 21:55:40,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-09-04 21:55:40,999 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 9 states. [2020-09-04 21:55:41,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:41,098 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2020-09-04 21:55:41,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 21:55:41,099 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2020-09-04 21:55:41,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:41,101 INFO L225 Difference]: With dead ends: 49 [2020-09-04 21:55:41,101 INFO L226 Difference]: Without dead ends: 43 [2020-09-04 21:55:41,102 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:41,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-09-04 21:55:41,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-09-04 21:55:41,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-09-04 21:55:41,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2020-09-04 21:55:41,113 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 48 [2020-09-04 21:55:41,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:41,114 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2020-09-04 21:55:41,114 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 21:55:41,114 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2020-09-04 21:55:41,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-09-04 21:55:41,116 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:41,116 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:41,116 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 21:55:41,117 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:41,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:41,117 INFO L82 PathProgramCache]: Analyzing trace with hash 899977063, now seen corresponding path program 5 times [2020-09-04 21:55:41,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:41,118 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1116304623] [2020-09-04 21:55:41,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:41,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:41,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:41,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:41,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:41,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:41,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:41,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:41,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:41,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:41,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:41,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:41,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:41,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:41,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:41,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:41,388 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:41,389 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1116304623] [2020-09-04 21:55:41,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:55:41,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-09-04 21:55:41,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694709368] [2020-09-04 21:55:41,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 21:55:41,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:41,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 21:55:41,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-09-04 21:55:41,394 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 10 states. [2020-09-04 21:55:41,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:41,517 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2020-09-04 21:55:41,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 21:55:41,518 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2020-09-04 21:55:41,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:41,520 INFO L225 Difference]: With dead ends: 54 [2020-09-04 21:55:41,521 INFO L226 Difference]: Without dead ends: 48 [2020-09-04 21:55:41,522 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:41,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-09-04 21:55:41,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-09-04 21:55:41,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-09-04 21:55:41,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2020-09-04 21:55:41,542 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 56 [2020-09-04 21:55:41,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:41,544 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2020-09-04 21:55:41,545 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 21:55:41,545 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2020-09-04 21:55:41,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-09-04 21:55:41,549 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:41,549 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:41,549 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 21:55:41,550 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:41,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:41,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1000802417, now seen corresponding path program 6 times [2020-09-04 21:55:41,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:41,553 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [373428410] [2020-09-04 21:55:41,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:41,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:41,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:41,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:41,599 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:41,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:41,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:41,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:41,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:41,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:41,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:41,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:41,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:41,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:41,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:41,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:41,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:41,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:41,853 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:41,854 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [373428410] [2020-09-04 21:55:41,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:55:41,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-09-04 21:55:41,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124501651] [2020-09-04 21:55:41,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 21:55:41,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:41,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 21:55:41,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-09-04 21:55:41,860 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 11 states. [2020-09-04 21:55:41,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:41,972 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2020-09-04 21:55:41,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 21:55:41,972 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2020-09-04 21:55:41,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:41,974 INFO L225 Difference]: With dead ends: 59 [2020-09-04 21:55:41,974 INFO L226 Difference]: Without dead ends: 53 [2020-09-04 21:55:41,975 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:41,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-09-04 21:55:41,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2020-09-04 21:55:41,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-09-04 21:55:41,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2020-09-04 21:55:41,985 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 64 [2020-09-04 21:55:41,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:41,985 INFO L479 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2020-09-04 21:55:41,985 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 21:55:41,986 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2020-09-04 21:55:41,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-09-04 21:55:41,987 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:41,987 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:41,987 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 21:55:41,988 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:41,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:41,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1977618599, now seen corresponding path program 7 times [2020-09-04 21:55:41,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:41,989 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1592235814] [2020-09-04 21:55:41,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:41,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:42,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:42,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:42,021 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:42,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:42,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:42,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:42,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:42,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:42,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:42,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:42,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:42,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:42,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:42,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:42,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:42,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:42,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:42,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:42,251 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:42,251 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1592235814] [2020-09-04 21:55:42,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:55:42,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-09-04 21:55:42,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114716313] [2020-09-04 21:55:42,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 21:55:42,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:42,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 21:55:42,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-09-04 21:55:42,254 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 12 states. [2020-09-04 21:55:42,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:42,379 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2020-09-04 21:55:42,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 21:55:42,380 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 72 [2020-09-04 21:55:42,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:42,382 INFO L225 Difference]: With dead ends: 64 [2020-09-04 21:55:42,382 INFO L226 Difference]: Without dead ends: 58 [2020-09-04 21:55:42,383 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:42,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-09-04 21:55:42,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2020-09-04 21:55:42,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-09-04 21:55:42,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2020-09-04 21:55:42,393 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 72 [2020-09-04 21:55:42,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:42,394 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2020-09-04 21:55:42,394 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 21:55:42,394 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2020-09-04 21:55:42,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-09-04 21:55:42,396 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:42,396 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:42,396 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 21:55:42,396 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:42,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:42,397 INFO L82 PathProgramCache]: Analyzing trace with hash 555623729, now seen corresponding path program 8 times [2020-09-04 21:55:42,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:42,397 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1833373043] [2020-09-04 21:55:42,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:42,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:42,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:42,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:42,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:42,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:42,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:42,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:42,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:42,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:42,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:42,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:42,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:42,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:42,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:42,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:42,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:42,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:42,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:42,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:42,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:42,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:42,704 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:42,704 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1833373043] [2020-09-04 21:55:42,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:55:42,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-09-04 21:55:42,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153082250] [2020-09-04 21:55:42,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 21:55:42,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:42,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 21:55:42,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2020-09-04 21:55:42,707 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 13 states. [2020-09-04 21:55:42,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:42,845 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2020-09-04 21:55:42,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-04 21:55:42,846 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 80 [2020-09-04 21:55:42,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:42,847 INFO L225 Difference]: With dead ends: 69 [2020-09-04 21:55:42,847 INFO L226 Difference]: Without dead ends: 63 [2020-09-04 21:55:42,848 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2020-09-04 21:55:42,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-09-04 21:55:42,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-09-04 21:55:42,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-09-04 21:55:42,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2020-09-04 21:55:42,858 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 80 [2020-09-04 21:55:42,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:42,859 INFO L479 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2020-09-04 21:55:42,859 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 21:55:42,859 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2020-09-04 21:55:42,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-09-04 21:55:42,861 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:42,861 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:42,861 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 21:55:42,861 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:42,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:42,862 INFO L82 PathProgramCache]: Analyzing trace with hash 777699815, now seen corresponding path program 9 times [2020-09-04 21:55:42,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:42,862 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1362320512] [2020-09-04 21:55:42,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:42,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:42,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:42,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:42,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:42,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:42,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:42,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:42,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:43,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:43,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:43,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:43,076 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:43,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:43,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:43,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:43,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:43,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:43,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:43,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:43,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:43,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:43,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:43,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:43,297 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:43,297 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1362320512] [2020-09-04 21:55:43,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:55:43,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-09-04 21:55:43,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711540578] [2020-09-04 21:55:43,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 21:55:43,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:43,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 21:55:43,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2020-09-04 21:55:43,300 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 14 states. [2020-09-04 21:55:43,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:43,467 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2020-09-04 21:55:43,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-04 21:55:43,467 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 88 [2020-09-04 21:55:43,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:43,469 INFO L225 Difference]: With dead ends: 74 [2020-09-04 21:55:43,469 INFO L226 Difference]: Without dead ends: 68 [2020-09-04 21:55:43,470 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:43,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-09-04 21:55:43,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2020-09-04 21:55:43,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-09-04 21:55:43,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2020-09-04 21:55:43,490 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 88 [2020-09-04 21:55:43,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:43,491 INFO L479 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2020-09-04 21:55:43,491 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 21:55:43,491 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2020-09-04 21:55:43,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-09-04 21:55:43,492 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:43,492 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:43,492 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 21:55:43,493 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:43,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:43,493 INFO L82 PathProgramCache]: Analyzing trace with hash 2145915377, now seen corresponding path program 10 times [2020-09-04 21:55:43,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:43,494 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [428111410] [2020-09-04 21:55:43,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:43,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:43,561 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:43,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:43,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:43,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:43,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:43,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:43,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:43,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:43,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:43,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:43,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:43,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:43,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:43,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:43,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:43,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:43,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:43,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:43,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:43,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:43,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:43,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:43,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:43,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:44,038 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2020-09-04 21:55:44,039 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [428111410] [2020-09-04 21:55:44,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:55:44,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-09-04 21:55:44,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668756380] [2020-09-04 21:55:44,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-09-04 21:55:44,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:44,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-09-04 21:55:44,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2020-09-04 21:55:44,044 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 15 states. [2020-09-04 21:55:44,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:44,245 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2020-09-04 21:55:44,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-04 21:55:44,246 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 96 [2020-09-04 21:55:44,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:44,248 INFO L225 Difference]: With dead ends: 79 [2020-09-04 21:55:44,249 INFO L226 Difference]: Without dead ends: 73 [2020-09-04 21:55:44,253 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=236, Invalid=414, Unknown=0, NotChecked=0, Total=650 [2020-09-04 21:55:44,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-09-04 21:55:44,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2020-09-04 21:55:44,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-09-04 21:55:44,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2020-09-04 21:55:44,280 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 96 [2020-09-04 21:55:44,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:44,281 INFO L479 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2020-09-04 21:55:44,281 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-09-04 21:55:44,281 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2020-09-04 21:55:44,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-09-04 21:55:44,284 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:44,285 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:55:44,285 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 21:55:44,285 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:44,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:44,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1180214055, now seen corresponding path program 11 times [2020-09-04 21:55:44,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:44,287 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [132916288] [2020-09-04 21:55:44,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:44,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:44,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:44,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:44,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:44,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:44,404 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:44,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:44,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:44,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:44,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:44,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:44,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:44,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:44,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:44,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:44,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:44,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:44,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:44,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:44,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:44,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:44,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:44,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:44,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:44,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:44,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:44,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:44,853 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2020-09-04 21:55:44,854 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [132916288] [2020-09-04 21:55:44,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:55:44,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-09-04 21:55:44,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194035417] [2020-09-04 21:55:44,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-04 21:55:44,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:44,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-04 21:55:44,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2020-09-04 21:55:44,857 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 16 states. [2020-09-04 21:55:45,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:45,027 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2020-09-04 21:55:45,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-04 21:55:45,028 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 104 [2020-09-04 21:55:45,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:45,029 INFO L225 Difference]: With dead ends: 84 [2020-09-04 21:55:45,029 INFO L226 Difference]: Without dead ends: 78 [2020-09-04 21:55:45,030 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=275, Invalid=481, Unknown=0, NotChecked=0, Total=756 [2020-09-04 21:55:45,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-09-04 21:55:45,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2020-09-04 21:55:45,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-09-04 21:55:45,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2020-09-04 21:55:45,045 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 104 [2020-09-04 21:55:45,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:45,046 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2020-09-04 21:55:45,046 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-04 21:55:45,046 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2020-09-04 21:55:45,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2020-09-04 21:55:45,048 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:45,049 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:55:45,049 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-04 21:55:45,049 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:45,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:45,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1287598415, now seen corresponding path program 12 times [2020-09-04 21:55:45,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:45,050 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [417419404] [2020-09-04 21:55:45,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:45,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:45,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:45,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:45,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:45,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:45,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:45,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:45,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:45,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:45,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:45,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:45,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:45,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:45,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:45,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:45,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:45,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:45,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:45,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:45,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:45,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:45,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:45,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:45,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:45,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:45,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:45,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:45,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:45,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:45,688 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2020-09-04 21:55:45,688 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [417419404] [2020-09-04 21:55:45,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:55:45,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-09-04 21:55:45,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584197664] [2020-09-04 21:55:45,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-09-04 21:55:45,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:45,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-09-04 21:55:45,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=163, Unknown=0, NotChecked=0, Total=272 [2020-09-04 21:55:45,691 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 17 states. [2020-09-04 21:55:45,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:45,890 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2020-09-04 21:55:45,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-09-04 21:55:45,891 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 112 [2020-09-04 21:55:45,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:45,892 INFO L225 Difference]: With dead ends: 89 [2020-09-04 21:55:45,892 INFO L226 Difference]: Without dead ends: 83 [2020-09-04 21:55:45,895 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=317, Invalid=553, Unknown=0, NotChecked=0, Total=870 [2020-09-04 21:55:45,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-09-04 21:55:45,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2020-09-04 21:55:45,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-09-04 21:55:45,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2020-09-04 21:55:45,909 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 112 [2020-09-04 21:55:45,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:45,909 INFO L479 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2020-09-04 21:55:45,909 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-09-04 21:55:45,909 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2020-09-04 21:55:45,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2020-09-04 21:55:45,912 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:45,912 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:55:45,912 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-04 21:55:45,913 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:45,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:45,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1612559463, now seen corresponding path program 13 times [2020-09-04 21:55:45,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:45,917 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2052674291] [2020-09-04 21:55:45,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:45,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:45,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:45,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:45,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:46,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:46,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:46,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:46,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:46,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:46,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:46,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:46,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:46,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:46,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:46,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:46,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:46,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:46,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:46,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:46,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:46,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:46,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:46,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:46,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:46,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:46,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:46,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:46,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:46,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:46,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:46,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:46,684 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2020-09-04 21:55:46,685 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2052674291] [2020-09-04 21:55:46,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:55:46,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-09-04 21:55:46,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604887667] [2020-09-04 21:55:46,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-09-04 21:55:46,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:46,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-09-04 21:55:46,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=182, Unknown=0, NotChecked=0, Total=306 [2020-09-04 21:55:46,687 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 18 states. [2020-09-04 21:55:46,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:46,900 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2020-09-04 21:55:46,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-04 21:55:46,900 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 120 [2020-09-04 21:55:46,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:46,902 INFO L225 Difference]: With dead ends: 94 [2020-09-04 21:55:46,902 INFO L226 Difference]: Without dead ends: 88 [2020-09-04 21:55:46,903 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=362, Invalid=630, Unknown=0, NotChecked=0, Total=992 [2020-09-04 21:55:46,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-09-04 21:55:46,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2020-09-04 21:55:46,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-09-04 21:55:46,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2020-09-04 21:55:46,915 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 120 [2020-09-04 21:55:46,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:46,915 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2020-09-04 21:55:46,915 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-09-04 21:55:46,916 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2020-09-04 21:55:46,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2020-09-04 21:55:46,918 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:46,918 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:55:46,918 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-04 21:55:46,919 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:46,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:46,919 INFO L82 PathProgramCache]: Analyzing trace with hash 996432753, now seen corresponding path program 14 times [2020-09-04 21:55:46,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:46,920 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1399844000] [2020-09-04 21:55:46,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:46,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:46,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:46,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:46,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:46,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:47,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:47,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:47,094 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:47,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:47,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:47,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:47,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:47,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:47,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:47,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:47,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:47,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:47,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:47,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:47,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:47,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:47,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:47,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:47,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:47,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:47,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:47,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:47,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:47,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:47,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:47,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:47,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:47,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:47,701 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2020-09-04 21:55:47,701 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1399844000] [2020-09-04 21:55:47,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:55:47,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-09-04 21:55:47,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273756420] [2020-09-04 21:55:47,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-09-04 21:55:47,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:47,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-09-04 21:55:47,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=202, Unknown=0, NotChecked=0, Total=342 [2020-09-04 21:55:47,704 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand 19 states. [2020-09-04 21:55:47,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:47,950 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2020-09-04 21:55:47,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-09-04 21:55:47,950 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 128 [2020-09-04 21:55:47,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:47,952 INFO L225 Difference]: With dead ends: 99 [2020-09-04 21:55:47,952 INFO L226 Difference]: Without dead ends: 93 [2020-09-04 21:55:47,954 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=410, Invalid=712, Unknown=0, NotChecked=0, Total=1122 [2020-09-04 21:55:47,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-09-04 21:55:47,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2020-09-04 21:55:47,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-09-04 21:55:47,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2020-09-04 21:55:47,962 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 128 [2020-09-04 21:55:47,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:47,963 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2020-09-04 21:55:47,963 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-09-04 21:55:47,963 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2020-09-04 21:55:47,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-09-04 21:55:47,965 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:47,965 INFO L422 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:55:47,965 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-09-04 21:55:47,965 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:47,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:47,966 INFO L82 PathProgramCache]: Analyzing trace with hash 418248103, now seen corresponding path program 15 times [2020-09-04 21:55:47,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:47,966 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1011632320] [2020-09-04 21:55:47,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:47,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 21:55:47,992 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 21:55:48,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 21:55:48,018 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 21:55:48,055 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-04 21:55:48,056 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-04 21:55:48,056 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-09-04 21:55:48,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 09:55:48 BoogieIcfgContainer [2020-09-04 21:55:48,134 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 21:55:48,139 INFO L168 Benchmark]: Toolchain (without parser) took 9712.04 ms. Allocated memory was 139.5 MB in the beginning and 358.1 MB in the end (delta: 218.6 MB). Free memory was 104.2 MB in the beginning and 116.7 MB in the end (delta: -12.5 MB). Peak memory consumption was 206.1 MB. Max. memory is 7.1 GB. [2020-09-04 21:55:48,140 INFO L168 Benchmark]: CDTParser took 0.93 ms. Allocated memory is still 139.5 MB. Free memory was 122.1 MB in the beginning and 121.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-04 21:55:48,145 INFO L168 Benchmark]: CACSL2BoogieTranslator took 296.56 ms. Allocated memory is still 139.5 MB. Free memory was 104.0 MB in the beginning and 94.7 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2020-09-04 21:55:48,151 INFO L168 Benchmark]: Boogie Preprocessor took 27.85 ms. Allocated memory is still 139.5 MB. Free memory was 94.7 MB in the beginning and 93.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2020-09-04 21:55:48,156 INFO L168 Benchmark]: RCFGBuilder took 368.11 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 93.4 MB in the beginning and 171.3 MB in the end (delta: -77.9 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2020-09-04 21:55:48,159 INFO L168 Benchmark]: TraceAbstraction took 8997.89 ms. Allocated memory was 203.4 MB in the beginning and 358.1 MB in the end (delta: 154.7 MB). Free memory was 170.6 MB in the beginning and 116.7 MB in the end (delta: 53.9 MB). Peak memory consumption was 208.6 MB. Max. memory is 7.1 GB. [2020-09-04 21:55:48,163 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.93 ms. Allocated memory is still 139.5 MB. Free memory was 122.1 MB in the beginning and 121.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 296.56 ms. Allocated memory is still 139.5 MB. Free memory was 104.0 MB in the beginning and 94.7 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 27.85 ms. Allocated memory is still 139.5 MB. Free memory was 94.7 MB in the beginning and 93.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 368.11 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 93.4 MB in the beginning and 171.3 MB in the end (delta: -77.9 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8997.89 ms. Allocated memory was 203.4 MB in the beginning and 358.1 MB in the end (delta: 154.7 MB). Free memory was 170.6 MB in the beginning and 116.7 MB in the end (delta: 53.9 MB). Peak memory consumption was 208.6 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 = 15; VAL [input=15] [L11] CALL, EXPR id(input) VAL [\old(x)=15] [L5] COND FALSE !(x==0) VAL [\old(x)=15, x=15] [L6] CALL, EXPR id(x-1) VAL [\old(x)=14] [L5] COND FALSE !(x==0) VAL [\old(x)=14, x=14] [L6] CALL, EXPR id(x-1) VAL [\old(x)=13] [L5] COND FALSE !(x==0) VAL [\old(x)=13, x=13] [L6] CALL, EXPR id(x-1) VAL [\old(x)=12] [L5] COND FALSE !(x==0) VAL [\old(x)=12, x=12] [L6] CALL, EXPR id(x-1) VAL [\old(x)=11] [L5] COND FALSE !(x==0) VAL [\old(x)=11, x=11] [L6] CALL, EXPR id(x-1) 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] [L6] RET, EXPR id(x-1) VAL [\old(x)=11, id(x-1)=10, x=11] [L6] return id(x-1) + 1; VAL [\old(x)=11, \result=11, id(x-1)=10, x=11] [L6] RET, EXPR id(x-1) VAL [\old(x)=12, id(x-1)=11, x=12] [L6] return id(x-1) + 1; VAL [\old(x)=12, \result=12, id(x-1)=11, x=12] [L6] RET, EXPR id(x-1) VAL [\old(x)=13, id(x-1)=12, x=13] [L6] return id(x-1) + 1; VAL [\old(x)=13, \result=13, id(x-1)=12, x=13] [L6] RET, EXPR id(x-1) VAL [\old(x)=14, id(x-1)=13, x=14] [L6] return id(x-1) + 1; VAL [\old(x)=14, \result=14, id(x-1)=13, x=14] [L6] RET, EXPR id(x-1) VAL [\old(x)=15, id(x-1)=14, x=15] [L6] return id(x-1) + 1; VAL [\old(x)=15, \result=15, id(x-1)=14, x=15] [L11] RET, EXPR id(input) VAL [id(input)=15, input=15] [L11] int result = id(input); VAL [id(input)=15, input=15, result=15] [L12] COND TRUE result == 15 VAL [input=15, result=15] [L13] __VERIFIER_error() VAL [input=15, result=15] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 8.7s, OverallIterations: 16, TraceHistogramMax: 16, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 274 SDtfs, 638 SDslu, 1165 SDs, 0 SdLazy, 465 SolverSat, 35 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 555 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1015 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 1216 NumberOfCodeBlocks, 1216 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1065 ConstructedInterpolants, 0 QuantifiedInterpolants, 239915 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 1 PerfectInterpolantSequences, 1575/4060 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...