/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 -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_5-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 16:26:36,333 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 16:26:36,337 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 16:26:36,363 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 16:26:36,364 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 16:26:36,365 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 16:26:36,366 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 16:26:36,368 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 16:26:36,370 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 16:26:36,370 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 16:26:36,371 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 16:26:36,373 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 16:26:36,373 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 16:26:36,374 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 16:26:36,375 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 16:26:36,376 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 16:26:36,377 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 16:26:36,378 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 16:26:36,380 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 16:26:36,382 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 16:26:36,384 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 16:26:36,385 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 16:26:36,387 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 16:26:36,388 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 16:26:36,390 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 16:26:36,391 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 16:26:36,391 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 16:26:36,392 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 16:26:36,392 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 16:26:36,393 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 16:26:36,394 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 16:26:36,395 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 16:26:36,396 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 16:26:36,397 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 16:26:36,398 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 16:26:36,398 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 16:26:36,399 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 16:26:36,399 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 16:26:36,399 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 16:26:36,400 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 16:26:36,401 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 16:26:36,402 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-09-04 16:26:36,414 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 16:26:36,414 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 16:26:36,416 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 16:26:36,416 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 16:26:36,416 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 16:26:36,417 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 16:26:36,417 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 16:26:36,417 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 16:26:36,417 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 16:26:36,417 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 16:26:36,418 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 16:26:36,418 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 16:26:36,418 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 16:26:36,418 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 16:26:36,418 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 16:26:36,419 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 16:26:36,419 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 16:26:36,419 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 16:26:36,419 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 16:26:36,420 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 16:26:36,420 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 16:26:36,420 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 16:26:36,420 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-09-04 16:26:36,864 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 16:26:36,890 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 16:26:36,897 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 16:26:36,899 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 16:26:36,900 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 16:26:36,901 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_5-1.c [2020-09-04 16:26:36,990 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/e72a07e70/be2ed25560f5466fb455a55ca29d262c/FLAG793965ca6 [2020-09-04 16:26:37,617 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 16:26:37,618 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/fibo_2calls_5-1.c [2020-09-04 16:26:37,630 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/e72a07e70/be2ed25560f5466fb455a55ca29d262c/FLAG793965ca6 [2020-09-04 16:26:37,863 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/e72a07e70/be2ed25560f5466fb455a55ca29d262c [2020-09-04 16:26:37,877 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 16:26:37,880 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 16:26:37,881 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 16:26:37,881 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 16:26:37,886 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 16:26:37,888 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 04:26:37" (1/1) ... [2020-09-04 16:26:37,893 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@674884e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:26:37, skipping insertion in model container [2020-09-04 16:26:37,893 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 04:26:37" (1/1) ... [2020-09-04 16:26:37,903 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 16:26:37,933 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 16:26:38,174 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 16:26:38,181 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 16:26:38,200 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 16:26:38,220 INFO L208 MainTranslator]: Completed translation [2020-09-04 16:26:38,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:26:38 WrapperNode [2020-09-04 16:26:38,221 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 16:26:38,222 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 16:26:38,222 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 16:26:38,223 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 16:26:38,241 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:26:38" (1/1) ... [2020-09-04 16:26:38,242 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:26:38" (1/1) ... [2020-09-04 16:26:38,248 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:26:38" (1/1) ... [2020-09-04 16:26:38,248 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:26:38" (1/1) ... [2020-09-04 16:26:38,339 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:26:38" (1/1) ... [2020-09-04 16:26:38,343 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:26:38" (1/1) ... [2020-09-04 16:26:38,349 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:26:38" (1/1) ... [2020-09-04 16:26:38,356 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 16:26:38,357 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 16:26:38,357 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 16:26:38,357 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 16:26:38,359 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:26:38" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 16:26:38,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 16:26:38,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 16:26:38,452 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-09-04 16:26:38,452 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-09-04 16:26:38,452 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 16:26:38,452 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 16:26:38,453 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 16:26:38,453 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-09-04 16:26:38,453 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-09-04 16:26:38,453 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 16:26:38,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 16:26:38,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 16:26:38,711 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 16:26:38,711 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-04 16:26:38,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 04:26:38 BoogieIcfgContainer [2020-09-04 16:26:38,718 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 16:26:38,734 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 16:26:38,734 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 16:26:38,749 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 16:26:38,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 04:26:37" (1/3) ... [2020-09-04 16:26:38,754 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@559822fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 04:26:38, skipping insertion in model container [2020-09-04 16:26:38,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:26:38" (2/3) ... [2020-09-04 16:26:38,755 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@559822fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 04:26:38, skipping insertion in model container [2020-09-04 16:26:38,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 04:26:38" (3/3) ... [2020-09-04 16:26:38,764 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_5-1.c [2020-09-04 16:26:38,795 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 16:26:38,822 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 16:26:38,868 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 16:26:38,895 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 16:26:38,895 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 16:26:38,895 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-09-04 16:26:38,895 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 16:26:38,895 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 16:26:38,896 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 16:26:38,896 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 16:26:38,896 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 16:26:38,914 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2020-09-04 16:26:38,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-09-04 16:26:38,927 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:26:38,928 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:26:38,929 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:26:38,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:26:38,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1089710179, now seen corresponding path program 1 times [2020-09-04 16:26:38,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:26:38,949 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1334950315] [2020-09-04 16:26:38,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:26:39,021 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:26:39,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:39,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:26:39,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:39,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:26:39,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:39,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 16:26:39,218 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1334950315] [2020-09-04 16:26:39,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:26:39,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 16:26:39,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052331061] [2020-09-04 16:26:39,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 16:26:39,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:26:39,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 16:26:39,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 16:26:39,258 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 5 states. [2020-09-04 16:26:39,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:26:39,439 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2020-09-04 16:26:39,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 16:26:39,442 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-09-04 16:26:39,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:26:39,458 INFO L225 Difference]: With dead ends: 58 [2020-09-04 16:26:39,458 INFO L226 Difference]: Without dead ends: 42 [2020-09-04 16:26:39,464 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-04 16:26:39,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-09-04 16:26:39,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-09-04 16:26:39,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-09-04 16:26:39,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2020-09-04 16:26:39,528 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 16 [2020-09-04 16:26:39,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:26:39,528 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2020-09-04 16:26:39,529 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 16:26:39,529 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2020-09-04 16:26:39,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-09-04 16:26:39,532 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:26:39,532 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:26:39,533 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 16:26:39,533 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:26:39,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:26:39,534 INFO L82 PathProgramCache]: Analyzing trace with hash -653728005, now seen corresponding path program 1 times [2020-09-04 16:26:39,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:26:39,535 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [99563957] [2020-09-04 16:26:39,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:26:39,538 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:26:39,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:39,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:26:39,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:39,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:26:39,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:39,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 16:26:39,620 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [99563957] [2020-09-04 16:26:39,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:26:39,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 16:26:39,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321606281] [2020-09-04 16:26:39,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 16:26:39,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:26:39,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 16:26:39,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 16:26:39,624 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 5 states. [2020-09-04 16:26:39,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:26:39,721 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2020-09-04 16:26:39,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 16:26:39,724 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-09-04 16:26:39,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:26:39,726 INFO L225 Difference]: With dead ends: 50 [2020-09-04 16:26:39,726 INFO L226 Difference]: Without dead ends: 44 [2020-09-04 16:26:39,731 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-04 16:26:39,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-09-04 16:26:39,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2020-09-04 16:26:39,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-09-04 16:26:39,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2020-09-04 16:26:39,761 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 17 [2020-09-04 16:26:39,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:26:39,762 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2020-09-04 16:26:39,762 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 16:26:39,762 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2020-09-04 16:26:39,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-09-04 16:26:39,765 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:26:39,765 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:26:39,765 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 16:26:39,766 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:26:39,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:26:39,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1617834856, now seen corresponding path program 1 times [2020-09-04 16:26:39,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:26:39,767 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [352896033] [2020-09-04 16:26:39,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:26:39,770 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:26:39,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:39,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:26:39,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:39,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:26:39,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:39,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:39,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:39,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 16:26:39,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:39,937 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 16:26:39,938 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [352896033] [2020-09-04 16:26:39,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:26:39,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 16:26:39,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270303249] [2020-09-04 16:26:39,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 16:26:39,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:26:39,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 16:26:39,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-09-04 16:26:39,943 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 7 states. [2020-09-04 16:26:40,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:26:40,096 INFO L93 Difference]: Finished difference Result 82 states and 102 transitions. [2020-09-04 16:26:40,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 16:26:40,097 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-09-04 16:26:40,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:26:40,099 INFO L225 Difference]: With dead ends: 82 [2020-09-04 16:26:40,099 INFO L226 Difference]: Without dead ends: 46 [2020-09-04 16:26:40,101 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-09-04 16:26:40,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-09-04 16:26:40,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2020-09-04 16:26:40,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-09-04 16:26:40,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2020-09-04 16:26:40,119 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 33 [2020-09-04 16:26:40,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:26:40,120 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2020-09-04 16:26:40,120 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 16:26:40,120 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2020-09-04 16:26:40,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-09-04 16:26:40,122 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:26:40,123 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:26:40,123 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 16:26:40,123 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:26:40,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:26:40,124 INFO L82 PathProgramCache]: Analyzing trace with hash 887160861, now seen corresponding path program 1 times [2020-09-04 16:26:40,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:26:40,125 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [761281207] [2020-09-04 16:26:40,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:26:40,128 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:26:40,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:40,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:26:40,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:40,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:26:40,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:40,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:40,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:40,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:26:40,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:40,268 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 16:26:40,270 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [761281207] [2020-09-04 16:26:40,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:26:40,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 16:26:40,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808759149] [2020-09-04 16:26:40,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 16:26:40,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:26:40,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 16:26:40,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-09-04 16:26:40,274 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 7 states. [2020-09-04 16:26:40,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:26:40,576 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2020-09-04 16:26:40,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 16:26:40,576 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2020-09-04 16:26:40,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:26:40,579 INFO L225 Difference]: With dead ends: 74 [2020-09-04 16:26:40,579 INFO L226 Difference]: Without dead ends: 68 [2020-09-04 16:26:40,580 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-09-04 16:26:40,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-09-04 16:26:40,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2020-09-04 16:26:40,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-09-04 16:26:40,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 83 transitions. [2020-09-04 16:26:40,609 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 83 transitions. Word has length 34 [2020-09-04 16:26:40,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:26:40,609 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 83 transitions. [2020-09-04 16:26:40,610 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 16:26:40,610 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 83 transitions. [2020-09-04 16:26:40,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-09-04 16:26:40,617 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:26:40,617 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:26:40,617 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 16:26:40,620 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:26:40,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:26:40,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1875452576, now seen corresponding path program 1 times [2020-09-04 16:26:40,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:26:40,621 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [315183352] [2020-09-04 16:26:40,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:26:40,647 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:26:40,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:40,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:26:40,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:40,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:26:40,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:40,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:40,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:40,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:40,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:40,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 16:26:40,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:40,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 16:26:40,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:40,809 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-09-04 16:26:40,810 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [315183352] [2020-09-04 16:26:40,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:26:40,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 16:26:40,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466120346] [2020-09-04 16:26:40,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 16:26:40,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:26:40,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 16:26:40,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-04 16:26:40,812 INFO L87 Difference]: Start difference. First operand 66 states and 83 transitions. Second operand 6 states. [2020-09-04 16:26:40,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:26:40,904 INFO L93 Difference]: Finished difference Result 130 states and 178 transitions. [2020-09-04 16:26:40,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 16:26:40,905 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2020-09-04 16:26:40,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:26:40,907 INFO L225 Difference]: With dead ends: 130 [2020-09-04 16:26:40,907 INFO L226 Difference]: Without dead ends: 70 [2020-09-04 16:26:40,909 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-04 16:26:40,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-09-04 16:26:40,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-09-04 16:26:40,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-09-04 16:26:40,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 89 transitions. [2020-09-04 16:26:40,926 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 89 transitions. Word has length 50 [2020-09-04 16:26:40,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:26:40,927 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 89 transitions. [2020-09-04 16:26:40,927 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 16:26:40,927 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 89 transitions. [2020-09-04 16:26:40,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-09-04 16:26:40,930 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:26:40,930 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:26:40,931 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 16:26:40,931 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:26:40,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:26:40,932 INFO L82 PathProgramCache]: Analyzing trace with hash 104828256, now seen corresponding path program 1 times [2020-09-04 16:26:40,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:26:40,932 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [188730181] [2020-09-04 16:26:40,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:26:40,938 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:26:40,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:40,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:26:40,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:40,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:26:40,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:41,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:41,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:41,080 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:41,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:41,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:26:41,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:41,094 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:26:41,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:41,114 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-09-04 16:26:41,114 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [188730181] [2020-09-04 16:26:41,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:26:41,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-04 16:26:41,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654351542] [2020-09-04 16:26:41,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 16:26:41,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:26:41,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 16:26:41,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-09-04 16:26:41,117 INFO L87 Difference]: Start difference. First operand 70 states and 89 transitions. Second operand 8 states. [2020-09-04 16:26:41,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:26:41,259 INFO L93 Difference]: Finished difference Result 142 states and 197 transitions. [2020-09-04 16:26:41,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 16:26:41,260 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2020-09-04 16:26:41,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:26:41,263 INFO L225 Difference]: With dead ends: 142 [2020-09-04 16:26:41,266 INFO L226 Difference]: Without dead ends: 78 [2020-09-04 16:26:41,268 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-09-04 16:26:41,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-09-04 16:26:41,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 72. [2020-09-04 16:26:41,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-09-04 16:26:41,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 92 transitions. [2020-09-04 16:26:41,314 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 92 transitions. Word has length 51 [2020-09-04 16:26:41,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:26:41,315 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 92 transitions. [2020-09-04 16:26:41,316 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 16:26:41,316 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 92 transitions. [2020-09-04 16:26:41,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-09-04 16:26:41,329 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:26:41,329 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:26:41,330 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 16:26:41,330 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:26:41,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:26:41,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1703786405, now seen corresponding path program 1 times [2020-09-04 16:26:41,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:26:41,332 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [894635909] [2020-09-04 16:26:41,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:26:41,342 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:26:41,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:41,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:26:41,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:41,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:26:41,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:41,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:41,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:41,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:41,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:41,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:26:41,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:41,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:26:41,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:41,618 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-09-04 16:26:41,620 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [894635909] [2020-09-04 16:26:41,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:26:41,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-04 16:26:41,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797025897] [2020-09-04 16:26:41,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 16:26:41,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:26:41,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 16:26:41,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-09-04 16:26:41,624 INFO L87 Difference]: Start difference. First operand 72 states and 92 transitions. Second operand 8 states. [2020-09-04 16:26:41,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:26:41,872 INFO L93 Difference]: Finished difference Result 118 states and 158 transitions. [2020-09-04 16:26:41,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 16:26:41,873 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2020-09-04 16:26:41,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:26:41,878 INFO L225 Difference]: With dead ends: 118 [2020-09-04 16:26:41,879 INFO L226 Difference]: Without dead ends: 112 [2020-09-04 16:26:41,880 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-09-04 16:26:41,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-09-04 16:26:41,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 106. [2020-09-04 16:26:41,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-09-04 16:26:41,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 145 transitions. [2020-09-04 16:26:41,935 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 145 transitions. Word has length 52 [2020-09-04 16:26:41,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:26:41,938 INFO L479 AbstractCegarLoop]: Abstraction has 106 states and 145 transitions. [2020-09-04 16:26:41,938 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 16:26:41,938 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 145 transitions. [2020-09-04 16:26:41,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-09-04 16:26:41,941 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:26:41,942 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:26:41,942 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 16:26:41,942 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:26:41,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:26:41,943 INFO L82 PathProgramCache]: Analyzing trace with hash -521446491, now seen corresponding path program 1 times [2020-09-04 16:26:41,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:26:41,944 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1436469835] [2020-09-04 16:26:41,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:26:41,949 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:26:41,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:41,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:26:41,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:41,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:26:42,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:42,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:42,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:42,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:42,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:42,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:42,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:42,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:26:42,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:42,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:26:42,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:42,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-09-04 16:26:42,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:42,201 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-09-04 16:26:42,201 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1436469835] [2020-09-04 16:26:42,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:26:42,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-04 16:26:42,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953410846] [2020-09-04 16:26:42,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 16:26:42,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:26:42,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 16:26:42,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-09-04 16:26:42,212 INFO L87 Difference]: Start difference. First operand 106 states and 145 transitions. Second operand 8 states. [2020-09-04 16:26:42,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:26:42,374 INFO L93 Difference]: Finished difference Result 227 states and 348 transitions. [2020-09-04 16:26:42,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 16:26:42,376 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 69 [2020-09-04 16:26:42,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:26:42,379 INFO L225 Difference]: With dead ends: 227 [2020-09-04 16:26:42,379 INFO L226 Difference]: Without dead ends: 127 [2020-09-04 16:26:42,381 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-09-04 16:26:42,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-09-04 16:26:42,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2020-09-04 16:26:42,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-09-04 16:26:42,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 161 transitions. [2020-09-04 16:26:42,426 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 161 transitions. Word has length 69 [2020-09-04 16:26:42,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:26:42,427 INFO L479 AbstractCegarLoop]: Abstraction has 115 states and 161 transitions. [2020-09-04 16:26:42,427 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 16:26:42,428 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 161 transitions. [2020-09-04 16:26:42,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-09-04 16:26:42,433 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:26:42,433 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:26:42,433 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 16:26:42,433 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:26:42,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:26:42,434 INFO L82 PathProgramCache]: Analyzing trace with hash -439633211, now seen corresponding path program 1 times [2020-09-04 16:26:42,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:26:42,435 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [339136722] [2020-09-04 16:26:42,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:26:42,449 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:26:42,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:42,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:26:42,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:42,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:26:42,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:42,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:42,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:42,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:42,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:42,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:42,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:42,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:26:42,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:42,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:26:42,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:42,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 16:26:42,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:42,685 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-09-04 16:26:42,685 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [339136722] [2020-09-04 16:26:42,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:26:42,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 16:26:42,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011549087] [2020-09-04 16:26:42,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 16:26:42,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:26:42,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 16:26:42,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-09-04 16:26:42,694 INFO L87 Difference]: Start difference. First operand 115 states and 161 transitions. Second operand 10 states. [2020-09-04 16:26:42,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:26:42,971 INFO L93 Difference]: Finished difference Result 257 states and 400 transitions. [2020-09-04 16:26:42,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 16:26:42,972 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 70 [2020-09-04 16:26:42,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:26:42,976 INFO L225 Difference]: With dead ends: 257 [2020-09-04 16:26:42,977 INFO L226 Difference]: Without dead ends: 151 [2020-09-04 16:26:42,979 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2020-09-04 16:26:42,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2020-09-04 16:26:43,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 133. [2020-09-04 16:26:43,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-09-04 16:26:43,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 191 transitions. [2020-09-04 16:26:43,014 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 191 transitions. Word has length 70 [2020-09-04 16:26:43,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:26:43,015 INFO L479 AbstractCegarLoop]: Abstraction has 133 states and 191 transitions. [2020-09-04 16:26:43,015 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 16:26:43,015 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 191 transitions. [2020-09-04 16:26:43,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-09-04 16:26:43,018 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:26:43,018 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:26:43,018 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 16:26:43,019 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:26:43,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:26:43,019 INFO L82 PathProgramCache]: Analyzing trace with hash 307755032, now seen corresponding path program 2 times [2020-09-04 16:26:43,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:26:43,020 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [259627783] [2020-09-04 16:26:43,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:26:43,025 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:26:43,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:43,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:26:43,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:43,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:26:43,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:43,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:43,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:43,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:43,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:43,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:43,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:43,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:26:43,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:43,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:26:43,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:43,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 16:26:43,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:43,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:43,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:43,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:43,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:43,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:26:43,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:43,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:26:43,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:43,311 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-09-04 16:26:43,312 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [259627783] [2020-09-04 16:26:43,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:26:43,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-04 16:26:43,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324828151] [2020-09-04 16:26:43,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 16:26:43,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:26:43,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 16:26:43,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2020-09-04 16:26:43,314 INFO L87 Difference]: Start difference. First operand 133 states and 191 transitions. Second operand 12 states. [2020-09-04 16:26:43,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:26:43,855 INFO L93 Difference]: Finished difference Result 265 states and 420 transitions. [2020-09-04 16:26:43,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-09-04 16:26:43,856 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 105 [2020-09-04 16:26:43,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:26:43,861 INFO L225 Difference]: With dead ends: 265 [2020-09-04 16:26:43,862 INFO L226 Difference]: Without dead ends: 116 [2020-09-04 16:26:43,866 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-09-04 16:26:43,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-09-04 16:26:43,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 95. [2020-09-04 16:26:43,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-09-04 16:26:43,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 117 transitions. [2020-09-04 16:26:43,890 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 117 transitions. Word has length 105 [2020-09-04 16:26:43,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:26:43,890 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 117 transitions. [2020-09-04 16:26:43,891 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 16:26:43,891 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 117 transitions. [2020-09-04 16:26:43,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-09-04 16:26:43,897 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:26:43,897 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:26:43,898 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 16:26:43,898 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:26:43,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:26:43,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1534580400, now seen corresponding path program 1 times [2020-09-04 16:26:43,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:26:43,899 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1809248213] [2020-09-04 16:26:43,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:26:43,908 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:26:43,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:43,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:26:43,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:43,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:26:43,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:44,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:44,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:44,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:44,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:44,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:44,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:44,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:44,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:44,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:26:44,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:44,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:26:44,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:44,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 16:26:44,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:44,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-04 16:26:44,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:44,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:44,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:44,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:44,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:44,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:26:44,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:44,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:26:44,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:44,258 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-09-04 16:26:44,259 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1809248213] [2020-09-04 16:26:44,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:26:44,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 16:26:44,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397920308] [2020-09-04 16:26:44,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 16:26:44,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:26:44,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 16:26:44,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-09-04 16:26:44,263 INFO L87 Difference]: Start difference. First operand 95 states and 117 transitions. Second operand 10 states. [2020-09-04 16:26:44,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:26:44,573 INFO L93 Difference]: Finished difference Result 193 states and 255 transitions. [2020-09-04 16:26:44,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 16:26:44,574 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 123 [2020-09-04 16:26:44,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:26:44,578 INFO L225 Difference]: With dead ends: 193 [2020-09-04 16:26:44,578 INFO L226 Difference]: Without dead ends: 105 [2020-09-04 16:26:44,581 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2020-09-04 16:26:44,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-09-04 16:26:44,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2020-09-04 16:26:44,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-09-04 16:26:44,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 127 transitions. [2020-09-04 16:26:44,601 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 127 transitions. Word has length 123 [2020-09-04 16:26:44,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:26:44,605 INFO L479 AbstractCegarLoop]: Abstraction has 105 states and 127 transitions. [2020-09-04 16:26:44,605 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 16:26:44,605 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 127 transitions. [2020-09-04 16:26:44,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-09-04 16:26:44,608 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:26:44,608 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:26:44,609 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 16:26:44,609 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:26:44,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:26:44,610 INFO L82 PathProgramCache]: Analyzing trace with hash 822116120, now seen corresponding path program 2 times [2020-09-04 16:26:44,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:26:44,611 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2102483134] [2020-09-04 16:26:44,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:26:44,665 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:26:44,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:44,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:26:44,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:44,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:26:44,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:44,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:44,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:44,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:44,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:44,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:44,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:44,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:44,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:44,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:26:44,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:44,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:26:44,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:44,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 16:26:44,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:45,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:45,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:45,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:45,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:45,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:26:45,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:45,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:26:45,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:45,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-09-04 16:26:45,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:45,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:45,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:45,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:26:45,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:45,152 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 3 proven. 57 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2020-09-04 16:26:45,152 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2102483134] [2020-09-04 16:26:45,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:26:45,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-04 16:26:45,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858384351] [2020-09-04 16:26:45,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 16:26:45,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:26:45,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 16:26:45,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2020-09-04 16:26:45,154 INFO L87 Difference]: Start difference. First operand 105 states and 127 transitions. Second operand 12 states. [2020-09-04 16:26:45,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:26:45,627 INFO L93 Difference]: Finished difference Result 241 states and 326 transitions. [2020-09-04 16:26:45,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-04 16:26:45,628 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 140 [2020-09-04 16:26:45,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:26:45,631 INFO L225 Difference]: With dead ends: 241 [2020-09-04 16:26:45,632 INFO L226 Difference]: Without dead ends: 141 [2020-09-04 16:26:45,634 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-09-04 16:26:45,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-09-04 16:26:45,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 123. [2020-09-04 16:26:45,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-09-04 16:26:45,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 149 transitions. [2020-09-04 16:26:45,656 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 149 transitions. Word has length 140 [2020-09-04 16:26:45,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:26:45,656 INFO L479 AbstractCegarLoop]: Abstraction has 123 states and 149 transitions. [2020-09-04 16:26:45,656 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 16:26:45,657 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 149 transitions. [2020-09-04 16:26:45,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-09-04 16:26:45,659 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:26:45,659 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:26:45,659 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-04 16:26:45,660 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:26:45,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:26:45,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1260071360, now seen corresponding path program 2 times [2020-09-04 16:26:45,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:26:45,661 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1131318098] [2020-09-04 16:26:45,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:26:45,667 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:26:45,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:45,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:26:45,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:45,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:26:45,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:45,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:45,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:45,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:45,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:46,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:46,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:46,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:46,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:46,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:26:46,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:46,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:26:46,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:46,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 16:26:46,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:46,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:46,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:46,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:26:46,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:46,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 16:26:46,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:46,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:46,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:46,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:46,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:46,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:26:46,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:46,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:26:46,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:46,501 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2020-09-04 16:26:46,501 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1131318098] [2020-09-04 16:26:46,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:26:46,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2020-09-04 16:26:46,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452536842] [2020-09-04 16:26:46,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-09-04 16:26:46,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:26:46,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-09-04 16:26:46,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2020-09-04 16:26:46,504 INFO L87 Difference]: Start difference. First operand 123 states and 149 transitions. Second operand 22 states. [2020-09-04 16:26:47,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:26:47,318 INFO L93 Difference]: Finished difference Result 147 states and 181 transitions. [2020-09-04 16:26:47,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2020-09-04 16:26:47,319 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 140 [2020-09-04 16:26:47,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:26:47,322 INFO L225 Difference]: With dead ends: 147 [2020-09-04 16:26:47,323 INFO L226 Difference]: Without dead ends: 141 [2020-09-04 16:26:47,324 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=120, Invalid=1286, Unknown=0, NotChecked=0, Total=1406 [2020-09-04 16:26:47,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-09-04 16:26:47,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 131. [2020-09-04 16:26:47,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2020-09-04 16:26:47,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 164 transitions. [2020-09-04 16:26:47,351 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 164 transitions. Word has length 140 [2020-09-04 16:26:47,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:26:47,351 INFO L479 AbstractCegarLoop]: Abstraction has 131 states and 164 transitions. [2020-09-04 16:26:47,352 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-09-04 16:26:47,352 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 164 transitions. [2020-09-04 16:26:47,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2020-09-04 16:26:47,354 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:26:47,354 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:26:47,354 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-04 16:26:47,355 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:26:47,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:26:47,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1930099232, now seen corresponding path program 3 times [2020-09-04 16:26:47,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:26:47,362 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1720301861] [2020-09-04 16:26:47,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:26:47,369 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:26:47,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:47,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:26:47,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:47,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:26:47,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:47,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:47,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:47,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:47,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:47,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:47,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:47,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:47,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:47,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:26:47,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:47,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:26:47,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:47,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 16:26:47,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:47,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:47,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:47,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:26:47,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:47,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 16:26:47,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:47,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:47,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:47,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:26:47,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:47,727 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2020-09-04 16:26:47,728 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1720301861] [2020-09-04 16:26:47,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:26:47,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-04 16:26:47,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022298086] [2020-09-04 16:26:47,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 16:26:47,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:26:47,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 16:26:47,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-09-04 16:26:47,731 INFO L87 Difference]: Start difference. First operand 131 states and 164 transitions. Second operand 11 states. [2020-09-04 16:26:48,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:26:48,020 INFO L93 Difference]: Finished difference Result 257 states and 342 transitions. [2020-09-04 16:26:48,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-04 16:26:48,021 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 122 [2020-09-04 16:26:48,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:26:48,023 INFO L225 Difference]: With dead ends: 257 [2020-09-04 16:26:48,023 INFO L226 Difference]: Without dead ends: 138 [2020-09-04 16:26:48,024 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2020-09-04 16:26:48,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-09-04 16:26:48,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2020-09-04 16:26:48,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-09-04 16:26:48,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 174 transitions. [2020-09-04 16:26:48,049 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 174 transitions. Word has length 122 [2020-09-04 16:26:48,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:26:48,050 INFO L479 AbstractCegarLoop]: Abstraction has 138 states and 174 transitions. [2020-09-04 16:26:48,050 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 16:26:48,050 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 174 transitions. [2020-09-04 16:26:48,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2020-09-04 16:26:48,054 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:26:48,054 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 8, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:26:48,054 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-04 16:26:48,054 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:26:48,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:26:48,055 INFO L82 PathProgramCache]: Analyzing trace with hash 235403762, now seen corresponding path program 4 times [2020-09-04 16:26:48,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:26:48,055 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [628397434] [2020-09-04 16:26:48,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:26:48,060 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:26:48,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:48,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:26:48,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:48,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:26:48,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:48,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:48,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:48,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:48,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:48,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:48,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:48,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:48,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:48,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:26:48,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:48,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:26:48,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:48,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 16:26:48,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:48,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:48,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:48,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:26:48,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:48,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 16:26:48,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:48,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:48,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:48,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:48,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:48,418 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:48,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:48,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:26:48,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:48,425 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:26:48,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:48,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 16:26:48,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:48,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:48,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:48,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:26:48,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:48,521 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 2 proven. 36 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2020-09-04 16:26:48,522 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [628397434] [2020-09-04 16:26:48,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:26:48,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-09-04 16:26:48,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587816139] [2020-09-04 16:26:48,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 16:26:48,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:26:48,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 16:26:48,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-09-04 16:26:48,525 INFO L87 Difference]: Start difference. First operand 138 states and 174 transitions. Second operand 14 states. [2020-09-04 16:26:49,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:26:49,090 INFO L93 Difference]: Finished difference Result 279 states and 385 transitions. [2020-09-04 16:26:49,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-09-04 16:26:49,091 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 175 [2020-09-04 16:26:49,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:26:49,093 INFO L225 Difference]: With dead ends: 279 [2020-09-04 16:26:49,094 INFO L226 Difference]: Without dead ends: 149 [2020-09-04 16:26:49,097 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=625, Unknown=0, NotChecked=0, Total=756 [2020-09-04 16:26:49,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2020-09-04 16:26:49,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 142. [2020-09-04 16:26:49,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-09-04 16:26:49,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 178 transitions. [2020-09-04 16:26:49,123 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 178 transitions. Word has length 175 [2020-09-04 16:26:49,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:26:49,123 INFO L479 AbstractCegarLoop]: Abstraction has 142 states and 178 transitions. [2020-09-04 16:26:49,124 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 16:26:49,124 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 178 transitions. [2020-09-04 16:26:49,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2020-09-04 16:26:49,127 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:26:49,127 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 9, 9, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:26:49,128 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-09-04 16:26:49,128 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:26:49,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:26:49,129 INFO L82 PathProgramCache]: Analyzing trace with hash -544823395, now seen corresponding path program 5 times [2020-09-04 16:26:49,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:26:49,129 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [978336298] [2020-09-04 16:26:49,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:26:49,171 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:26:49,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:49,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:26:49,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:49,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:26:49,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:49,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:49,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:49,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:49,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:49,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:49,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:49,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:49,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:49,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:49,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:49,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:26:49,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:49,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:26:49,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:49,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 16:26:49,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:49,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:49,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:49,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:26:49,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:49,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 16:26:49,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:49,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:49,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:49,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:26:49,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:49,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2020-09-04 16:26:49,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:49,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:49,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:49,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:49,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:49,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:49,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:49,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:26:49,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:49,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:26:49,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:49,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 16:26:49,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:49,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:49,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:49,542 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:26:49,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:49,607 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 18 proven. 39 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2020-09-04 16:26:49,608 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [978336298] [2020-09-04 16:26:49,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:26:49,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-04 16:26:49,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599583517] [2020-09-04 16:26:49,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 16:26:49,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:26:49,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 16:26:49,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-09-04 16:26:49,610 INFO L87 Difference]: Start difference. First operand 142 states and 178 transitions. Second operand 11 states. [2020-09-04 16:26:49,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:26:49,927 INFO L93 Difference]: Finished difference Result 271 states and 352 transitions. [2020-09-04 16:26:49,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-04 16:26:49,928 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 210 [2020-09-04 16:26:49,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:26:49,930 INFO L225 Difference]: With dead ends: 271 [2020-09-04 16:26:49,931 INFO L226 Difference]: Without dead ends: 141 [2020-09-04 16:26:49,932 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2020-09-04 16:26:49,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-09-04 16:26:49,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 138. [2020-09-04 16:26:49,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-09-04 16:26:49,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 170 transitions. [2020-09-04 16:26:49,949 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 170 transitions. Word has length 210 [2020-09-04 16:26:49,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:26:49,950 INFO L479 AbstractCegarLoop]: Abstraction has 138 states and 170 transitions. [2020-09-04 16:26:49,950 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 16:26:49,950 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 170 transitions. [2020-09-04 16:26:49,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2020-09-04 16:26:49,953 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:26:49,953 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 9, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:26:49,954 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-09-04 16:26:49,954 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:26:49,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:26:49,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1099906658, now seen corresponding path program 6 times [2020-09-04 16:26:49,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:26:49,955 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [823073560] [2020-09-04 16:26:49,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:26:49,959 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:26:49,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:50,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:26:50,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:50,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:26:50,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:50,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:50,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:50,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:50,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:50,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:50,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:50,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:50,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:50,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:50,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:50,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:26:50,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:50,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:26:50,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:50,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 16:26:50,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:50,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:50,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:50,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:26:50,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:50,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 16:26:50,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:50,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:50,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:50,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:50,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:50,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:50,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:50,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:26:50,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:50,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:26:50,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:50,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 16:26:50,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:50,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:50,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:50,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:26:50,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:50,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2020-09-04 16:26:50,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:50,447 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:50,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:50,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:50,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:50,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:26:50,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:50,457 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:26:50,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:50,535 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 5 proven. 91 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2020-09-04 16:26:50,536 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [823073560] [2020-09-04 16:26:50,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:26:50,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-09-04 16:26:50,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464206809] [2020-09-04 16:26:50,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 16:26:50,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:26:50,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 16:26:50,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-09-04 16:26:50,538 INFO L87 Difference]: Start difference. First operand 138 states and 170 transitions. Second operand 14 states. [2020-09-04 16:26:51,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:26:51,171 INFO L93 Difference]: Finished difference Result 295 states and 399 transitions. [2020-09-04 16:26:51,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-09-04 16:26:51,172 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 228 [2020-09-04 16:26:51,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:26:51,175 INFO L225 Difference]: With dead ends: 295 [2020-09-04 16:26:51,175 INFO L226 Difference]: Without dead ends: 162 [2020-09-04 16:26:51,177 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=625, Unknown=0, NotChecked=0, Total=756 [2020-09-04 16:26:51,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2020-09-04 16:26:51,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 142. [2020-09-04 16:26:51,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-09-04 16:26:51,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 174 transitions. [2020-09-04 16:26:51,198 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 174 transitions. Word has length 228 [2020-09-04 16:26:51,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:26:51,198 INFO L479 AbstractCegarLoop]: Abstraction has 142 states and 174 transitions. [2020-09-04 16:26:51,198 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 16:26:51,199 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 174 transitions. [2020-09-04 16:26:51,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2020-09-04 16:26:51,202 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:26:51,202 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:26:51,202 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-09-04 16:26:51,202 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:26:51,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:26:51,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1117162661, now seen corresponding path program 7 times [2020-09-04 16:26:51,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:26:51,203 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [340693446] [2020-09-04 16:26:51,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:26:51,209 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:26:51,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:51,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:26:51,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:51,273 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:26:51,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:51,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:51,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:51,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:51,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:51,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:51,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:51,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:51,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:51,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:51,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:51,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:26:51,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:51,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:26:51,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:51,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 16:26:51,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:51,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:51,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:51,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:26:51,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:51,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 16:26:51,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:51,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:51,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:51,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:51,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:51,561 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:26:51,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:51,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:26:51,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:51,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-09-04 16:26:51,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:51,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:51,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:51,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:51,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:51,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:51,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:51,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:26:51,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:51,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:26:51,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:51,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 16:26:51,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:51,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:51,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:51,644 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:26:51,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:51,764 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 1 proven. 29 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2020-09-04 16:26:51,765 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [340693446] [2020-09-04 16:26:51,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:26:51,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-04 16:26:51,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098926251] [2020-09-04 16:26:51,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 16:26:51,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:26:51,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 16:26:51,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-09-04 16:26:51,768 INFO L87 Difference]: Start difference. First operand 142 states and 174 transitions. Second operand 11 states. [2020-09-04 16:26:52,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:26:52,164 INFO L93 Difference]: Finished difference Result 165 states and 203 transitions. [2020-09-04 16:26:52,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-04 16:26:52,165 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 228 [2020-09-04 16:26:52,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:26:52,167 INFO L225 Difference]: With dead ends: 165 [2020-09-04 16:26:52,167 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 16:26:52,169 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2020-09-04 16:26:52,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 16:26:52,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 16:26:52,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 16:26:52,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 16:26:52,171 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 228 [2020-09-04 16:26:52,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:26:52,172 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 16:26:52,172 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 16:26:52,172 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 16:26:52,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 16:26:52,173 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-09-04 16:26:52,177 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 16:27:05,511 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 7 [2020-09-04 16:27:06,151 WARN L193 SmtUtils]: Spent 635.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 41 [2020-09-04 16:27:06,524 WARN L193 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 21 [2020-09-04 16:27:06,632 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 6 [2020-09-04 16:27:07,015 WARN L193 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 21 [2020-09-04 16:27:07,911 WARN L193 SmtUtils]: Spent 823.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 40 [2020-09-04 16:27:08,410 WARN L193 SmtUtils]: Spent 481.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 28 [2020-09-04 16:27:09,045 WARN L193 SmtUtils]: Spent 612.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 41 [2020-09-04 16:27:09,512 WARN L193 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 36 [2020-09-04 16:27:10,091 WARN L193 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 36 [2020-09-04 16:27:10,538 WARN L193 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 40 [2020-09-04 16:27:11,156 WARN L193 SmtUtils]: Spent 614.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 39 [2020-09-04 16:27:11,797 WARN L193 SmtUtils]: Spent 637.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 39 [2020-09-04 16:27:12,322 WARN L193 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 25 [2020-09-04 16:27:13,168 WARN L193 SmtUtils]: Spent 840.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 40 [2020-09-04 16:27:13,533 WARN L193 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 25 [2020-09-04 16:27:14,415 WARN L193 SmtUtils]: Spent 784.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 48 [2020-09-04 16:27:15,035 WARN L193 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 38 [2020-09-04 16:27:15,092 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-09-04 16:27:15,092 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-09-04 16:27:15,092 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-09-04 16:27:15,092 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-09-04 16:27:15,092 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-04 16:27:15,093 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-09-04 16:27:15,093 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) the Hoare annotation is: false [2020-09-04 16:27:15,093 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 35 42) the Hoare annotation is: true [2020-09-04 16:27:15,093 INFO L264 CegarLoopResult]: At program point mainEXIT(lines 35 42) the Hoare annotation is: (<= 5 main_~x~0) [2020-09-04 16:27:15,094 INFO L264 CegarLoopResult]: At program point mainFINAL(lines 35 42) the Hoare annotation is: (<= 5 main_~x~0) [2020-09-04 16:27:15,094 INFO L264 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: false [2020-09-04 16:27:15,094 INFO L264 CegarLoopResult]: At program point L38(lines 38 40) the Hoare annotation is: (and (<= main_~x~0 5) (<= 5 main_~x~0) (<= 5 main_~result~0) (<= main_~result~0 5)) [2020-09-04 16:27:15,094 INFO L264 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: (and (<= main_~x~0 5) (<= 5 main_~x~0)) [2020-09-04 16:27:15,094 INFO L264 CegarLoopResult]: At program point L37-1(line 37) the Hoare annotation is: (and (<= main_~x~0 5) (<= 5 |main_#t~ret4|) (<= 5 main_~x~0) (<= |main_#t~ret4| 5)) [2020-09-04 16:27:15,094 INFO L264 CegarLoopResult]: At program point L38-2(lines 38 40) the Hoare annotation is: (<= 5 main_~x~0) [2020-09-04 16:27:15,095 INFO L264 CegarLoopResult]: At program point L37-2(line 37) the Hoare annotation is: (and (<= main_~x~0 5) (<= 5 |main_#t~ret4|) (<= 5 main_~x~0) (<= |main_#t~ret4| 5)) [2020-09-04 16:27:15,095 INFO L264 CegarLoopResult]: At program point L37-3(line 37) the Hoare annotation is: (and (<= main_~x~0 5) (<= 5 |main_#t~ret4|) (<= 5 main_~x~0) (<= 5 main_~result~0) (<= |main_#t~ret4| 5) (<= main_~result~0 5)) [2020-09-04 16:27:15,095 INFO L271 CegarLoopResult]: At program point fibo2ENTRY(lines 17 25) the Hoare annotation is: true [2020-09-04 16:27:15,095 INFO L264 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (not (<= |fibo2_#in~n| 1))) [2020-09-04 16:27:15,095 INFO L264 CegarLoopResult]: At program point L23-1(line 23) the Hoare annotation is: (and (or (and (<= |fibo2_#t~ret2| 1) (<= 1 |fibo2_#t~ret2|) (<= |fibo2_#in~n| 2)) (and (<= 4 fibo2_~n) (<= 2 |fibo2_#t~ret2|) (<= |fibo2_#t~ret2| 2)) (<= 5 fibo2_~n)) (= fibo2_~n |fibo2_#in~n|) (not (<= |fibo2_#in~n| 1))) [2020-09-04 16:27:15,095 INFO L264 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (not (<= 2 |fibo2_#in~n|)) (< 0 fibo2_~n)) [2020-09-04 16:27:15,096 INFO L264 CegarLoopResult]: At program point L23-2(line 23) the Hoare annotation is: (and (or (and (<= |fibo2_#t~ret2| 1) (<= 1 |fibo2_#t~ret2|) (<= |fibo2_#in~n| 2)) (and (<= 4 fibo2_~n) (<= 2 |fibo2_#t~ret2|) (<= |fibo2_#t~ret2| 2)) (<= 5 fibo2_~n)) (= fibo2_~n |fibo2_#in~n|) (not (<= |fibo2_#in~n| 1))) [2020-09-04 16:27:15,096 INFO L264 CegarLoopResult]: At program point L20(lines 20 24) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (< 0 fibo2_~n)) [2020-09-04 16:27:15,096 INFO L264 CegarLoopResult]: At program point L23-3(line 23) the Hoare annotation is: (let ((.cse1 (<= |fibo2_#t~ret2| 1)) (.cse3 (<= 1 |fibo2_#t~ret2|)) (.cse2 (= fibo2_~n |fibo2_#in~n|)) (.cse0 (+ |fibo2_#t~ret3| |fibo2_#t~ret2|))) (and (or (and (<= 1 .cse0) (<= .cse0 1) .cse1 .cse2 .cse3 (<= 2 |fibo2_#in~n|)) (not (<= |fibo2_#in~n| 2))) (or (and (<= |fibo2_#in~n| 3) (<= .cse0 2) .cse1 .cse2 .cse3 (<= 2 .cse0)) (and .cse2 (<= 5 fibo2_~n)) (not (<= 3 |fibo2_#in~n|)) (and (<= 4 |fibo2_#in~n|) (<= .cse0 3) (<= 2 |fibo2_#t~ret2|) (<= |fibo2_#t~ret2| 2) .cse2 (<= 3 .cse0))))) [2020-09-04 16:27:15,096 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (<= |fibo2_#in~n| 0)) [2020-09-04 16:27:15,096 INFO L264 CegarLoopResult]: At program point L23-4(line 23) the Hoare annotation is: (let ((.cse1 (<= |fibo2_#t~ret2| 1)) (.cse3 (<= 1 |fibo2_#t~ret2|)) (.cse2 (= fibo2_~n |fibo2_#in~n|)) (.cse0 (+ |fibo2_#t~ret3| |fibo2_#t~ret2|))) (and (or (and (<= 1 .cse0) (<= .cse0 1) .cse1 .cse2 .cse3 (<= 2 |fibo2_#in~n|)) (not (<= |fibo2_#in~n| 2))) (or (and (<= |fibo2_#in~n| 3) (<= .cse0 2) .cse1 .cse2 .cse3 (<= 2 .cse0)) (and .cse2 (<= 5 fibo2_~n)) (not (<= 3 |fibo2_#in~n|)) (and (<= 4 |fibo2_#in~n|) (<= .cse0 3) (<= 2 |fibo2_#t~ret2|) (<= |fibo2_#t~ret2| 2) .cse2 (<= 3 .cse0))))) [2020-09-04 16:27:15,097 INFO L264 CegarLoopResult]: At program point L18(lines 18 24) the Hoare annotation is: (= fibo2_~n |fibo2_#in~n|) [2020-09-04 16:27:15,097 INFO L264 CegarLoopResult]: At program point L23-5(line 23) the Hoare annotation is: (let ((.cse1 (+ |fibo2_#t~ret3| |fibo2_#t~ret2|)) (.cse2 (<= |fibo2_#t~ret2| 1)) (.cse0 (= fibo2_~n |fibo2_#in~n|)) (.cse3 (<= 1 |fibo2_#t~ret2|))) (or (and .cse0 (<= 5 fibo2_~n)) (and (<= |fibo2_#in~n| 3) (<= .cse1 2) (<= |fibo2_#res| 2) (<= 2 |fibo2_#res|) (<= 3 fibo2_~n) .cse2 .cse0 .cse3 (<= 2 .cse1)) (and (<= 4 |fibo2_#in~n|) (<= .cse1 3) (<= 2 |fibo2_#t~ret2|) (<= 3 |fibo2_#res|) (<= |fibo2_#t~ret2| 2) (<= |fibo2_#res| 3) .cse0 (<= 3 .cse1)) (and (<= 1 .cse1) (<= .cse1 1) (<= 1 |fibo2_#res|) .cse2 (<= |fibo2_#res| 1) .cse0 .cse3 (<= 2 |fibo2_#in~n|) (<= |fibo2_#in~n| 2)))) [2020-09-04 16:27:15,097 INFO L264 CegarLoopResult]: At program point L23-6(line 23) the Hoare annotation is: (let ((.cse2 (<= |fibo2_#in~n| 3))) (let ((.cse0 (and .cse2 (<= |fibo2_#res| 2) (<= 2 |fibo2_#res|) (<= 3 fibo2_~n))) (.cse1 (and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1) (<= |fibo2_#in~n| 2)))) (and (or .cse0 .cse1 (and (<= |fibo2_#res| 3) (<= 3 |fibo2_#res|)) (<= 5 fibo2_~n)) (= fibo2_~n |fibo2_#in~n|) (or .cse0 .cse1 (not .cse2)) (not (<= |fibo2_#in~n| 1))))) [2020-09-04 16:27:15,097 INFO L264 CegarLoopResult]: At program point fibo2FINAL(lines 17 25) the Hoare annotation is: (let ((.cse3 (<= 1 |fibo2_#res|)) (.cse4 (<= |fibo2_#res| 1)) (.cse0 (= fibo2_~n |fibo2_#in~n|))) (let ((.cse1 (and .cse3 .cse4 .cse0 (< 0 fibo2_~n))) (.cse2 (not (<= |fibo2_#in~n| 1)))) (and (or (and .cse0 (<= |fibo2_#in~n| 0)) .cse1 .cse2) (or .cse1 (and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|)) .cse2) (or (and .cse0 (<= 5 fibo2_~n)) (and (<= 4 fibo2_~n) (<= |fibo2_#res| 3) .cse0 (<= 3 |fibo2_#res|)) (and (<= |fibo2_#in~n| 3) (<= |fibo2_#res| 2) (<= 2 |fibo2_#res|) (<= 3 fibo2_~n) .cse0) (and .cse3 .cse4 .cse0 (<= |fibo2_#in~n| 2)) (not (<= 2 |fibo2_#in~n|)))))) [2020-09-04 16:27:15,098 INFO L264 CegarLoopResult]: At program point fibo2EXIT(lines 17 25) the Hoare annotation is: (let ((.cse3 (<= 1 |fibo2_#res|)) (.cse4 (<= |fibo2_#res| 1)) (.cse0 (= fibo2_~n |fibo2_#in~n|))) (let ((.cse1 (and .cse3 .cse4 .cse0 (< 0 fibo2_~n))) (.cse2 (not (<= |fibo2_#in~n| 1)))) (and (or (and .cse0 (<= |fibo2_#in~n| 0)) .cse1 .cse2) (or .cse1 (and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|)) .cse2) (or (and .cse0 (<= 5 fibo2_~n)) (and (<= 4 fibo2_~n) (<= |fibo2_#res| 3) .cse0 (<= 3 |fibo2_#res|)) (and (<= |fibo2_#in~n| 3) (<= |fibo2_#res| 2) (<= 2 |fibo2_#res|) (<= 3 fibo2_~n) .cse0) (and .cse3 .cse4 .cse0 (<= |fibo2_#in~n| 2)) (not (<= 2 |fibo2_#in~n|)))))) [2020-09-04 16:27:15,098 INFO L271 CegarLoopResult]: At program point fibo1ENTRY(lines 7 15) the Hoare annotation is: true [2020-09-04 16:27:15,098 INFO L264 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (and (<= 2 |fibo1_#in~n|) (= fibo1_~n |fibo1_#in~n|)) [2020-09-04 16:27:15,098 INFO L264 CegarLoopResult]: At program point L13-1(line 13) the Hoare annotation is: (and (<= 2 |fibo1_#in~n|) (let ((.cse0 (= fibo1_~n |fibo1_#in~n|)) (.cse1 (<= |fibo1_#in~n| 4))) (or (and (<= 3 |fibo1_#t~ret0|) (<= 5 fibo1_~n) .cse0 (<= |fibo1_#t~ret0| 3)) (and (<= |fibo1_#t~ret0| 1) (<= 1 |fibo1_#t~ret0|) .cse0 .cse1) (and .cse0 (<= 6 |fibo1_#in~n|)) (and (<= 4 |fibo1_#in~n|) .cse0 .cse1)))) [2020-09-04 16:27:15,098 INFO L264 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: (and (<= |fibo1_#in~n| 1) (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n)) [2020-09-04 16:27:15,099 INFO L264 CegarLoopResult]: At program point L13-2(line 13) the Hoare annotation is: (and (<= 2 |fibo1_#in~n|) (let ((.cse0 (= fibo1_~n |fibo1_#in~n|)) (.cse1 (<= |fibo1_#in~n| 4))) (or (and (<= 3 |fibo1_#t~ret0|) (<= 5 fibo1_~n) .cse0 (<= |fibo1_#t~ret0| 3)) (and (<= |fibo1_#t~ret0| 1) (<= 1 |fibo1_#t~ret0|) .cse0 .cse1) (and .cse0 (<= 6 |fibo1_#in~n|)) (and (<= 4 |fibo1_#in~n|) .cse0 .cse1)))) [2020-09-04 16:27:15,099 INFO L264 CegarLoopResult]: At program point fibo1FINAL(lines 7 15) the Hoare annotation is: (and (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and .cse0 (<= 6 |fibo1_#in~n|)) (and (or (and (<= 5 |fibo1_#res|) (<= |fibo1_#res| 5) .cse0) (and (<= fibo1_~n 4) .cse0)) (<= 4 |fibo1_#in~n|)) (and (<= 2 |fibo1_#res|) (<= |fibo1_#in~n| 3) (<= |fibo1_#res| 2) .cse0 (<= 3 |fibo1_#in~n|)) (and (<= |fibo1_#in~n| 0) .cse0) (and (<= |fibo1_#in~n| 2) .cse0 (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|)))) (or (and (<= 0 |fibo1_#res|) (<= |fibo1_#res| 0)) (< 0 fibo1_~n))) [2020-09-04 16:27:15,099 INFO L264 CegarLoopResult]: At program point L10(lines 10 14) the Hoare annotation is: (and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n)) [2020-09-04 16:27:15,099 INFO L264 CegarLoopResult]: At program point L13-3(line 13) the Hoare annotation is: (let ((.cse2 (<= |fibo1_#t~ret0| 1)) (.cse1 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|)) (.cse5 (<= |fibo1_#in~n| 2)) (.cse3 (<= 1 |fibo1_#t~ret0|)) (.cse4 (= fibo1_~n |fibo1_#in~n|))) (let ((.cse0 (and (<= .cse1 1) .cse2 (<= 1 .cse1) .cse5 .cse3 .cse4))) (and (not (<= |fibo1_#in~n| 1)) (or (and (<= 4 |fibo1_#in~n|) (<= |fibo1_#in~n| 4)) .cse0 (and (<= .cse1 5) (<= 3 |fibo1_#t~ret0|) (<= 5 fibo1_~n) (<= 5 .cse1) (<= |fibo1_#t~ret0| 3)) (and (<= |fibo1_#in~n| 3) .cse2 (<= .cse1 2) .cse3 (<= 2 .cse1)) (<= 6 |fibo1_#in~n|)) .cse4 (or (not .cse5) .cse0)))) [2020-09-04 16:27:15,099 INFO L264 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: (and (<= |fibo1_#in~n| 0) (= fibo1_~n |fibo1_#in~n|)) [2020-09-04 16:27:15,100 INFO L264 CegarLoopResult]: At program point L13-4(line 13) the Hoare annotation is: (let ((.cse2 (<= |fibo1_#t~ret0| 1)) (.cse1 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|)) (.cse5 (<= |fibo1_#in~n| 2)) (.cse3 (<= 1 |fibo1_#t~ret0|)) (.cse4 (= fibo1_~n |fibo1_#in~n|))) (let ((.cse0 (and (<= .cse1 1) .cse2 (<= 1 .cse1) .cse5 .cse3 .cse4))) (and (not (<= |fibo1_#in~n| 1)) (or (and (<= 4 |fibo1_#in~n|) (<= |fibo1_#in~n| 4)) .cse0 (and (<= .cse1 5) (<= 3 |fibo1_#t~ret0|) (<= 5 fibo1_~n) (<= 5 .cse1) (<= |fibo1_#t~ret0| 3)) (and (<= |fibo1_#in~n| 3) .cse2 (<= .cse1 2) .cse3 (<= 2 .cse1)) (<= 6 |fibo1_#in~n|)) .cse4 (or (not .cse5) .cse0)))) [2020-09-04 16:27:15,100 INFO L264 CegarLoopResult]: At program point L8(lines 8 14) the Hoare annotation is: (= fibo1_~n |fibo1_#in~n|) [2020-09-04 16:27:15,100 INFO L264 CegarLoopResult]: At program point L13-5(line 13) the Hoare annotation is: (let ((.cse1 (<= |fibo1_#t~ret0| 1)) (.cse2 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|)) (.cse5 (<= |fibo1_#in~n| 2)) (.cse3 (<= 1 |fibo1_#t~ret0|))) (let ((.cse0 (and (<= .cse2 1) .cse1 (<= 1 .cse2) .cse5 .cse3 (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|)))) (and (or .cse0 (and (<= 2 |fibo1_#res|) .cse1 (<= .cse2 2) .cse3 (<= |fibo1_#res| 2) (<= 2 .cse2)) (<= 4 |fibo1_#in~n|)) (let ((.cse4 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= .cse2 5) (<= 3 |fibo1_#t~ret0|) (<= 5 |fibo1_#res|) (<= |fibo1_#res| 5) .cse4 (<= 5 .cse2) (<= |fibo1_#t~ret0| 3)) (and .cse4 (<= 6 |fibo1_#in~n|)) (and (<= |fibo1_#in~n| 3) (< 1 fibo1_~n) .cse4) (and (<= 4 fibo1_~n) (<= fibo1_~n 4) .cse4))) (or .cse0 (not .cse5))))) [2020-09-04 16:27:15,100 INFO L264 CegarLoopResult]: At program point L13-6(line 13) the Hoare annotation is: (and (not (<= |fibo1_#in~n| 1)) (let ((.cse0 (<= |fibo1_#t~ret0| 1)) (.cse1 (<= 1 |fibo1_#t~ret0|)) (.cse2 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= |fibo1_#in~n| 3) (<= 2 |fibo1_#res|) .cse0 .cse1 (<= |fibo1_#res| 2) .cse2 (<= 3 |fibo1_#in~n|)) (and (<= 3 |fibo1_#t~ret0|) (<= 5 fibo1_~n) (<= 5 |fibo1_#res|) (<= |fibo1_#res| 5) .cse2 (<= |fibo1_#t~ret0| 3)) (and .cse2 (<= 6 |fibo1_#in~n|)) (and .cse0 (<= |fibo1_#in~n| 2) .cse1 .cse2 (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|)) (and (<= 4 |fibo1_#in~n|) .cse2 (<= |fibo1_#in~n| 4))))) [2020-09-04 16:27:15,100 INFO L264 CegarLoopResult]: At program point fibo1EXIT(lines 7 15) the Hoare annotation is: (and (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and .cse0 (<= 6 |fibo1_#in~n|)) (and (or (and (<= 5 |fibo1_#res|) (<= |fibo1_#res| 5) .cse0) (and (<= fibo1_~n 4) .cse0)) (<= 4 |fibo1_#in~n|)) (and (<= 2 |fibo1_#res|) (<= |fibo1_#in~n| 3) (<= |fibo1_#res| 2) .cse0 (<= 3 |fibo1_#in~n|)) (and (<= |fibo1_#in~n| 0) .cse0) (and (<= |fibo1_#in~n| 2) .cse0 (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|)))) (or (and (<= 0 |fibo1_#res|) (<= |fibo1_#res| 0)) (< 0 fibo1_~n))) [2020-09-04 16:27:15,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 04:27:15 BoogieIcfgContainer [2020-09-04 16:27:15,129 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 16:27:15,131 INFO L168 Benchmark]: Toolchain (without parser) took 37252.25 ms. Allocated memory was 138.9 MB in the beginning and 552.6 MB in the end (delta: 413.7 MB). Free memory was 103.2 MB in the beginning and 184.4 MB in the end (delta: -81.2 MB). Peak memory consumption was 431.4 MB. Max. memory is 7.1 GB. [2020-09-04 16:27:15,132 INFO L168 Benchmark]: CDTParser took 0.89 ms. Allocated memory is still 138.9 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-04 16:27:15,132 INFO L168 Benchmark]: CACSL2BoogieTranslator took 340.77 ms. Allocated memory is still 138.9 MB. Free memory was 103.0 MB in the beginning and 93.5 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-09-04 16:27:15,133 INFO L168 Benchmark]: Boogie Preprocessor took 134.31 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 93.5 MB in the beginning and 182.1 MB in the end (delta: -88.6 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. [2020-09-04 16:27:15,134 INFO L168 Benchmark]: RCFGBuilder took 361.15 ms. Allocated memory is still 203.4 MB. Free memory was 182.1 MB in the beginning and 168.1 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2020-09-04 16:27:15,134 INFO L168 Benchmark]: TraceAbstraction took 36395.20 ms. Allocated memory was 203.4 MB in the beginning and 552.6 MB in the end (delta: 349.2 MB). Free memory was 167.4 MB in the beginning and 184.4 MB in the end (delta: -17.0 MB). Peak memory consumption was 431.2 MB. Max. memory is 7.1 GB. [2020-09-04 16:27:15,137 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.89 ms. Allocated memory is still 138.9 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 340.77 ms. Allocated memory is still 138.9 MB. Free memory was 103.0 MB in the beginning and 93.5 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 134.31 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 93.5 MB in the beginning and 182.1 MB in the end (delta: -88.6 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 361.15 ms. Allocated memory is still 203.4 MB. Free memory was 182.1 MB in the beginning and 168.1 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 36395.20 ms. Allocated memory was 203.4 MB in the beginning and 552.6 MB in the end (delta: 349.2 MB). Free memory was 167.4 MB in the beginning and 184.4 MB in the end (delta: -17.0 MB). Peak memory consumption was 431.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 39]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 35]: Procedure Contract for main Derived contract for procedure main: 5 <= x - ProcedureContractResult [Line: 17]: Procedure Contract for fibo2 Derived contract for procedure fibo2: ((((n == \old(n) && \old(n) <= 0) || (((1 <= \result && \result <= 1) && n == \old(n)) && 0 < n)) || !(\old(n) <= 1)) && (((((1 <= \result && \result <= 1) && n == \old(n)) && 0 < n) || (\result <= 0 && 0 <= \result)) || !(\old(n) <= 1))) && (((((n == \old(n) && 5 <= n) || (((4 <= n && \result <= 3) && n == \old(n)) && 3 <= \result)) || ((((\old(n) <= 3 && \result <= 2) && 2 <= \result) && 3 <= n) && n == \old(n))) || (((1 <= \result && \result <= 1) && n == \old(n)) && \old(n) <= 2)) || !(2 <= \old(n))) - ProcedureContractResult [Line: 7]: Procedure Contract for fibo1 Derived contract for procedure fibo1: (((((n == \old(n) && 6 <= \old(n)) || ((((5 <= \result && \result <= 5) && n == \old(n)) || (n <= 4 && n == \old(n))) && 4 <= \old(n))) || ((((2 <= \result && \old(n) <= 3) && \result <= 2) && n == \old(n)) && 3 <= \old(n))) || (\old(n) <= 0 && n == \old(n))) || (((\old(n) <= 2 && n == \old(n)) && \result <= 1) && 1 <= \result)) && ((0 <= \result && \result <= 0) || 0 < n) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 13.2s, OverallIterations: 18, TraceHistogramMax: 13, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 22.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 859 SDtfs, 927 SDslu, 5120 SDs, 0 SdLazy, 3528 SolverSat, 351 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 734 GetRequests, 489 SyntacticMatches, 0 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 127 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 45 LocationsWithAnnotation, 2621 PreInvPairs, 5706 NumberOfFragments, 1468 HoareAnnotationTreeSize, 2621 FomulaSimplifications, 170173 FormulaSimplificationTreeSizeReduction, 13.1s HoareSimplificationTime, 45 FomulaSimplificationsInter, 47696 FormulaSimplificationTreeSizeReductionInter, 9.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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 correct! Received shutdown request...