/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_20x0-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 17:22:32,447 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 17:22:32,449 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 17:22:32,466 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 17:22:32,467 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 17:22:32,469 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 17:22:32,471 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 17:22:32,483 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 17:22:32,485 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 17:22:32,485 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 17:22:32,486 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 17:22:32,487 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 17:22:32,488 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 17:22:32,489 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 17:22:32,490 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 17:22:32,491 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 17:22:32,491 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 17:22:32,492 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 17:22:32,494 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 17:22:32,495 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 17:22:32,497 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 17:22:32,498 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 17:22:32,499 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 17:22:32,499 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 17:22:32,502 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 17:22:32,502 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 17:22:32,502 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 17:22:32,503 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 17:22:32,503 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 17:22:32,504 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 17:22:32,504 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 17:22:32,505 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 17:22:32,506 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 17:22:32,506 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 17:22:32,507 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 17:22:32,508 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 17:22:32,508 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 17:22:32,508 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 17:22:32,509 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 17:22:32,509 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 17:22:32,510 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 17:22:32,511 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-17 17:22:32,520 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 17:22:32,520 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 17:22:32,521 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 17:22:32,521 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 17:22:32,522 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 17:22:32,522 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 17:22:32,522 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 17:22:32,522 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 17:22:32,522 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 17:22:32,523 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 17:22:32,523 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 17:22:32,523 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 17:22:32,523 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 17:22:32,523 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 17:22:32,524 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 17:22:32,524 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-17 17:22:32,524 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 17:22:32,524 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 17:22:32,524 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 17:22:32,525 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 17:22:32,525 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-17 17:22:32,525 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 17:22:32,525 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-07-17 17:22:32,788 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 17:22:32,801 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 17:22:32,804 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 17:22:32,806 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 17:22:32,806 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 17:22:32,807 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/sum_20x0-1.c [2020-07-17 17:22:32,881 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a09104229/1510ec93478d4e99a01b128afb5ed3c7/FLAG4d2b6baa8 [2020-07-17 17:22:33,336 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 17:22:33,336 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/sum_20x0-1.c [2020-07-17 17:22:33,343 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a09104229/1510ec93478d4e99a01b128afb5ed3c7/FLAG4d2b6baa8 [2020-07-17 17:22:33,710 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a09104229/1510ec93478d4e99a01b128afb5ed3c7 [2020-07-17 17:22:33,720 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 17:22:33,723 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 17:22:33,724 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 17:22:33,724 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 17:22:33,727 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 17:22:33,728 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 05:22:33" (1/1) ... [2020-07-17 17:22:33,731 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15554a14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:22:33, skipping insertion in model container [2020-07-17 17:22:33,731 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 05:22:33" (1/1) ... [2020-07-17 17:22:33,739 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 17:22:33,757 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 17:22:33,904 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 17:22:33,908 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 17:22:33,923 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 17:22:33,938 INFO L208 MainTranslator]: Completed translation [2020-07-17 17:22:33,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:22:33 WrapperNode [2020-07-17 17:22:33,939 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 17:22:33,939 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 17:22:33,939 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 17:22:33,940 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 17:22:33,953 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:22:33" (1/1) ... [2020-07-17 17:22:33,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:22:33" (1/1) ... [2020-07-17 17:22:33,959 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:22:33" (1/1) ... [2020-07-17 17:22:33,959 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:22:33" (1/1) ... [2020-07-17 17:22:33,962 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:22:33" (1/1) ... [2020-07-17 17:22:33,964 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:22:33" (1/1) ... [2020-07-17 17:22:33,965 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:22:33" (1/1) ... [2020-07-17 17:22:33,966 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 17:22:33,967 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 17:22:33,967 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 17:22:33,967 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 17:22:33,968 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:22:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 17:22:34,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 17:22:34,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 17:22:34,118 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2020-07-17 17:22:34,118 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 17:22:34,118 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 17:22:34,118 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2020-07-17 17:22:34,118 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 17:22:34,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 17:22:34,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 17:22:34,284 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 17:22:34,284 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-17 17:22:34,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 05:22:34 BoogieIcfgContainer [2020-07-17 17:22:34,288 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 17:22:34,289 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 17:22:34,289 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 17:22:34,293 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 17:22:34,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 05:22:33" (1/3) ... [2020-07-17 17:22:34,294 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@238ee71e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 05:22:34, skipping insertion in model container [2020-07-17 17:22:34,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:22:33" (2/3) ... [2020-07-17 17:22:34,294 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@238ee71e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 05:22:34, skipping insertion in model container [2020-07-17 17:22:34,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 05:22:34" (3/3) ... [2020-07-17 17:22:34,296 INFO L109 eAbstractionObserver]: Analyzing ICFG sum_20x0-1.c [2020-07-17 17:22:34,306 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-17 17:22:34,313 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 17:22:34,327 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 17:22:34,347 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 17:22:34,347 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 17:22:34,347 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-17 17:22:34,347 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 17:22:34,347 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 17:22:34,348 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 17:22:34,348 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 17:22:34,348 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 17:22:34,362 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2020-07-17 17:22:34,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-17 17:22:34,373 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:34,374 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:22:34,374 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:34,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:34,380 INFO L82 PathProgramCache]: Analyzing trace with hash 989240825, now seen corresponding path program 1 times [2020-07-17 17:22:34,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:34,390 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1882612357] [2020-07-17 17:22:34,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:34,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:34,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:34,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:34,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 17:22:34,659 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1882612357] [2020-07-17 17:22:34,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 17:22:34,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 17:22:34,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977521449] [2020-07-17 17:22:34,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 17:22:34,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:34,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 17:22:34,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 17:22:34,694 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 5 states. [2020-07-17 17:22:34,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:34,792 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2020-07-17 17:22:34,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 17:22:34,794 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-17 17:22:34,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:34,805 INFO L225 Difference]: With dead ends: 39 [2020-07-17 17:22:34,805 INFO L226 Difference]: Without dead ends: 25 [2020-07-17 17:22:34,809 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-17 17:22:34,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-17 17:22:34,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-07-17 17:22:34,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-17 17:22:34,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2020-07-17 17:22:34,858 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 18 [2020-07-17 17:22:34,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:34,859 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2020-07-17 17:22:34,859 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 17:22:34,859 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2020-07-17 17:22:34,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-17 17:22:34,862 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:34,862 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-07-17 17:22:34,862 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 17:22:34,863 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:34,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:34,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1852726759, now seen corresponding path program 1 times [2020-07-17 17:22:34,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:34,864 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1446232440] [2020-07-17 17:22:34,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:34,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:34,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:34,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:34,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:35,015 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-17 17:22:35,016 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1446232440] [2020-07-17 17:22:35,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:22:35,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-07-17 17:22:35,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040683032] [2020-07-17 17:22:35,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 17:22:35,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:35,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 17:22:35,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-17 17:22:35,021 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 6 states. [2020-07-17 17:22:35,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:35,088 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2020-07-17 17:22:35,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 17:22:35,089 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-07-17 17:22:35,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:35,091 INFO L225 Difference]: With dead ends: 36 [2020-07-17 17:22:35,091 INFO L226 Difference]: Without dead ends: 30 [2020-07-17 17:22:35,093 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-07-17 17:22:35,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-17 17:22:35,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-17 17:22:35,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-17 17:22:35,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2020-07-17 17:22:35,104 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 27 [2020-07-17 17:22:35,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:35,105 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2020-07-17 17:22:35,105 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 17:22:35,105 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-07-17 17:22:35,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-07-17 17:22:35,107 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:35,107 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-07-17 17:22:35,107 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 17:22:35,108 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:35,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:35,108 INFO L82 PathProgramCache]: Analyzing trace with hash -175020829, now seen corresponding path program 2 times [2020-07-17 17:22:35,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:35,109 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [275405272] [2020-07-17 17:22:35,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:35,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:35,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:35,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:35,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:35,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:35,299 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-07-17 17:22:35,300 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [275405272] [2020-07-17 17:22:35,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:22:35,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-17 17:22:35,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999186295] [2020-07-17 17:22:35,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 17:22:35,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:35,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 17:22:35,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-17 17:22:35,303 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 7 states. [2020-07-17 17:22:35,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:35,420 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2020-07-17 17:22:35,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 17:22:35,421 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2020-07-17 17:22:35,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:35,422 INFO L225 Difference]: With dead ends: 41 [2020-07-17 17:22:35,422 INFO L226 Difference]: Without dead ends: 35 [2020-07-17 17:22:35,423 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-07-17 17:22:35,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-17 17:22:35,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-07-17 17:22:35,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-17 17:22:35,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2020-07-17 17:22:35,436 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 36 [2020-07-17 17:22:35,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:35,436 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2020-07-17 17:22:35,437 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 17:22:35,437 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2020-07-17 17:22:35,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-07-17 17:22:35,439 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:35,439 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-07-17 17:22:35,439 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-17 17:22:35,440 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:35,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:35,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1021564803, now seen corresponding path program 3 times [2020-07-17 17:22:35,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:35,441 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [571794763] [2020-07-17 17:22:35,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:35,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:35,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:35,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:35,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:35,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:35,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:35,700 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-07-17 17:22:35,700 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [571794763] [2020-07-17 17:22:35,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:22:35,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-17 17:22:35,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944334479] [2020-07-17 17:22:35,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-17 17:22:35,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:35,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-17 17:22:35,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-17 17:22:35,703 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 8 states. [2020-07-17 17:22:35,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:35,780 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2020-07-17 17:22:35,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-17 17:22:35,781 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2020-07-17 17:22:35,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:35,782 INFO L225 Difference]: With dead ends: 46 [2020-07-17 17:22:35,782 INFO L226 Difference]: Without dead ends: 40 [2020-07-17 17:22:35,783 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-07-17 17:22:35,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-17 17:22:35,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-07-17 17:22:35,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-17 17:22:35,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2020-07-17 17:22:35,793 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 45 [2020-07-17 17:22:35,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:35,794 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2020-07-17 17:22:35,794 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-17 17:22:35,794 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2020-07-17 17:22:35,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-07-17 17:22:35,796 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:35,796 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-07-17 17:22:35,796 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-17 17:22:35,797 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:35,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:35,797 INFO L82 PathProgramCache]: Analyzing trace with hash -263249715, now seen corresponding path program 4 times [2020-07-17 17:22:35,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:35,798 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1571097559] [2020-07-17 17:22:35,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:35,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:35,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:35,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:35,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:35,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:35,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:35,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:35,988 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-07-17 17:22:35,988 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1571097559] [2020-07-17 17:22:35,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:22:35,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-07-17 17:22:35,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244751200] [2020-07-17 17:22:35,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-17 17:22:35,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:35,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-17 17:22:35,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-07-17 17:22:35,991 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 9 states. [2020-07-17 17:22:36,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:36,076 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2020-07-17 17:22:36,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-17 17:22:36,077 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2020-07-17 17:22:36,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:36,078 INFO L225 Difference]: With dead ends: 51 [2020-07-17 17:22:36,079 INFO L226 Difference]: Without dead ends: 45 [2020-07-17 17:22:36,080 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2020-07-17 17:22:36,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-07-17 17:22:36,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-07-17 17:22:36,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-17 17:22:36,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2020-07-17 17:22:36,090 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 54 [2020-07-17 17:22:36,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:36,090 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2020-07-17 17:22:36,090 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-17 17:22:36,091 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2020-07-17 17:22:36,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-07-17 17:22:36,092 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:36,092 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-07-17 17:22:36,092 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-17 17:22:36,092 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:36,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:36,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1884999187, now seen corresponding path program 5 times [2020-07-17 17:22:36,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:36,093 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1150280779] [2020-07-17 17:22:36,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:36,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:36,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:36,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:36,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:36,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:36,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:36,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:36,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:36,381 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-07-17 17:22:36,382 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1150280779] [2020-07-17 17:22:36,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:22:36,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-07-17 17:22:36,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58318577] [2020-07-17 17:22:36,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-17 17:22:36,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:36,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-17 17:22:36,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-07-17 17:22:36,386 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 10 states. [2020-07-17 17:22:36,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:36,498 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2020-07-17 17:22:36,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-17 17:22:36,501 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2020-07-17 17:22:36,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:36,503 INFO L225 Difference]: With dead ends: 56 [2020-07-17 17:22:36,503 INFO L226 Difference]: Without dead ends: 50 [2020-07-17 17:22:36,507 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-07-17 17:22:36,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-07-17 17:22:36,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2020-07-17 17:22:36,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-07-17 17:22:36,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2020-07-17 17:22:36,525 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 63 [2020-07-17 17:22:36,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:36,525 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2020-07-17 17:22:36,526 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-17 17:22:36,526 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2020-07-17 17:22:36,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-07-17 17:22:36,530 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:36,531 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-07-17 17:22:36,531 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-17 17:22:36,532 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:36,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:36,533 INFO L82 PathProgramCache]: Analyzing trace with hash -441437769, now seen corresponding path program 6 times [2020-07-17 17:22:36,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:36,534 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [266980510] [2020-07-17 17:22:36,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:36,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:36,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:36,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:36,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:36,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:36,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:36,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:36,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:36,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:36,785 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-07-17 17:22:36,786 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [266980510] [2020-07-17 17:22:36,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:22:36,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-07-17 17:22:36,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586268817] [2020-07-17 17:22:36,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-17 17:22:36,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:36,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-17 17:22:36,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-07-17 17:22:36,790 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 11 states. [2020-07-17 17:22:36,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:36,928 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2020-07-17 17:22:36,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-17 17:22:36,928 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2020-07-17 17:22:36,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:36,934 INFO L225 Difference]: With dead ends: 61 [2020-07-17 17:22:36,934 INFO L226 Difference]: Without dead ends: 55 [2020-07-17 17:22:36,935 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-07-17 17:22:36,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-17 17:22:36,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2020-07-17 17:22:36,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-17 17:22:36,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2020-07-17 17:22:36,952 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 72 [2020-07-17 17:22:36,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:36,953 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2020-07-17 17:22:36,953 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-17 17:22:36,953 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2020-07-17 17:22:36,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-07-17 17:22:36,957 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:36,957 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-07-17 17:22:36,958 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-17 17:22:36,958 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:36,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:36,958 INFO L82 PathProgramCache]: Analyzing trace with hash 999943849, now seen corresponding path program 7 times [2020-07-17 17:22:36,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:36,960 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [310501482] [2020-07-17 17:22:36,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:36,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:37,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:37,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:37,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:37,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:37,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:37,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:37,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:37,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:37,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:37,227 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-07-17 17:22:37,228 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [310501482] [2020-07-17 17:22:37,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:22:37,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-07-17 17:22:37,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578559725] [2020-07-17 17:22:37,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-17 17:22:37,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:37,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-17 17:22:37,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-07-17 17:22:37,230 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 12 states. [2020-07-17 17:22:37,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:37,359 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2020-07-17 17:22:37,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-17 17:22:37,360 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 81 [2020-07-17 17:22:37,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:37,361 INFO L225 Difference]: With dead ends: 66 [2020-07-17 17:22:37,361 INFO L226 Difference]: Without dead ends: 60 [2020-07-17 17:22:37,362 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-07-17 17:22:37,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-07-17 17:22:37,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2020-07-17 17:22:37,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-07-17 17:22:37,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2020-07-17 17:22:37,371 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 81 [2020-07-17 17:22:37,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:37,372 INFO L479 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2020-07-17 17:22:37,372 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-17 17:22:37,372 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2020-07-17 17:22:37,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-07-17 17:22:37,376 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:37,376 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-07-17 17:22:37,376 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-17 17:22:37,376 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:37,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:37,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1356134305, now seen corresponding path program 8 times [2020-07-17 17:22:37,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:37,377 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1225350936] [2020-07-17 17:22:37,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:37,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:37,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:37,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:37,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:37,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:37,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:37,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:37,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:37,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:37,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:37,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:37,784 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-07-17 17:22:37,785 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1225350936] [2020-07-17 17:22:37,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:22:37,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-07-17 17:22:37,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111719076] [2020-07-17 17:22:37,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-17 17:22:37,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:37,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-17 17:22:37,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2020-07-17 17:22:37,791 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 13 states. [2020-07-17 17:22:37,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:37,925 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2020-07-17 17:22:37,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-17 17:22:37,926 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 90 [2020-07-17 17:22:37,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:37,927 INFO L225 Difference]: With dead ends: 71 [2020-07-17 17:22:37,927 INFO L226 Difference]: Without dead ends: 65 [2020-07-17 17:22:37,928 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2020-07-17 17:22:37,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-07-17 17:22:37,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2020-07-17 17:22:37,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-07-17 17:22:37,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2020-07-17 17:22:37,938 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 90 [2020-07-17 17:22:37,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:37,938 INFO L479 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2020-07-17 17:22:37,938 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-17 17:22:37,939 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2020-07-17 17:22:37,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-07-17 17:22:37,940 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:37,940 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-07-17 17:22:37,940 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-17 17:22:37,940 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:37,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:37,941 INFO L82 PathProgramCache]: Analyzing trace with hash -928437697, now seen corresponding path program 9 times [2020-07-17 17:22:37,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:37,941 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1676056662] [2020-07-17 17:22:37,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:37,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:37,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:37,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:38,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:38,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:38,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:38,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:38,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:38,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:38,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:38,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:38,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:38,250 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-07-17 17:22:38,251 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1676056662] [2020-07-17 17:22:38,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:22:38,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-07-17 17:22:38,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876492525] [2020-07-17 17:22:38,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-17 17:22:38,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:38,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-17 17:22:38,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2020-07-17 17:22:38,253 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 14 states. [2020-07-17 17:22:38,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:38,419 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2020-07-17 17:22:38,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-17 17:22:38,420 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 99 [2020-07-17 17:22:38,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:38,421 INFO L225 Difference]: With dead ends: 76 [2020-07-17 17:22:38,421 INFO L226 Difference]: Without dead ends: 70 [2020-07-17 17:22:38,423 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=200, Invalid=352, Unknown=0, NotChecked=0, Total=552 [2020-07-17 17:22:38,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-07-17 17:22:38,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-07-17 17:22:38,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-07-17 17:22:38,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2020-07-17 17:22:38,440 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 99 [2020-07-17 17:22:38,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:38,440 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2020-07-17 17:22:38,440 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-17 17:22:38,440 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2020-07-17 17:22:38,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-07-17 17:22:38,441 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:38,442 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-07-17 17:22:38,442 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-17 17:22:38,442 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:38,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:38,442 INFO L82 PathProgramCache]: Analyzing trace with hash -276966773, now seen corresponding path program 10 times [2020-07-17 17:22:38,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:38,443 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1264380893] [2020-07-17 17:22:38,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:38,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:38,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:38,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:38,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:38,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:38,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:38,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:38,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:38,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:38,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:38,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:38,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:38,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:38,822 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-07-17 17:22:38,822 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1264380893] [2020-07-17 17:22:38,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:22:38,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-07-17 17:22:38,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943447057] [2020-07-17 17:22:38,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-17 17:22:38,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:38,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-17 17:22:38,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2020-07-17 17:22:38,824 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 15 states. [2020-07-17 17:22:38,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:38,971 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2020-07-17 17:22:38,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-17 17:22:38,972 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 108 [2020-07-17 17:22:38,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:38,974 INFO L225 Difference]: With dead ends: 81 [2020-07-17 17:22:38,974 INFO L226 Difference]: Without dead ends: 75 [2020-07-17 17:22:38,975 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=236, Invalid=414, Unknown=0, NotChecked=0, Total=650 [2020-07-17 17:22:38,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-07-17 17:22:38,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2020-07-17 17:22:38,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-07-17 17:22:38,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2020-07-17 17:22:38,985 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 108 [2020-07-17 17:22:38,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:38,986 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2020-07-17 17:22:38,986 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-17 17:22:38,986 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2020-07-17 17:22:38,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-07-17 17:22:38,987 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:38,988 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-07-17 17:22:38,988 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-17 17:22:38,988 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:38,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:38,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1749540651, now seen corresponding path program 11 times [2020-07-17 17:22:38,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:38,989 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1201986074] [2020-07-17 17:22:38,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:39,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:39,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:39,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:39,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:39,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:39,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:39,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:39,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:39,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:39,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:39,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:39,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:39,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:39,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:39,472 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-07-17 17:22:39,473 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1201986074] [2020-07-17 17:22:39,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:22:39,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-07-17 17:22:39,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068695415] [2020-07-17 17:22:39,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-17 17:22:39,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:39,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-17 17:22:39,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2020-07-17 17:22:39,475 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 16 states. [2020-07-17 17:22:39,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:39,644 INFO L93 Difference]: Finished difference Result 86 states and 87 transitions. [2020-07-17 17:22:39,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-17 17:22:39,645 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 117 [2020-07-17 17:22:39,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:39,646 INFO L225 Difference]: With dead ends: 86 [2020-07-17 17:22:39,646 INFO L226 Difference]: Without dead ends: 80 [2020-07-17 17:22:39,647 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-07-17 17:22:39,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-07-17 17:22:39,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2020-07-17 17:22:39,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-07-17 17:22:39,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2020-07-17 17:22:39,657 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 117 [2020-07-17 17:22:39,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:39,657 INFO L479 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2020-07-17 17:22:39,657 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-17 17:22:39,657 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2020-07-17 17:22:39,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2020-07-17 17:22:39,659 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:39,659 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-07-17 17:22:39,659 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-17 17:22:39,659 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:39,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:39,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1141580405, now seen corresponding path program 12 times [2020-07-17 17:22:39,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:39,660 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1164841144] [2020-07-17 17:22:39,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:39,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:39,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:39,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:39,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:39,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:39,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:39,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:39,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:40,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:40,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:40,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:40,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:40,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:40,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:40,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:40,294 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-07-17 17:22:40,295 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1164841144] [2020-07-17 17:22:40,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:22:40,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-07-17 17:22:40,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720458814] [2020-07-17 17:22:40,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-17 17:22:40,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:40,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-17 17:22:40,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=163, Unknown=0, NotChecked=0, Total=272 [2020-07-17 17:22:40,298 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 17 states. [2020-07-17 17:22:40,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:40,485 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2020-07-17 17:22:40,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-17 17:22:40,486 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 126 [2020-07-17 17:22:40,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:40,487 INFO L225 Difference]: With dead ends: 91 [2020-07-17 17:22:40,487 INFO L226 Difference]: Without dead ends: 85 [2020-07-17 17:22:40,488 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-07-17 17:22:40,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-07-17 17:22:40,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2020-07-17 17:22:40,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-07-17 17:22:40,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2020-07-17 17:22:40,507 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 126 [2020-07-17 17:22:40,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:40,507 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2020-07-17 17:22:40,507 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-17 17:22:40,508 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2020-07-17 17:22:40,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-07-17 17:22:40,509 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:40,510 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-07-17 17:22:40,510 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-17 17:22:40,510 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:40,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:40,510 INFO L82 PathProgramCache]: Analyzing trace with hash 55997035, now seen corresponding path program 13 times [2020-07-17 17:22:40,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:40,513 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1002049682] [2020-07-17 17:22:40,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:40,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:40,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:40,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:40,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:40,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:40,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:40,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:40,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:40,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:40,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:40,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:40,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:40,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:40,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:41,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:41,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:41,144 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-07-17 17:22:41,144 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1002049682] [2020-07-17 17:22:41,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:22:41,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-07-17 17:22:41,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937679821] [2020-07-17 17:22:41,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-17 17:22:41,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:41,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-17 17:22:41,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=182, Unknown=0, NotChecked=0, Total=306 [2020-07-17 17:22:41,147 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 18 states. [2020-07-17 17:22:41,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:41,333 INFO L93 Difference]: Finished difference Result 96 states and 97 transitions. [2020-07-17 17:22:41,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-17 17:22:41,334 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 135 [2020-07-17 17:22:41,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:41,335 INFO L225 Difference]: With dead ends: 96 [2020-07-17 17:22:41,335 INFO L226 Difference]: Without dead ends: 90 [2020-07-17 17:22:41,337 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=362, Invalid=630, Unknown=0, NotChecked=0, Total=992 [2020-07-17 17:22:41,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-07-17 17:22:41,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2020-07-17 17:22:41,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-07-17 17:22:41,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2020-07-17 17:22:41,351 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 135 [2020-07-17 17:22:41,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:41,352 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2020-07-17 17:22:41,352 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-17 17:22:41,352 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2020-07-17 17:22:41,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-07-17 17:22:41,354 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:41,354 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-07-17 17:22:41,354 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-17 17:22:41,354 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:41,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:41,355 INFO L82 PathProgramCache]: Analyzing trace with hash 394086239, now seen corresponding path program 14 times [2020-07-17 17:22:41,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:41,355 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [206441655] [2020-07-17 17:22:41,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:41,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:41,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:41,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:41,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:41,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:41,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:41,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:41,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:41,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:41,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:41,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:41,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:41,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:41,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:41,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:41,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:41,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:41,973 INFO L134 CoverageAnalysis]: Checked inductivity of 889 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-07-17 17:22:41,974 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [206441655] [2020-07-17 17:22:41,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:22:41,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-07-17 17:22:41,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111692353] [2020-07-17 17:22:41,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-17 17:22:41,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:41,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-17 17:22:41,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=202, Unknown=0, NotChecked=0, Total=342 [2020-07-17 17:22:41,992 INFO L87 Difference]: Start difference. First operand 90 states and 91 transitions. Second operand 19 states. [2020-07-17 17:22:42,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:42,289 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2020-07-17 17:22:42,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-17 17:22:42,289 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 144 [2020-07-17 17:22:42,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:42,291 INFO L225 Difference]: With dead ends: 101 [2020-07-17 17:22:42,291 INFO L226 Difference]: Without dead ends: 95 [2020-07-17 17:22:42,296 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-07-17 17:22:42,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-07-17 17:22:42,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2020-07-17 17:22:42,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-07-17 17:22:42,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2020-07-17 17:22:42,312 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 144 [2020-07-17 17:22:42,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:42,315 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2020-07-17 17:22:42,315 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-17 17:22:42,316 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2020-07-17 17:22:42,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2020-07-17 17:22:42,319 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:42,319 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-07-17 17:22:42,319 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-17 17:22:42,320 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:42,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:42,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1047772929, now seen corresponding path program 15 times [2020-07-17 17:22:42,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:42,321 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1061171864] [2020-07-17 17:22:42,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:42,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:42,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:42,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:42,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:42,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:42,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:42,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:42,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:42,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:42,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:42,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:42,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:42,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:42,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:42,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:42,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:42,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:42,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:43,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1020 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-07-17 17:22:43,003 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1061171864] [2020-07-17 17:22:43,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:22:43,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-07-17 17:22:43,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639322372] [2020-07-17 17:22:43,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-07-17 17:22:43,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:43,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-07-17 17:22:43,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=223, Unknown=0, NotChecked=0, Total=380 [2020-07-17 17:22:43,006 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 20 states. [2020-07-17 17:22:43,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:43,246 INFO L93 Difference]: Finished difference Result 106 states and 107 transitions. [2020-07-17 17:22:43,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-07-17 17:22:43,246 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 153 [2020-07-17 17:22:43,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:43,248 INFO L225 Difference]: With dead ends: 106 [2020-07-17 17:22:43,248 INFO L226 Difference]: Without dead ends: 100 [2020-07-17 17:22:43,249 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=461, Invalid=799, Unknown=0, NotChecked=0, Total=1260 [2020-07-17 17:22:43,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2020-07-17 17:22:43,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2020-07-17 17:22:43,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-07-17 17:22:43,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2020-07-17 17:22:43,257 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 153 [2020-07-17 17:22:43,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:43,258 INFO L479 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2020-07-17 17:22:43,258 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-07-17 17:22:43,258 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2020-07-17 17:22:43,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2020-07-17 17:22:43,260 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:43,260 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:22:43,260 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-17 17:22:43,260 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:43,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:43,261 INFO L82 PathProgramCache]: Analyzing trace with hash -76242615, now seen corresponding path program 16 times [2020-07-17 17:22:43,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:43,261 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1579961879] [2020-07-17 17:22:43,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:43,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:43,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:43,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:43,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:43,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:43,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:43,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:43,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:43,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:43,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:43,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:43,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:43,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:43,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:43,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:43,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:43,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:43,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:43,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:44,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1160 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2020-07-17 17:22:44,173 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1579961879] [2020-07-17 17:22:44,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:22:44,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2020-07-17 17:22:44,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455807638] [2020-07-17 17:22:44,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-17 17:22:44,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:44,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-17 17:22:44,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=245, Unknown=0, NotChecked=0, Total=420 [2020-07-17 17:22:44,177 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand 21 states. [2020-07-17 17:22:44,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:44,529 INFO L93 Difference]: Finished difference Result 111 states and 112 transitions. [2020-07-17 17:22:44,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-07-17 17:22:44,530 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 162 [2020-07-17 17:22:44,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:44,532 INFO L225 Difference]: With dead ends: 111 [2020-07-17 17:22:44,532 INFO L226 Difference]: Without dead ends: 105 [2020-07-17 17:22:44,539 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=515, Invalid=891, Unknown=0, NotChecked=0, Total=1406 [2020-07-17 17:22:44,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-07-17 17:22:44,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2020-07-17 17:22:44,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-07-17 17:22:44,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2020-07-17 17:22:44,558 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 162 [2020-07-17 17:22:44,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:44,559 INFO L479 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2020-07-17 17:22:44,559 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-17 17:22:44,559 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2020-07-17 17:22:44,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-07-17 17:22:44,564 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:44,565 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:22:44,565 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-07-17 17:22:44,565 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:44,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:44,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1382000279, now seen corresponding path program 17 times [2020-07-17 17:22:44,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:44,566 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1370090295] [2020-07-17 17:22:44,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:44,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:44,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:44,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:44,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:44,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:44,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:44,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:44,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:44,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:44,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:45,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:45,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:45,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:45,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:45,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:45,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:45,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:45,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:45,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:45,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:45,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1309 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2020-07-17 17:22:45,567 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1370090295] [2020-07-17 17:22:45,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:22:45,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2020-07-17 17:22:45,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418471428] [2020-07-17 17:22:45,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-07-17 17:22:45,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:45,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-07-17 17:22:45,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=268, Unknown=0, NotChecked=0, Total=462 [2020-07-17 17:22:45,569 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 22 states. [2020-07-17 17:22:45,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:45,817 INFO L93 Difference]: Finished difference Result 116 states and 117 transitions. [2020-07-17 17:22:45,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-07-17 17:22:45,818 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 171 [2020-07-17 17:22:45,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:45,819 INFO L225 Difference]: With dead ends: 116 [2020-07-17 17:22:45,819 INFO L226 Difference]: Without dead ends: 110 [2020-07-17 17:22:45,821 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=572, Invalid=988, Unknown=0, NotChecked=0, Total=1560 [2020-07-17 17:22:45,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-07-17 17:22:45,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2020-07-17 17:22:45,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-07-17 17:22:45,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 111 transitions. [2020-07-17 17:22:45,832 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 111 transitions. Word has length 171 [2020-07-17 17:22:45,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:45,832 INFO L479 AbstractCegarLoop]: Abstraction has 110 states and 111 transitions. [2020-07-17 17:22:45,832 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-07-17 17:22:45,833 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2020-07-17 17:22:45,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2020-07-17 17:22:45,834 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:45,835 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:22:45,835 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-07-17 17:22:45,835 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:45,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:45,835 INFO L82 PathProgramCache]: Analyzing trace with hash -869167053, now seen corresponding path program 18 times [2020-07-17 17:22:45,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:45,837 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [593037682] [2020-07-17 17:22:45,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:45,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:45,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:45,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:45,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:46,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:46,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:46,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:46,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:46,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:46,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:46,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:46,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:46,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:46,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:46,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:46,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:46,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:46,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:46,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:46,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:46,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:46,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1467 backedges. 0 proven. 801 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2020-07-17 17:22:46,866 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [593037682] [2020-07-17 17:22:46,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:22:46,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2020-07-17 17:22:46,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127239586] [2020-07-17 17:22:46,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-07-17 17:22:46,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:46,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-07-17 17:22:46,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=292, Unknown=0, NotChecked=0, Total=506 [2020-07-17 17:22:46,868 INFO L87 Difference]: Start difference. First operand 110 states and 111 transitions. Second operand 23 states. [2020-07-17 17:22:47,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:47,162 INFO L93 Difference]: Finished difference Result 121 states and 122 transitions. [2020-07-17 17:22:47,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-07-17 17:22:47,162 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 180 [2020-07-17 17:22:47,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:47,164 INFO L225 Difference]: With dead ends: 121 [2020-07-17 17:22:47,164 INFO L226 Difference]: Without dead ends: 115 [2020-07-17 17:22:47,165 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=632, Invalid=1090, Unknown=0, NotChecked=0, Total=1722 [2020-07-17 17:22:47,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2020-07-17 17:22:47,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2020-07-17 17:22:47,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-07-17 17:22:47,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2020-07-17 17:22:47,173 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 180 [2020-07-17 17:22:47,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:47,174 INFO L479 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2020-07-17 17:22:47,174 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-07-17 17:22:47,174 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2020-07-17 17:22:47,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2020-07-17 17:22:47,176 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:47,176 INFO L422 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:22:47,176 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-07-17 17:22:47,177 INFO L427 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:47,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:47,177 INFO L82 PathProgramCache]: Analyzing trace with hash 482986285, now seen corresponding path program 19 times [2020-07-17 17:22:47,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:47,177 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1853551533] [2020-07-17 17:22:47,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:47,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:47,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:47,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:47,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:47,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:47,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:47,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:47,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:47,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:47,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:47,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:47,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:47,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:47,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:47,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:47,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:47,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:47,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:47,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:47,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:47,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:48,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:48,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1634 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2020-07-17 17:22:48,297 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1853551533] [2020-07-17 17:22:48,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:22:48,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2020-07-17 17:22:48,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772282471] [2020-07-17 17:22:48,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-07-17 17:22:48,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:48,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-07-17 17:22:48,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=317, Unknown=0, NotChecked=0, Total=552 [2020-07-17 17:22:48,300 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 24 states. [2020-07-17 17:22:48,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:48,646 INFO L93 Difference]: Finished difference Result 126 states and 127 transitions. [2020-07-17 17:22:48,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-07-17 17:22:48,646 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 189 [2020-07-17 17:22:48,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:48,648 INFO L225 Difference]: With dead ends: 126 [2020-07-17 17:22:48,648 INFO L226 Difference]: Without dead ends: 120 [2020-07-17 17:22:48,649 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=695, Invalid=1197, Unknown=0, NotChecked=0, Total=1892 [2020-07-17 17:22:48,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-07-17 17:22:48,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2020-07-17 17:22:48,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-07-17 17:22:48,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 121 transitions. [2020-07-17 17:22:48,657 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 121 transitions. Word has length 189 [2020-07-17 17:22:48,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:48,658 INFO L479 AbstractCegarLoop]: Abstraction has 120 states and 121 transitions. [2020-07-17 17:22:48,658 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-07-17 17:22:48,658 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2020-07-17 17:22:48,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2020-07-17 17:22:48,660 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:48,660 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:22:48,661 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-07-17 17:22:48,661 INFO L427 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:48,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:48,661 INFO L82 PathProgramCache]: Analyzing trace with hash 848589853, now seen corresponding path program 20 times [2020-07-17 17:22:48,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:48,662 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2035340483] [2020-07-17 17:22:48,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:48,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 17:22:48,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 17:22:48,752 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-17 17:22:48,753 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-17 17:22:48,753 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-07-17 17:22:48,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 05:22:48 BoogieIcfgContainer [2020-07-17 17:22:48,813 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 17:22:48,816 INFO L168 Benchmark]: Toolchain (without parser) took 15093.22 ms. Allocated memory was 145.8 MB in the beginning and 557.8 MB in the end (delta: 412.1 MB). Free memory was 104.5 MB in the beginning and 147.1 MB in the end (delta: -42.6 MB). Peak memory consumption was 369.5 MB. Max. memory is 7.1 GB. [2020-07-17 17:22:48,816 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 145.8 MB. Free memory was 122.3 MB in the beginning and 122.0 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-17 17:22:48,817 INFO L168 Benchmark]: CACSL2BoogieTranslator took 215.05 ms. Allocated memory is still 145.8 MB. Free memory was 104.0 MB in the beginning and 94.9 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2020-07-17 17:22:48,818 INFO L168 Benchmark]: Boogie Preprocessor took 27.15 ms. Allocated memory is still 145.8 MB. Free memory was 94.9 MB in the beginning and 93.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-17 17:22:48,819 INFO L168 Benchmark]: RCFGBuilder took 321.51 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 93.5 MB in the beginning and 171.9 MB in the end (delta: -78.4 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2020-07-17 17:22:48,819 INFO L168 Benchmark]: TraceAbstraction took 14523.66 ms. Allocated memory was 203.4 MB in the beginning and 557.8 MB in the end (delta: 354.4 MB). Free memory was 171.2 MB in the beginning and 147.1 MB in the end (delta: 24.1 MB). Peak memory consumption was 378.6 MB. Max. memory is 7.1 GB. [2020-07-17 17:22:48,827 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.25 ms. Allocated memory is still 145.8 MB. Free memory was 122.3 MB in the beginning and 122.0 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 215.05 ms. Allocated memory is still 145.8 MB. Free memory was 104.0 MB in the beginning and 94.9 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 27.15 ms. Allocated memory is still 145.8 MB. Free memory was 94.9 MB in the beginning and 93.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 321.51 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 93.5 MB in the beginning and 171.9 MB in the end (delta: -78.4 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14523.66 ms. Allocated memory was 203.4 MB in the beginning and 557.8 MB in the end (delta: 354.4 MB). Free memory was 171.2 MB in the beginning and 147.1 MB in the end (delta: 24.1 MB). Peak memory consumption was 378.6 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 = 20; VAL [a=20] [L13] int b = 0; VAL [a=20, b=0] [L14] CALL, EXPR sum(a, b) VAL [\old(m)=0, \old(n)=20] [L4] COND FALSE !(n <= 0) VAL [\old(m)=0, \old(n)=20, m=0, n=20] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=19] [L4] COND FALSE !(n <= 0) VAL [\old(m)=1, \old(n)=19, m=1, n=19] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=18] [L4] COND FALSE !(n <= 0) VAL [\old(m)=2, \old(n)=18, m=2, n=18] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=17] [L4] COND FALSE !(n <= 0) VAL [\old(m)=3, \old(n)=17, m=3, n=17] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=16] [L4] COND FALSE !(n <= 0) VAL [\old(m)=4, \old(n)=16, m=4, n=16] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=15] [L4] COND FALSE !(n <= 0) VAL [\old(m)=5, \old(n)=15, m=5, n=15] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=14] [L4] COND FALSE !(n <= 0) VAL [\old(m)=6, \old(n)=14, m=6, n=14] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=13] [L4] COND FALSE !(n <= 0) VAL [\old(m)=7, \old(n)=13, m=7, n=13] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=12] [L4] COND FALSE !(n <= 0) VAL [\old(m)=8, \old(n)=12, m=8, n=12] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=11] [L4] COND FALSE !(n <= 0) VAL [\old(m)=9, \old(n)=11, m=9, n=11] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=10] [L4] COND FALSE !(n <= 0) VAL [\old(m)=10, \old(n)=10, m=10, n=10] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=9] [L4] COND FALSE !(n <= 0) VAL [\old(m)=11, \old(n)=9, m=11, n=9] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=8] [L4] COND FALSE !(n <= 0) VAL [\old(m)=12, \old(n)=8, m=12, n=8] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=7] [L4] COND FALSE !(n <= 0) VAL [\old(m)=13, \old(n)=7, m=13, n=7] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=6] [L4] COND FALSE !(n <= 0) VAL [\old(m)=14, \old(n)=6, m=14, n=6] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=15, \old(n)=5] [L4] COND FALSE !(n <= 0) VAL [\old(m)=15, \old(n)=5, m=15, n=5] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=16, \old(n)=4] [L4] COND FALSE !(n <= 0) VAL [\old(m)=16, \old(n)=4, m=16, n=4] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=17, \old(n)=3] [L4] COND FALSE !(n <= 0) VAL [\old(m)=17, \old(n)=3, m=17, n=3] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=18, \old(n)=2] [L4] COND FALSE !(n <= 0) VAL [\old(m)=18, \old(n)=2, m=18, n=2] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=19, \old(n)=1] [L4] COND FALSE !(n <= 0) VAL [\old(m)=19, \old(n)=1, m=19, n=1] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=20, \old(n)=0] [L4] COND TRUE n <= 0 VAL [\old(m)=20, \old(n)=0, m=20, n=0] [L5] return m + n; VAL [\old(m)=20, \old(n)=0, \result=20, m=20, n=0] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=19, \old(n)=1, m=19, n=1, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); VAL [\old(m)=19, \old(n)=1, \result=20, m=19, n=1, sum(n - 1, m + 1)=20] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=18, \old(n)=2, m=18, n=2, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); VAL [\old(m)=18, \old(n)=2, \result=20, m=18, n=2, sum(n - 1, m + 1)=20] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=17, \old(n)=3, m=17, n=3, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); VAL [\old(m)=17, \old(n)=3, \result=20, m=17, n=3, sum(n - 1, m + 1)=20] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=16, \old(n)=4, m=16, n=4, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); VAL [\old(m)=16, \old(n)=4, \result=20, m=16, n=4, sum(n - 1, m + 1)=20] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=15, \old(n)=5, m=15, n=5, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); VAL [\old(m)=15, \old(n)=5, \result=20, m=15, n=5, sum(n - 1, m + 1)=20] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=6, m=14, n=6, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); VAL [\old(m)=14, \old(n)=6, \result=20, m=14, n=6, sum(n - 1, m + 1)=20] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=7, m=13, n=7, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); VAL [\old(m)=13, \old(n)=7, \result=20, m=13, n=7, sum(n - 1, m + 1)=20] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=8, m=12, n=8, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); VAL [\old(m)=12, \old(n)=8, \result=20, m=12, n=8, sum(n - 1, m + 1)=20] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=9, m=11, n=9, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); VAL [\old(m)=11, \old(n)=9, \result=20, m=11, n=9, sum(n - 1, m + 1)=20] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=10, m=10, n=10, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); VAL [\old(m)=10, \old(n)=10, \result=20, m=10, n=10, sum(n - 1, m + 1)=20] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=11, m=9, n=11, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); VAL [\old(m)=9, \old(n)=11, \result=20, m=9, n=11, sum(n - 1, m + 1)=20] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=12, m=8, n=12, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); VAL [\old(m)=8, \old(n)=12, \result=20, m=8, n=12, sum(n - 1, m + 1)=20] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=13, m=7, n=13, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); VAL [\old(m)=7, \old(n)=13, \result=20, m=7, n=13, sum(n - 1, m + 1)=20] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=14, m=6, n=14, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); VAL [\old(m)=6, \old(n)=14, \result=20, m=6, n=14, sum(n - 1, m + 1)=20] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=15, m=5, n=15, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); VAL [\old(m)=5, \old(n)=15, \result=20, m=5, n=15, sum(n - 1, m + 1)=20] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=16, m=4, n=16, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); VAL [\old(m)=4, \old(n)=16, \result=20, m=4, n=16, sum(n - 1, m + 1)=20] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=17, m=3, n=17, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); VAL [\old(m)=3, \old(n)=17, \result=20, m=3, n=17, sum(n - 1, m + 1)=20] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=18, m=2, n=18, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); VAL [\old(m)=2, \old(n)=18, \result=20, m=2, n=18, sum(n - 1, m + 1)=20] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=19, m=1, n=19, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); VAL [\old(m)=1, \old(n)=19, \result=20, m=1, n=19, sum(n - 1, m + 1)=20] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=0, \old(n)=20, m=0, n=20, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); VAL [\old(m)=0, \old(n)=20, \result=20, m=0, n=20, sum(n - 1, m + 1)=20] [L14] RET, EXPR sum(a, b) VAL [a=20, b=0, sum(a, b)=20] [L14] int result = sum(a, b); VAL [a=20, b=0, result=20, sum(a, b)=20] [L15] COND TRUE result == a + b VAL [a=20, b=0, result=20] [L16] __VERIFIER_error() VAL [a=20, b=0, result=20] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 14.4s, OverallIterations: 21, TraceHistogramMax: 21, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 363 SDtfs, 1043 SDslu, 1851 SDs, 0 SdLazy, 831 SolverSat, 40 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 940 GetRequests, 480 SyntacticMatches, 0 SemanticMatches, 460 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2470 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 9.2s InterpolantComputationTime, 2268 NumberOfCodeBlocks, 2268 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 2050 ConstructedInterpolants, 0 QuantifiedInterpolants, 700050 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 1 PerfectInterpolantSequences, 5130/11210 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...