/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/sum_15x0-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 21:56:54,821 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 21:56:54,825 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 21:56:54,858 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 21:56:54,858 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 21:56:54,860 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 21:56:54,861 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 21:56:54,863 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 21:56:54,865 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 21:56:54,866 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 21:56:54,867 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 21:56:54,868 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 21:56:54,869 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 21:56:54,870 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 21:56:54,871 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 21:56:54,872 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 21:56:54,873 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 21:56:54,875 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 21:56:54,877 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 21:56:54,879 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 21:56:54,881 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 21:56:54,882 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 21:56:54,883 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 21:56:54,885 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 21:56:54,887 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 21:56:54,888 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 21:56:54,888 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 21:56:54,889 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 21:56:54,890 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 21:56:54,891 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 21:56:54,891 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 21:56:54,892 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 21:56:54,893 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 21:56:54,894 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 21:56:54,895 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 21:56:54,896 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 21:56:54,896 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 21:56:54,897 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 21:56:54,897 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 21:56:54,898 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 21:56:54,899 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 21:56:54,900 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:56:54,912 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 21:56:54,914 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 21:56:54,915 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 21:56:54,916 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 21:56:54,916 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 21:56:54,916 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 21:56:54,916 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 21:56:54,916 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 21:56:54,917 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 21:56:54,917 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 21:56:54,918 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 21:56:54,918 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 21:56:54,918 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 21:56:54,918 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 21:56:54,918 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 21:56:54,919 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 21:56:54,920 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 21:56:54,920 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 21:56:54,920 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 21:56:54,920 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 21:56:54,921 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 21:56:54,921 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 21:56:54,921 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:56:55,365 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 21:56:55,382 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 21:56:55,386 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 21:56:55,388 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 21:56:55,388 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 21:56:55,389 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/sum_15x0-2.c [2020-09-04 21:56:55,472 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/62d5b6637/6ab5dcfd131a46f0b52181b34c8ba810/FLAGe44007fe6 [2020-09-04 21:56:56,053 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 21:56:56,054 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/sum_15x0-2.c [2020-09-04 21:56:56,062 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/62d5b6637/6ab5dcfd131a46f0b52181b34c8ba810/FLAGe44007fe6 [2020-09-04 21:56:56,410 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/62d5b6637/6ab5dcfd131a46f0b52181b34c8ba810 [2020-09-04 21:56:56,426 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 21:56:56,429 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 21:56:56,430 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 21:56:56,430 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 21:56:56,435 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 21:56:56,436 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 09:56:56" (1/1) ... [2020-09-04 21:56:56,440 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1840d501 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:56:56, skipping insertion in model container [2020-09-04 21:56:56,440 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 09:56:56" (1/1) ... [2020-09-04 21:56:56,449 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 21:56:56,475 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 21:56:56,672 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 21:56:56,677 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 21:56:56,697 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 21:56:56,716 INFO L208 MainTranslator]: Completed translation [2020-09-04 21:56:56,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:56:56 WrapperNode [2020-09-04 21:56:56,717 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 21:56:56,717 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 21:56:56,718 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 21:56:56,718 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 21:56:56,735 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:56:56" (1/1) ... [2020-09-04 21:56:56,736 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:56:56" (1/1) ... [2020-09-04 21:56:56,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:56:56" (1/1) ... [2020-09-04 21:56:56,743 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:56:56" (1/1) ... [2020-09-04 21:56:56,747 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:56:56" (1/1) ... [2020-09-04 21:56:56,749 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:56:56" (1/1) ... [2020-09-04 21:56:56,750 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:56:56" (1/1) ... [2020-09-04 21:56:56,752 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 21:56:56,752 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 21:56:56,753 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 21:56:56,753 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 21:56:56,754 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:56:56" (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:56:56,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 21:56:56,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 21:56:56,933 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2020-09-04 21:56:56,933 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 21:56:56,933 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 21:56:56,933 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2020-09-04 21:56:56,933 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 21:56:56,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 21:56:56,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 21:56:57,158 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 21:56:57,158 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-04 21:56:57,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 09:56:57 BoogieIcfgContainer [2020-09-04 21:56:57,176 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 21:56:57,181 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 21:56:57,181 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 21:56:57,194 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 21:56:57,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 09:56:56" (1/3) ... [2020-09-04 21:56:57,199 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bdf99f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 09:56:57, skipping insertion in model container [2020-09-04 21:56:57,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:56:56" (2/3) ... [2020-09-04 21:56:57,200 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bdf99f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 09:56:57, skipping insertion in model container [2020-09-04 21:56:57,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 09:56:57" (3/3) ... [2020-09-04 21:56:57,209 INFO L109 eAbstractionObserver]: Analyzing ICFG sum_15x0-2.c [2020-09-04 21:56:57,235 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 21:56:57,246 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 21:56:57,272 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 21:56:57,305 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 21:56:57,306 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 21:56:57,306 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-04 21:56:57,306 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 21:56:57,306 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 21:56:57,306 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 21:56:57,307 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 21:56:57,307 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 21:56:57,326 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2020-09-04 21:56:57,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-04 21:56:57,341 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:57,342 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:56:57,342 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:57,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:57,350 INFO L82 PathProgramCache]: Analyzing trace with hash 989240825, now seen corresponding path program 1 times [2020-09-04 21:56:57,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:57,362 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1903290900] [2020-09-04 21:56:57,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:57,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:57,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:57,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:57,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 21:56:57,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:57,669 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:56:57,671 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1903290900] [2020-09-04 21:56:57,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 21:56:57,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 21:56:57,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578951353] [2020-09-04 21:56:57,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 21:56:57,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:57,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 21:56:57,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 21:56:57,698 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 5 states. [2020-09-04 21:56:57,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:57,819 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2020-09-04 21:56:57,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 21:56:57,821 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-09-04 21:56:57,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:57,833 INFO L225 Difference]: With dead ends: 39 [2020-09-04 21:56:57,834 INFO L226 Difference]: Without dead ends: 25 [2020-09-04 21:56:57,838 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:56:57,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-09-04 21:56:57,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-09-04 21:56:57,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-09-04 21:56:57,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2020-09-04 21:56:57,892 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 18 [2020-09-04 21:56:57,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:57,893 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2020-09-04 21:56:57,893 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 21:56:57,893 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2020-09-04 21:56:57,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-09-04 21:56:57,896 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:57,896 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:56:57,897 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 21:56:57,897 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:57,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:57,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1852726759, now seen corresponding path program 1 times [2020-09-04 21:56:57,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:57,898 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1510789061] [2020-09-04 21:56:57,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:57,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:57,947 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:57,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:57,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 21:56:57,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:57,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:56:58,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:58,033 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-09-04 21:56:58,034 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1510789061] [2020-09-04 21:56:58,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:58,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-09-04 21:56:58,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62307020] [2020-09-04 21:56:58,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 21:56:58,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:58,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 21:56:58,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-04 21:56:58,039 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 6 states. [2020-09-04 21:56:58,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:58,112 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2020-09-04 21:56:58,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 21:56:58,113 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-09-04 21:56:58,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:58,115 INFO L225 Difference]: With dead ends: 36 [2020-09-04 21:56:58,115 INFO L226 Difference]: Without dead ends: 30 [2020-09-04 21:56:58,116 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:56:58,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-09-04 21:56:58,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-09-04 21:56:58,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-09-04 21:56:58,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2020-09-04 21:56:58,129 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 27 [2020-09-04 21:56:58,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:58,130 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2020-09-04 21:56:58,130 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 21:56:58,130 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-09-04 21:56:58,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-09-04 21:56:58,131 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:58,132 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:56:58,132 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 21:56:58,132 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:58,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:58,133 INFO L82 PathProgramCache]: Analyzing trace with hash -175020829, now seen corresponding path program 2 times [2020-09-04 21:56:58,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:58,134 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [847163282] [2020-09-04 21:56:58,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:58,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:58,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:58,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:58,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 21:56:58,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:58,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:56:58,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:58,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:56:58,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:58,305 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-09-04 21:56:58,306 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [847163282] [2020-09-04 21:56:58,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:58,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-04 21:56:58,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832674203] [2020-09-04 21:56:58,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 21:56:58,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:58,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 21:56:58,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-04 21:56:58,308 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 7 states. [2020-09-04 21:56:58,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:58,394 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2020-09-04 21:56:58,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 21:56:58,395 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2020-09-04 21:56:58,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:58,397 INFO L225 Difference]: With dead ends: 41 [2020-09-04 21:56:58,397 INFO L226 Difference]: Without dead ends: 35 [2020-09-04 21:56:58,398 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-09-04 21:56:58,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-09-04 21:56:58,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-09-04 21:56:58,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-09-04 21:56:58,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2020-09-04 21:56:58,411 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 36 [2020-09-04 21:56:58,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:58,412 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2020-09-04 21:56:58,412 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 21:56:58,412 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2020-09-04 21:56:58,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-09-04 21:56:58,414 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:58,414 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:56:58,414 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 21:56:58,414 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:58,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:58,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1021564803, now seen corresponding path program 3 times [2020-09-04 21:56:58,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:58,416 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1107183558] [2020-09-04 21:56:58,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:58,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:58,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:58,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:58,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 21:56:58,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:58,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:56:58,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:58,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:56:58,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:58,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:56:58,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:58,744 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-09-04 21:56:58,745 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1107183558] [2020-09-04 21:56:58,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:58,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-09-04 21:56:58,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767619936] [2020-09-04 21:56:58,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 21:56:58,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:58,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 21:56:58,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-09-04 21:56:58,749 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 8 states. [2020-09-04 21:56:58,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:58,897 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2020-09-04 21:56:58,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 21:56:58,898 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2020-09-04 21:56:58,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:58,901 INFO L225 Difference]: With dead ends: 46 [2020-09-04 21:56:58,904 INFO L226 Difference]: Without dead ends: 40 [2020-09-04 21:56:58,905 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:56:58,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-09-04 21:56:58,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-09-04 21:56:58,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-09-04 21:56:58,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2020-09-04 21:56:58,929 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 45 [2020-09-04 21:56:58,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:58,931 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2020-09-04 21:56:58,931 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 21:56:58,932 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2020-09-04 21:56:58,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-09-04 21:56:58,936 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:58,936 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:56:58,936 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 21:56:58,936 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:58,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:58,937 INFO L82 PathProgramCache]: Analyzing trace with hash -263249715, now seen corresponding path program 4 times [2020-09-04 21:56:58,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:58,937 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [650555884] [2020-09-04 21:56:58,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:58,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:59,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:59,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:59,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 21:56:59,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:59,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:56:59,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:59,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:56:59,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:59,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:56:59,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:59,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:56:59,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:59,193 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-09-04 21:56:59,193 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [650555884] [2020-09-04 21:56:59,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:59,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-09-04 21:56:59,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412709182] [2020-09-04 21:56:59,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 21:56:59,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:59,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 21:56:59,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-09-04 21:56:59,196 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 9 states. [2020-09-04 21:56:59,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:59,295 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2020-09-04 21:56:59,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 21:56:59,296 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2020-09-04 21:56:59,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:59,297 INFO L225 Difference]: With dead ends: 51 [2020-09-04 21:56:59,298 INFO L226 Difference]: Without dead ends: 45 [2020-09-04 21:56:59,299 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:56:59,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-09-04 21:56:59,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-09-04 21:56:59,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-09-04 21:56:59,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2020-09-04 21:56:59,310 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 54 [2020-09-04 21:56:59,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:59,310 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2020-09-04 21:56:59,310 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 21:56:59,311 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2020-09-04 21:56:59,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-09-04 21:56:59,312 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:59,312 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:56:59,312 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 21:56:59,313 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:59,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:59,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1884999187, now seen corresponding path program 5 times [2020-09-04 21:56:59,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:59,314 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [131343398] [2020-09-04 21:56:59,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:59,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:59,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:59,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:59,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 21:56:59,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:59,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:56:59,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:59,457 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:56:59,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:59,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:56:59,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:59,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:56:59,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:59,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:56:59,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:59,615 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-09-04 21:56:59,616 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [131343398] [2020-09-04 21:56:59,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:59,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-09-04 21:56:59,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631648599] [2020-09-04 21:56:59,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 21:56:59,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:59,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 21:56:59,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-09-04 21:56:59,620 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 10 states. [2020-09-04 21:56:59,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:59,735 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2020-09-04 21:56:59,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 21:56:59,736 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2020-09-04 21:56:59,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:59,738 INFO L225 Difference]: With dead ends: 56 [2020-09-04 21:56:59,738 INFO L226 Difference]: Without dead ends: 50 [2020-09-04 21:56:59,739 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:56:59,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-09-04 21:56:59,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2020-09-04 21:56:59,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-09-04 21:56:59,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2020-09-04 21:56:59,750 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 63 [2020-09-04 21:56:59,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:59,751 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2020-09-04 21:56:59,751 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 21:56:59,751 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2020-09-04 21:56:59,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-09-04 21:56:59,753 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:59,753 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:56:59,753 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 21:56:59,754 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:59,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:59,754 INFO L82 PathProgramCache]: Analyzing trace with hash -441437769, now seen corresponding path program 6 times [2020-09-04 21:56:59,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:59,755 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1168624674] [2020-09-04 21:56:59,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:59,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:59,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:59,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:59,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 21:56:59,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:59,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:56:59,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:59,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:56:59,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:59,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:56:59,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:59,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:56:59,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:00,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:00,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:00,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:00,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:00,079 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-09-04 21:57:00,079 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1168624674] [2020-09-04 21:57:00,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:57:00,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-09-04 21:57:00,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950100307] [2020-09-04 21:57:00,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 21:57:00,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:57:00,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 21:57:00,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-09-04 21:57:00,084 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 11 states. [2020-09-04 21:57:00,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:57:00,227 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2020-09-04 21:57:00,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 21:57:00,228 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2020-09-04 21:57:00,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:57:00,230 INFO L225 Difference]: With dead ends: 61 [2020-09-04 21:57:00,232 INFO L226 Difference]: Without dead ends: 55 [2020-09-04 21:57:00,233 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:57:00,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-09-04 21:57:00,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2020-09-04 21:57:00,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-09-04 21:57:00,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2020-09-04 21:57:00,249 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 72 [2020-09-04 21:57:00,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:57:00,250 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2020-09-04 21:57:00,250 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 21:57:00,250 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2020-09-04 21:57:00,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-09-04 21:57:00,255 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:57:00,255 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:57:00,255 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 21:57:00,255 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:57:00,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:57:00,256 INFO L82 PathProgramCache]: Analyzing trace with hash 999943849, now seen corresponding path program 7 times [2020-09-04 21:57:00,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:57:00,257 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1904677500] [2020-09-04 21:57:00,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:57:00,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:00,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:57:00,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:00,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 21:57:00,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:00,373 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:00,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:00,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:00,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:00,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:00,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:00,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:00,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:00,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:00,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:00,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:00,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:00,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:00,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:00,658 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-09-04 21:57:00,658 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1904677500] [2020-09-04 21:57:00,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:57:00,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-09-04 21:57:00,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028358099] [2020-09-04 21:57:00,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 21:57:00,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:57:00,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 21:57:00,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-09-04 21:57:00,668 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 12 states. [2020-09-04 21:57:00,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:57:00,811 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2020-09-04 21:57:00,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 21:57:00,812 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 81 [2020-09-04 21:57:00,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:57:00,814 INFO L225 Difference]: With dead ends: 66 [2020-09-04 21:57:00,814 INFO L226 Difference]: Without dead ends: 60 [2020-09-04 21:57:00,815 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:57:00,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-09-04 21:57:00,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2020-09-04 21:57:00,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-09-04 21:57:00,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2020-09-04 21:57:00,825 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 81 [2020-09-04 21:57:00,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:57:00,826 INFO L479 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2020-09-04 21:57:00,826 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 21:57:00,826 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2020-09-04 21:57:00,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-09-04 21:57:00,827 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:57:00,827 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:57:00,827 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 21:57:00,828 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:57:00,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:57:00,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1356134305, now seen corresponding path program 8 times [2020-09-04 21:57:00,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:57:00,829 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [214746343] [2020-09-04 21:57:00,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:57:00,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:00,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:57:00,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:00,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 21:57:00,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:00,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:00,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:00,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:00,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:00,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:00,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:01,021 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:01,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:01,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:01,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:01,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:01,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:01,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:01,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:01,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:01,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:01,205 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-09-04 21:57:01,205 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [214746343] [2020-09-04 21:57:01,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:57:01,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-09-04 21:57:01,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469970923] [2020-09-04 21:57:01,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 21:57:01,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:57:01,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 21:57:01,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2020-09-04 21:57:01,208 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 13 states. [2020-09-04 21:57:01,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:57:01,386 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2020-09-04 21:57:01,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-04 21:57:01,386 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 90 [2020-09-04 21:57:01,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:57:01,388 INFO L225 Difference]: With dead ends: 71 [2020-09-04 21:57:01,388 INFO L226 Difference]: Without dead ends: 65 [2020-09-04 21:57:01,389 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:57:01,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-09-04 21:57:01,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2020-09-04 21:57:01,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-09-04 21:57:01,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2020-09-04 21:57:01,399 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 90 [2020-09-04 21:57:01,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:57:01,400 INFO L479 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2020-09-04 21:57:01,400 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 21:57:01,400 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2020-09-04 21:57:01,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-09-04 21:57:01,402 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:57:01,402 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:57:01,402 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 21:57:01,402 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:57:01,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:57:01,403 INFO L82 PathProgramCache]: Analyzing trace with hash -928437697, now seen corresponding path program 9 times [2020-09-04 21:57:01,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:57:01,403 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [807767512] [2020-09-04 21:57:01,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:57:01,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:01,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:57:01,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:01,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 21:57:01,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:01,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:01,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:01,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:01,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:01,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:01,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:01,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:01,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:01,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:01,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:01,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:01,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:01,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:01,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:01,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:01,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:01,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:01,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:01,831 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-09-04 21:57:01,831 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [807767512] [2020-09-04 21:57:01,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:57:01,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-09-04 21:57:01,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843018602] [2020-09-04 21:57:01,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 21:57:01,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:57:01,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 21:57:01,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2020-09-04 21:57:01,834 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 14 states. [2020-09-04 21:57:02,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:57:02,040 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2020-09-04 21:57:02,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-04 21:57:02,041 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 99 [2020-09-04 21:57:02,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:57:02,042 INFO L225 Difference]: With dead ends: 76 [2020-09-04 21:57:02,042 INFO L226 Difference]: Without dead ends: 70 [2020-09-04 21:57:02,043 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:57:02,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-09-04 21:57:02,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-09-04 21:57:02,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-09-04 21:57:02,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2020-09-04 21:57:02,052 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 99 [2020-09-04 21:57:02,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:57:02,053 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2020-09-04 21:57:02,053 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 21:57:02,053 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2020-09-04 21:57:02,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-09-04 21:57:02,054 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:57:02,055 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:57:02,055 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 21:57:02,055 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:57:02,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:57:02,055 INFO L82 PathProgramCache]: Analyzing trace with hash -276966773, now seen corresponding path program 10 times [2020-09-04 21:57:02,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:57:02,056 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1189001747] [2020-09-04 21:57:02,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:57:02,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:02,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:57:02,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:02,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 21:57:02,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:02,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:02,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:02,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:02,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:02,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:02,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:02,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:02,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:02,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:02,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:02,373 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:02,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:02,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:02,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:02,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:02,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:02,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:02,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:02,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:02,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:02,549 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-09-04 21:57:02,550 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1189001747] [2020-09-04 21:57:02,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:57:02,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-09-04 21:57:02,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450974343] [2020-09-04 21:57:02,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-09-04 21:57:02,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:57:02,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-09-04 21:57:02,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2020-09-04 21:57:02,552 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 15 states. [2020-09-04 21:57:02,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:57:02,721 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2020-09-04 21:57:02,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-04 21:57:02,722 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 108 [2020-09-04 21:57:02,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:57:02,723 INFO L225 Difference]: With dead ends: 81 [2020-09-04 21:57:02,723 INFO L226 Difference]: Without dead ends: 75 [2020-09-04 21:57:02,724 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:57:02,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-09-04 21:57:02,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2020-09-04 21:57:02,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-09-04 21:57:02,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2020-09-04 21:57:02,734 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 108 [2020-09-04 21:57:02,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:57:02,734 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2020-09-04 21:57:02,734 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-09-04 21:57:02,735 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2020-09-04 21:57:02,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-09-04 21:57:02,736 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:57:02,736 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:57:02,736 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 21:57:02,736 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:57:02,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:57:02,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1749540651, now seen corresponding path program 11 times [2020-09-04 21:57:02,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:57:02,737 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1289815478] [2020-09-04 21:57:02,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:57:02,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:02,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:57:02,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:02,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 21:57:02,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:02,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:02,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:02,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:02,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:02,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:02,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:02,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:02,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:03,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:03,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:03,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:03,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:03,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:03,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:03,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:03,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:03,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:03,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:03,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:03,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:03,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:03,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:03,337 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-09-04 21:57:03,337 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1289815478] [2020-09-04 21:57:03,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:57:03,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-09-04 21:57:03,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343347210] [2020-09-04 21:57:03,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-04 21:57:03,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:57:03,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-04 21:57:03,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2020-09-04 21:57:03,340 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 16 states. [2020-09-04 21:57:03,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:57:03,524 INFO L93 Difference]: Finished difference Result 86 states and 87 transitions. [2020-09-04 21:57:03,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-04 21:57:03,525 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 117 [2020-09-04 21:57:03,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:57:03,526 INFO L225 Difference]: With dead ends: 86 [2020-09-04 21:57:03,527 INFO L226 Difference]: Without dead ends: 80 [2020-09-04 21:57:03,528 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:57:03,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-09-04 21:57:03,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2020-09-04 21:57:03,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-09-04 21:57:03,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2020-09-04 21:57:03,537 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 117 [2020-09-04 21:57:03,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:57:03,538 INFO L479 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2020-09-04 21:57:03,538 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-04 21:57:03,538 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2020-09-04 21:57:03,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2020-09-04 21:57:03,539 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:57:03,539 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:57:03,539 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-04 21:57:03,540 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:57:03,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:57:03,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1141580405, now seen corresponding path program 12 times [2020-09-04 21:57:03,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:57:03,541 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2120845] [2020-09-04 21:57:03,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:57:03,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:03,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:57:03,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:03,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 21:57:03,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:03,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:03,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:03,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:03,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:03,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:03,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:03,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:03,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:03,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:03,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:03,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:03,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:04,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:04,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:04,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:04,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:04,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:04,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:04,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:04,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:04,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:04,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:04,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:04,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:04,260 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-09-04 21:57:04,260 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2120845] [2020-09-04 21:57:04,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:57:04,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-09-04 21:57:04,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235676170] [2020-09-04 21:57:04,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-09-04 21:57:04,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:57:04,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-09-04 21:57:04,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=163, Unknown=0, NotChecked=0, Total=272 [2020-09-04 21:57:04,263 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 17 states. [2020-09-04 21:57:04,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:57:04,465 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2020-09-04 21:57:04,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-09-04 21:57:04,466 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 126 [2020-09-04 21:57:04,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:57:04,467 INFO L225 Difference]: With dead ends: 91 [2020-09-04 21:57:04,467 INFO L226 Difference]: Without dead ends: 85 [2020-09-04 21:57:04,468 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=317, Invalid=553, Unknown=0, NotChecked=0, Total=870 [2020-09-04 21:57:04,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-09-04 21:57:04,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2020-09-04 21:57:04,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-09-04 21:57:04,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2020-09-04 21:57:04,478 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 126 [2020-09-04 21:57:04,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:57:04,478 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2020-09-04 21:57:04,478 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-09-04 21:57:04,478 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2020-09-04 21:57:04,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-09-04 21:57:04,480 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:57:04,480 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:57:04,480 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-04 21:57:04,481 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:57:04,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:57:04,481 INFO L82 PathProgramCache]: Analyzing trace with hash 55997035, now seen corresponding path program 13 times [2020-09-04 21:57:04,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:57:04,482 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [416106292] [2020-09-04 21:57:04,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:57:04,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:04,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:57:04,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:04,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 21:57:04,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:04,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:04,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:04,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:04,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:04,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:04,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:04,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:04,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:04,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:04,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:04,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:04,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:04,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:04,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:04,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:04,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:04,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:04,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:04,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:04,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:05,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:05,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:05,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:05,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:05,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:05,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:05,177 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-09-04 21:57:05,178 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [416106292] [2020-09-04 21:57:05,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:57:05,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-09-04 21:57:05,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999085527] [2020-09-04 21:57:05,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-09-04 21:57:05,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:57:05,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-09-04 21:57:05,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=182, Unknown=0, NotChecked=0, Total=306 [2020-09-04 21:57:05,180 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 18 states. [2020-09-04 21:57:05,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:57:05,401 INFO L93 Difference]: Finished difference Result 96 states and 97 transitions. [2020-09-04 21:57:05,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-04 21:57:05,401 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 135 [2020-09-04 21:57:05,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:57:05,403 INFO L225 Difference]: With dead ends: 96 [2020-09-04 21:57:05,403 INFO L226 Difference]: Without dead ends: 90 [2020-09-04 21:57:05,404 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:57:05,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-09-04 21:57:05,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2020-09-04 21:57:05,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-09-04 21:57:05,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2020-09-04 21:57:05,413 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 135 [2020-09-04 21:57:05,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:57:05,413 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2020-09-04 21:57:05,413 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-09-04 21:57:05,414 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2020-09-04 21:57:05,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-09-04 21:57:05,415 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:57:05,415 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:57:05,416 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-04 21:57:05,416 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:57:05,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:57:05,416 INFO L82 PathProgramCache]: Analyzing trace with hash 394086239, now seen corresponding path program 14 times [2020-09-04 21:57:05,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:57:05,417 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [479592399] [2020-09-04 21:57:05,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:57:05,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:05,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:57:05,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:05,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 21:57:05,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:05,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:05,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:05,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:05,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:05,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:05,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:05,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:05,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:05,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:05,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:05,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:05,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:05,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:05,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:05,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:05,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:05,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:05,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:06,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:06,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:06,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:06,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:06,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:06,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:06,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:06,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:06,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:06,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:06,258 INFO L134 CoverageAnalysis]: Checked inductivity of 889 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-09-04 21:57:06,258 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [479592399] [2020-09-04 21:57:06,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:57:06,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-09-04 21:57:06,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670359140] [2020-09-04 21:57:06,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-09-04 21:57:06,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:57:06,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-09-04 21:57:06,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=202, Unknown=0, NotChecked=0, Total=342 [2020-09-04 21:57:06,260 INFO L87 Difference]: Start difference. First operand 90 states and 91 transitions. Second operand 19 states. [2020-09-04 21:57:06,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:57:06,508 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2020-09-04 21:57:06,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-09-04 21:57:06,508 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 144 [2020-09-04 21:57:06,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:57:06,510 INFO L225 Difference]: With dead ends: 101 [2020-09-04 21:57:06,510 INFO L226 Difference]: Without dead ends: 95 [2020-09-04 21:57:06,511 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:57:06,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-09-04 21:57:06,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2020-09-04 21:57:06,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-09-04 21:57:06,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2020-09-04 21:57:06,519 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 144 [2020-09-04 21:57:06,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:57:06,519 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2020-09-04 21:57:06,519 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-09-04 21:57:06,520 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2020-09-04 21:57:06,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2020-09-04 21:57:06,521 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:57:06,521 INFO L422 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:57:06,522 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-09-04 21:57:06,522 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:57:06,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:57:06,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1047772929, now seen corresponding path program 15 times [2020-09-04 21:57:06,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:57:06,523 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1086133841] [2020-09-04 21:57:06,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:57:06,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 21:57:06,553 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 21:57:06,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 21:57:06,584 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 21:57:06,619 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-04 21:57:06,619 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-04 21:57:06,620 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-09-04 21:57:06,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 09:57:06 BoogieIcfgContainer [2020-09-04 21:57:06,682 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 21:57:06,686 INFO L168 Benchmark]: Toolchain (without parser) took 10256.50 ms. Allocated memory was 138.9 MB in the beginning and 385.4 MB in the end (delta: 246.4 MB). Free memory was 103.4 MB in the beginning and 296.3 MB in the end (delta: -192.9 MB). Peak memory consumption was 53.5 MB. Max. memory is 7.1 GB. [2020-09-04 21:57:06,686 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 138.9 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-04 21:57:06,687 INFO L168 Benchmark]: CACSL2BoogieTranslator took 287.22 ms. Allocated memory is still 138.9 MB. Free memory was 103.2 MB in the beginning and 93.9 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2020-09-04 21:57:06,688 INFO L168 Benchmark]: Boogie Preprocessor took 34.68 ms. Allocated memory is still 138.9 MB. Free memory was 93.9 MB in the beginning and 92.5 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:57:06,689 INFO L168 Benchmark]: RCFGBuilder took 424.03 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 92.5 MB in the beginning and 170.1 MB in the end (delta: -77.6 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2020-09-04 21:57:06,689 INFO L168 Benchmark]: TraceAbstraction took 9501.38 ms. Allocated memory was 202.4 MB in the beginning and 385.4 MB in the end (delta: 183.0 MB). Free memory was 169.5 MB in the beginning and 296.3 MB in the end (delta: -126.8 MB). Peak memory consumption was 56.1 MB. Max. memory is 7.1 GB. [2020-09-04 21:57:06,693 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.22 ms. Allocated memory is still 138.9 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 287.22 ms. Allocated memory is still 138.9 MB. Free memory was 103.2 MB in the beginning and 93.9 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 34.68 ms. Allocated memory is still 138.9 MB. Free memory was 93.9 MB in the beginning and 92.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 424.03 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 92.5 MB in the beginning and 170.1 MB in the end (delta: -77.6 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9501.38 ms. Allocated memory was 202.4 MB in the beginning and 385.4 MB in the end (delta: 183.0 MB). Free memory was 169.5 MB in the beginning and 296.3 MB in the end (delta: -126.8 MB). Peak memory consumption was 56.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 16]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] int a = 15; VAL [a=15] [L13] int b = 0; VAL [a=15, b=0] [L14] CALL, EXPR sum(a, b) VAL [\old(m)=0, \old(n)=15] [L4] COND FALSE !(n <= 0) VAL [\old(m)=0, \old(n)=15, m=0, n=15] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=14] [L4] COND FALSE !(n <= 0) VAL [\old(m)=1, \old(n)=14, m=1, n=14] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=13] [L4] COND FALSE !(n <= 0) VAL [\old(m)=2, \old(n)=13, m=2, n=13] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=12] [L4] COND FALSE !(n <= 0) VAL [\old(m)=3, \old(n)=12, m=3, n=12] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=11] [L4] COND FALSE !(n <= 0) VAL [\old(m)=4, \old(n)=11, m=4, n=11] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=10] [L4] COND FALSE !(n <= 0) VAL [\old(m)=5, \old(n)=10, m=5, n=10] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=9] [L4] COND FALSE !(n <= 0) VAL [\old(m)=6, \old(n)=9, m=6, n=9] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=8] [L4] COND FALSE !(n <= 0) VAL [\old(m)=7, \old(n)=8, m=7, n=8] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=7] [L4] COND FALSE !(n <= 0) VAL [\old(m)=8, \old(n)=7, m=8, n=7] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=6] [L4] COND FALSE !(n <= 0) VAL [\old(m)=9, \old(n)=6, m=9, n=6] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=5] [L4] COND FALSE !(n <= 0) VAL [\old(m)=10, \old(n)=5, m=10, n=5] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=4] [L4] COND FALSE !(n <= 0) VAL [\old(m)=11, \old(n)=4, m=11, n=4] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=3] [L4] COND FALSE !(n <= 0) VAL [\old(m)=12, \old(n)=3, m=12, n=3] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=2] [L4] COND FALSE !(n <= 0) VAL [\old(m)=13, \old(n)=2, m=13, n=2] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=1] [L4] COND FALSE !(n <= 0) VAL [\old(m)=14, \old(n)=1, m=14, n=1] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=15, \old(n)=0] [L4] COND TRUE n <= 0 VAL [\old(m)=15, \old(n)=0, m=15, n=0] [L5] return m + n; VAL [\old(m)=15, \old(n)=0, \result=15, m=15, n=0] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=1, m=14, n=1, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); VAL [\old(m)=14, \old(n)=1, \result=15, m=14, n=1, sum(n - 1, m + 1)=15] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=2, m=13, n=2, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); VAL [\old(m)=13, \old(n)=2, \result=15, m=13, n=2, sum(n - 1, m + 1)=15] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=3, m=12, n=3, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); VAL [\old(m)=12, \old(n)=3, \result=15, m=12, n=3, sum(n - 1, m + 1)=15] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=4, m=11, n=4, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); VAL [\old(m)=11, \old(n)=4, \result=15, m=11, n=4, sum(n - 1, m + 1)=15] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=5, m=10, n=5, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); VAL [\old(m)=10, \old(n)=5, \result=15, m=10, n=5, sum(n - 1, m + 1)=15] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=6, m=9, n=6, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); VAL [\old(m)=9, \old(n)=6, \result=15, m=9, n=6, sum(n - 1, m + 1)=15] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=7, m=8, n=7, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); VAL [\old(m)=8, \old(n)=7, \result=15, m=8, n=7, sum(n - 1, m + 1)=15] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=8, m=7, n=8, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); VAL [\old(m)=7, \old(n)=8, \result=15, m=7, n=8, sum(n - 1, m + 1)=15] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=9, m=6, n=9, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); VAL [\old(m)=6, \old(n)=9, \result=15, m=6, n=9, sum(n - 1, m + 1)=15] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=10, m=5, n=10, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); VAL [\old(m)=5, \old(n)=10, \result=15, m=5, n=10, sum(n - 1, m + 1)=15] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=11, m=4, n=11, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); VAL [\old(m)=4, \old(n)=11, \result=15, m=4, n=11, sum(n - 1, m + 1)=15] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=12, m=3, n=12, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); VAL [\old(m)=3, \old(n)=12, \result=15, m=3, n=12, sum(n - 1, m + 1)=15] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=13, m=2, n=13, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); VAL [\old(m)=2, \old(n)=13, \result=15, m=2, n=13, sum(n - 1, m + 1)=15] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=14, m=1, n=14, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); VAL [\old(m)=1, \old(n)=14, \result=15, m=1, n=14, sum(n - 1, m + 1)=15] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=0, \old(n)=15, m=0, n=15, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); VAL [\old(m)=0, \old(n)=15, \result=15, m=0, n=15, sum(n - 1, m + 1)=15] [L14] RET, EXPR sum(a, b) VAL [a=15, b=0, sum(a, b)=15] [L14] int result = sum(a, b); VAL [a=15, b=0, result=15, sum(a, b)=15] [L15] COND TRUE result == a + b VAL [a=15, b=0, result=15] [L16] __VERIFIER_error() VAL [a=15, b=0, result=15] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 9.3s, OverallIterations: 16, TraceHistogramMax: 16, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 273 SDtfs, 632 SDslu, 1188 SDs, 0 SdLazy, 558 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s 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=95occurred 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.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 1368 NumberOfCodeBlocks, 1368 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1200 ConstructedInterpolants, 0 QuantifiedInterpolants, 310200 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 1 PerfectInterpolantSequences, 2135/4620 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...