/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_5-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 21:54:48,336 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 21:54:48,341 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 21:54:48,370 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 21:54:48,370 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 21:54:48,372 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 21:54:48,374 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 21:54:48,376 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 21:54:48,377 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 21:54:48,378 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 21:54:48,380 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 21:54:48,381 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 21:54:48,381 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 21:54:48,383 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 21:54:48,384 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 21:54:48,385 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 21:54:48,386 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 21:54:48,387 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 21:54:48,389 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 21:54:48,391 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 21:54:48,393 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 21:54:48,394 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 21:54:48,396 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 21:54:48,397 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 21:54:48,400 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 21:54:48,400 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 21:54:48,400 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 21:54:48,402 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 21:54:48,402 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 21:54:48,403 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 21:54:48,403 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 21:54:48,404 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 21:54:48,405 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 21:54:48,406 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 21:54:48,407 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 21:54:48,408 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 21:54:48,408 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 21:54:48,409 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 21:54:48,409 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 21:54:48,410 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 21:54:48,411 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 21:54:48,412 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-09-04 21:54:48,425 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 21:54:48,426 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 21:54:48,427 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 21:54:48,428 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 21:54:48,428 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 21:54:48,428 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 21:54:48,428 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 21:54:48,428 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 21:54:48,429 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 21:54:48,429 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 21:54:48,429 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 21:54:48,429 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 21:54:48,429 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 21:54:48,430 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 21:54:48,430 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 21:54:48,430 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 21:54:48,430 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 21:54:48,431 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 21:54:48,431 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 21:54:48,431 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 21:54:48,431 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 21:54:48,431 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 21:54:48,432 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-09-04 21:54:48,940 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 21:54:48,967 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 21:54:48,971 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 21:54:48,974 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 21:54:48,974 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 21:54:48,975 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_5-1.c [2020-09-04 21:54:49,066 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/618c2252e/ca7f80d9375c4667b7067b14d1358192/FLAGcee0e5fac [2020-09-04 21:54:49,701 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 21:54:49,702 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/fibo_5-1.c [2020-09-04 21:54:49,712 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/618c2252e/ca7f80d9375c4667b7067b14d1358192/FLAGcee0e5fac [2020-09-04 21:54:49,976 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/618c2252e/ca7f80d9375c4667b7067b14d1358192 [2020-09-04 21:54:49,998 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 21:54:50,001 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 21:54:50,005 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 21:54:50,006 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 21:54:50,011 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 21:54:50,012 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 09:54:49" (1/1) ... [2020-09-04 21:54:50,018 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@457b3941 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:54:50, skipping insertion in model container [2020-09-04 21:54:50,018 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 09:54:49" (1/1) ... [2020-09-04 21:54:50,030 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 21:54:50,060 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 21:54:50,276 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 21:54:50,282 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 21:54:50,299 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 21:54:50,316 INFO L208 MainTranslator]: Completed translation [2020-09-04 21:54:50,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:54:50 WrapperNode [2020-09-04 21:54:50,316 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 21:54:50,317 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 21:54:50,318 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 21:54:50,318 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 21:54:50,335 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:54:50" (1/1) ... [2020-09-04 21:54:50,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:54:50" (1/1) ... [2020-09-04 21:54:50,341 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:54:50" (1/1) ... [2020-09-04 21:54:50,341 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:54:50" (1/1) ... [2020-09-04 21:54:50,345 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:54:50" (1/1) ... [2020-09-04 21:54:50,348 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:54:50" (1/1) ... [2020-09-04 21:54:50,349 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:54:50" (1/1) ... [2020-09-04 21:54:50,351 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 21:54:50,352 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 21:54:50,352 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 21:54:50,352 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 21:54:50,354 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:54:50" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 21:54:50,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 21:54:50,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 21:54:50,553 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-09-04 21:54:50,553 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 21:54:50,553 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 21:54:50,554 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 21:54:50,554 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-09-04 21:54:50,554 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 21:54:50,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 21:54:50,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 21:54:50,772 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 21:54:50,773 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-04 21:54:50,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 09:54:50 BoogieIcfgContainer [2020-09-04 21:54:50,780 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 21:54:50,792 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 21:54:50,793 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 21:54:50,803 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 21:54:50,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 09:54:49" (1/3) ... [2020-09-04 21:54:50,813 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d98cb1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 09:54:50, skipping insertion in model container [2020-09-04 21:54:50,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:54:50" (2/3) ... [2020-09-04 21:54:50,816 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d98cb1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 09:54:50, skipping insertion in model container [2020-09-04 21:54:50,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 09:54:50" (3/3) ... [2020-09-04 21:54:50,820 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_5-1.c [2020-09-04 21:54:50,850 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 21:54:50,863 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 21:54:50,889 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 21:54:50,923 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 21:54:50,923 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 21:54:50,923 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-04 21:54:50,924 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 21:54:50,924 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 21:54:50,924 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 21:54:50,924 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 21:54:50,924 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 21:54:50,963 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2020-09-04 21:54:50,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-09-04 21:54:50,997 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:54:50,999 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:54:51,000 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:54:51,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:54:51,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1756383024, now seen corresponding path program 1 times [2020-09-04 21:54:51,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:54:51,025 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1359797183] [2020-09-04 21:54:51,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:54:51,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:51,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:54:51,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:51,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:54:51,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:51,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 21:54:51,321 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1359797183] [2020-09-04 21:54:51,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 21:54:51,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 21:54:51,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891664869] [2020-09-04 21:54:51,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 21:54:51,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:54:51,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 21:54:51,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 21:54:51,357 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 5 states. [2020-09-04 21:54:51,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:54:51,493 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2020-09-04 21:54:51,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 21:54:51,495 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-09-04 21:54:51,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:54:51,508 INFO L225 Difference]: With dead ends: 44 [2020-09-04 21:54:51,509 INFO L226 Difference]: Without dead ends: 28 [2020-09-04 21:54:51,514 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-04 21:54:51,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-09-04 21:54:51,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-09-04 21:54:51,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-09-04 21:54:51,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2020-09-04 21:54:51,577 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 16 [2020-09-04 21:54:51,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:54:51,578 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2020-09-04 21:54:51,578 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 21:54:51,578 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2020-09-04 21:54:51,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-09-04 21:54:51,581 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:54:51,581 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 21:54:51,582 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 21:54:51,582 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:54:51,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:54:51,583 INFO L82 PathProgramCache]: Analyzing trace with hash -389703589, now seen corresponding path program 1 times [2020-09-04 21:54:51,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:54:51,583 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [675489227] [2020-09-04 21:54:51,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:54:51,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:51,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:54:51,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:51,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:54:51,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:51,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 21:54:51,665 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [675489227] [2020-09-04 21:54:51,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 21:54:51,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 21:54:51,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112361535] [2020-09-04 21:54:51,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 21:54:51,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:54:51,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 21:54:51,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 21:54:51,670 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 5 states. [2020-09-04 21:54:51,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:54:51,747 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2020-09-04 21:54:51,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 21:54:51,748 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-09-04 21:54:51,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:54:51,750 INFO L225 Difference]: With dead ends: 36 [2020-09-04 21:54:51,750 INFO L226 Difference]: Without dead ends: 30 [2020-09-04 21:54:51,752 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-04 21:54:51,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-09-04 21:54:51,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2020-09-04 21:54:51,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-09-04 21:54:51,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2020-09-04 21:54:51,766 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 17 [2020-09-04 21:54:51,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:54:51,767 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2020-09-04 21:54:51,767 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 21:54:51,767 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2020-09-04 21:54:51,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-09-04 21:54:51,769 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:54:51,770 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 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] [2020-09-04 21:54:51,770 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 21:54:51,770 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:54:51,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:54:51,771 INFO L82 PathProgramCache]: Analyzing trace with hash 50309368, now seen corresponding path program 1 times [2020-09-04 21:54:51,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:54:51,772 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1330079493] [2020-09-04 21:54:51,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:54:51,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:51,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:54:51,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:51,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:54:51,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:51,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:51,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:51,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 21:54:51,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:51,969 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-09-04 21:54:51,969 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1330079493] [2020-09-04 21:54:51,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:54:51,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-04 21:54:51,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711038095] [2020-09-04 21:54:51,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 21:54:51,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:54:51,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 21:54:51,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-09-04 21:54:51,972 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 7 states. [2020-09-04 21:54:52,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:54:52,092 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2020-09-04 21:54:52,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 21:54:52,093 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-09-04 21:54:52,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:54:52,094 INFO L225 Difference]: With dead ends: 52 [2020-09-04 21:54:52,095 INFO L226 Difference]: Without dead ends: 30 [2020-09-04 21:54:52,096 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-09-04 21:54:52,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-09-04 21:54:52,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-09-04 21:54:52,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-09-04 21:54:52,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2020-09-04 21:54:52,109 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 33 [2020-09-04 21:54:52,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:54:52,109 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2020-09-04 21:54:52,109 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 21:54:52,110 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-09-04 21:54:52,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-09-04 21:54:52,112 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:54:52,112 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 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 21:54:52,113 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 21:54:52,113 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:54:52,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:54:52,114 INFO L82 PathProgramCache]: Analyzing trace with hash -643371531, now seen corresponding path program 1 times [2020-09-04 21:54:52,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:54:52,114 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [577171608] [2020-09-04 21:54:52,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:54:52,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:52,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:54:52,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:52,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:54:52,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:52,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:52,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:52,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:52,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:52,241 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-09-04 21:54:52,241 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [577171608] [2020-09-04 21:54:52,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:54:52,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-09-04 21:54:52,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237015207] [2020-09-04 21:54:52,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 21:54:52,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:54:52,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 21:54:52,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-04 21:54:52,245 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 6 states. [2020-09-04 21:54:52,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:54:52,379 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2020-09-04 21:54:52,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 21:54:52,380 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2020-09-04 21:54:52,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:54:52,382 INFO L225 Difference]: With dead ends: 56 [2020-09-04 21:54:52,383 INFO L226 Difference]: Without dead ends: 50 [2020-09-04 21:54:52,384 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-09-04 21:54:52,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-09-04 21:54:52,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2020-09-04 21:54:52,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-09-04 21:54:52,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2020-09-04 21:54:52,403 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 34 [2020-09-04 21:54:52,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:54:52,403 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2020-09-04 21:54:52,404 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 21:54:52,404 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2020-09-04 21:54:52,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-09-04 21:54:52,406 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:54:52,406 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 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] [2020-09-04 21:54:52,407 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 21:54:52,407 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:54:52,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:54:52,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1274787059, now seen corresponding path program 2 times [2020-09-04 21:54:52,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:54:52,408 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1796396432] [2020-09-04 21:54:52,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:54:52,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:52,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:54:52,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:52,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:54:52,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:52,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:52,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:52,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:52,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:52,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:52,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:52,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:54:52,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:52,643 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-09-04 21:54:52,643 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1796396432] [2020-09-04 21:54:52,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:54:52,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-09-04 21:54:52,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493351097] [2020-09-04 21:54:52,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 21:54:52,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:54:52,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 21:54:52,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-09-04 21:54:52,646 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. Second operand 8 states. [2020-09-04 21:54:52,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:54:52,812 INFO L93 Difference]: Finished difference Result 111 states and 156 transitions. [2020-09-04 21:54:52,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 21:54:52,813 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2020-09-04 21:54:52,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:54:52,816 INFO L225 Difference]: With dead ends: 111 [2020-09-04 21:54:52,816 INFO L226 Difference]: Without dead ends: 67 [2020-09-04 21:54:52,818 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-09-04 21:54:52,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-09-04 21:54:52,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2020-09-04 21:54:52,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-09-04 21:54:52,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 70 transitions. [2020-09-04 21:54:52,836 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 70 transitions. Word has length 51 [2020-09-04 21:54:52,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:54:52,836 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 70 transitions. [2020-09-04 21:54:52,836 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 21:54:52,837 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2020-09-04 21:54:52,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-09-04 21:54:52,840 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:54:52,840 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 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] [2020-09-04 21:54:52,840 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 21:54:52,841 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:54:52,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:54:52,841 INFO L82 PathProgramCache]: Analyzing trace with hash 99184320, now seen corresponding path program 3 times [2020-09-04 21:54:52,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:54:52,842 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [807966162] [2020-09-04 21:54:52,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:54:52,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:52,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:54:52,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:52,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:54:52,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:52,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:52,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:52,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:53,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:53,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:53,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:53,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:54:53,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:53,057 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-09-04 21:54:53,058 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [807966162] [2020-09-04 21:54:53,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:54:53,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-04 21:54:53,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106924195] [2020-09-04 21:54:53,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 21:54:53,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:54:53,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 21:54:53,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-04 21:54:53,062 INFO L87 Difference]: Start difference. First operand 55 states and 70 transitions. Second operand 7 states. [2020-09-04 21:54:53,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:54:53,220 INFO L93 Difference]: Finished difference Result 89 states and 117 transitions. [2020-09-04 21:54:53,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 21:54:53,223 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2020-09-04 21:54:53,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:54:53,227 INFO L225 Difference]: With dead ends: 89 [2020-09-04 21:54:53,227 INFO L226 Difference]: Without dead ends: 83 [2020-09-04 21:54:53,228 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-09-04 21:54:53,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-09-04 21:54:53,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2020-09-04 21:54:53,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-09-04 21:54:53,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 103 transitions. [2020-09-04 21:54:53,253 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 103 transitions. Word has length 52 [2020-09-04 21:54:53,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:54:53,253 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 103 transitions. [2020-09-04 21:54:53,253 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 21:54:53,254 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 103 transitions. [2020-09-04 21:54:53,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-09-04 21:54:53,259 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:54:53,259 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:54:53,260 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 21:54:53,260 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:54:53,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:54:53,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1883941443, now seen corresponding path program 4 times [2020-09-04 21:54:53,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:54:53,261 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [718056924] [2020-09-04 21:54:53,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:54:53,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:53,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:54:53,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:53,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:54:53,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:53,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:53,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:53,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:53,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:53,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:53,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:53,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:53,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:53,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:54:53,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:53,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:54:53,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:53,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:53,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:53,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:53,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:53,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:53,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:53,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:53,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:53,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:54:53,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:53,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:54:53,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:53,653 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 130 proven. 176 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2020-09-04 21:54:53,654 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [718056924] [2020-09-04 21:54:53,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:54:53,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-09-04 21:54:53,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677155686] [2020-09-04 21:54:53,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 21:54:53,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:54:53,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 21:54:53,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-09-04 21:54:53,657 INFO L87 Difference]: Start difference. First operand 77 states and 103 transitions. Second operand 11 states. [2020-09-04 21:54:54,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:54:54,005 INFO L93 Difference]: Finished difference Result 142 states and 213 transitions. [2020-09-04 21:54:54,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-04 21:54:54,005 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 123 [2020-09-04 21:54:54,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:54:54,009 INFO L225 Difference]: With dead ends: 142 [2020-09-04 21:54:54,009 INFO L226 Difference]: Without dead ends: 73 [2020-09-04 21:54:54,012 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2020-09-04 21:54:54,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-09-04 21:54:54,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2020-09-04 21:54:54,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-09-04 21:54:54,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 83 transitions. [2020-09-04 21:54:54,027 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 83 transitions. Word has length 123 [2020-09-04 21:54:54,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:54:54,028 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 83 transitions. [2020-09-04 21:54:54,028 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 21:54:54,028 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2020-09-04 21:54:54,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2020-09-04 21:54:54,031 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:54:54,031 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 7, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:54:54,031 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 21:54:54,032 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:54:54,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:54:54,032 INFO L82 PathProgramCache]: Analyzing trace with hash 532445701, now seen corresponding path program 5 times [2020-09-04 21:54:54,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:54:54,033 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [745936954] [2020-09-04 21:54:54,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:54:54,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:54,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:54:54,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:54,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:54:54,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:54,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:54,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:54,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:54,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:54,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:54,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:54,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:54,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:54,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:54,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:54,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:54:54,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:54,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:54:54,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:54,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:54,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:54,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:54,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:54,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:54:54,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:54,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:54,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:54,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:54,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:54,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:54,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:54,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:54,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:54,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:54,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:54,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:54:54,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:54,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:54:54,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:54,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:54,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:54,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:54,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:54,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:54:54,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:54,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1318 backedges. 375 proven. 413 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2020-09-04 21:54:54,649 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [745936954] [2020-09-04 21:54:54,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:54:54,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-09-04 21:54:54,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938636352] [2020-09-04 21:54:54,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 21:54:54,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:54:54,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 21:54:54,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-09-04 21:54:54,652 INFO L87 Difference]: Start difference. First operand 70 states and 83 transitions. Second operand 13 states. [2020-09-04 21:54:55,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:54:55,121 INFO L93 Difference]: Finished difference Result 149 states and 204 transitions. [2020-09-04 21:54:55,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-09-04 21:54:55,122 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 193 [2020-09-04 21:54:55,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:54:55,124 INFO L225 Difference]: With dead ends: 149 [2020-09-04 21:54:55,124 INFO L226 Difference]: Without dead ends: 92 [2020-09-04 21:54:55,126 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=176, Invalid=580, Unknown=0, NotChecked=0, Total=756 [2020-09-04 21:54:55,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-09-04 21:54:55,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 79. [2020-09-04 21:54:55,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-09-04 21:54:55,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 94 transitions. [2020-09-04 21:54:55,143 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 94 transitions. Word has length 193 [2020-09-04 21:54:55,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:54:55,143 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 94 transitions. [2020-09-04 21:54:55,143 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 21:54:55,144 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2020-09-04 21:54:55,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-09-04 21:54:55,145 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:54:55,145 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:54:55,146 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 21:54:55,146 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:54:55,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:54:55,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1618484333, now seen corresponding path program 6 times [2020-09-04 21:54:55,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:54:55,147 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [33361376] [2020-09-04 21:54:55,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:54:55,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:55,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:54:55,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:55,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:54:55,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:55,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:55,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:55,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:55,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:55,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:55,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:55,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:55,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:55,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:55,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:55,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:54:55,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:55,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:54:55,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:55,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:55,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:55,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:55,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:55,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:54:55,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:55,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:55,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:55,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:55,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:55,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:55,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:55,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:54:55,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:55,791 INFO L134 CoverageAnalysis]: Checked inductivity of 646 backedges. 0 proven. 236 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2020-09-04 21:54:55,792 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [33361376] [2020-09-04 21:54:55,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:54:55,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-09-04 21:54:55,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723915097] [2020-09-04 21:54:55,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-04 21:54:55,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:54:55,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-04 21:54:55,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2020-09-04 21:54:55,795 INFO L87 Difference]: Start difference. First operand 79 states and 94 transitions. Second operand 16 states. [2020-09-04 21:54:56,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:54:56,253 INFO L93 Difference]: Finished difference Result 102 states and 123 transitions. [2020-09-04 21:54:56,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-09-04 21:54:56,254 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 140 [2020-09-04 21:54:56,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:54:56,256 INFO L225 Difference]: With dead ends: 102 [2020-09-04 21:54:56,256 INFO L226 Difference]: Without dead ends: 96 [2020-09-04 21:54:56,258 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2020-09-04 21:54:56,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-09-04 21:54:56,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 93. [2020-09-04 21:54:56,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-09-04 21:54:56,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 113 transitions. [2020-09-04 21:54:56,278 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 113 transitions. Word has length 140 [2020-09-04 21:54:56,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:54:56,279 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 113 transitions. [2020-09-04 21:54:56,279 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-04 21:54:56,279 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 113 transitions. [2020-09-04 21:54:56,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2020-09-04 21:54:56,282 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:54:56,282 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 15, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:54:56,282 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 21:54:56,282 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:54:56,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:54:56,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1853518064, now seen corresponding path program 7 times [2020-09-04 21:54:56,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:54:56,283 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [577310373] [2020-09-04 21:54:56,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:54:56,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:56,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:54:56,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:56,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:54:56,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:56,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:56,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:56,425 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:56,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:56,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:56,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:56,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:56,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:56,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:56,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:56,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:56,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:56,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:54:56,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:56,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:54:56,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:56,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:56,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:56,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:56,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:56,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:54:56,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:56,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:56,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:56,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:56,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:56,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2020-09-04 21:54:56,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:56,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:56,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:56,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:56,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:56,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:56,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:56,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:54:56,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:56,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1062 backedges. 285 proven. 207 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2020-09-04 21:54:56,711 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [577310373] [2020-09-04 21:54:56,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:54:56,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-09-04 21:54:56,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872670305] [2020-09-04 21:54:56,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 21:54:56,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:54:56,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 21:54:56,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-09-04 21:54:56,713 INFO L87 Difference]: Start difference. First operand 93 states and 113 transitions. Second operand 10 states. [2020-09-04 21:54:56,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:54:56,920 INFO L93 Difference]: Finished difference Result 171 states and 210 transitions. [2020-09-04 21:54:56,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-04 21:54:56,921 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 175 [2020-09-04 21:54:56,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:54:56,922 INFO L225 Difference]: With dead ends: 171 [2020-09-04 21:54:56,923 INFO L226 Difference]: Without dead ends: 88 [2020-09-04 21:54:56,924 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2020-09-04 21:54:56,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-09-04 21:54:56,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2020-09-04 21:54:56,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-09-04 21:54:56,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 98 transitions. [2020-09-04 21:54:56,951 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 98 transitions. Word has length 175 [2020-09-04 21:54:56,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:54:56,952 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 98 transitions. [2020-09-04 21:54:56,952 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 21:54:56,952 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 98 transitions. [2020-09-04 21:54:56,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2020-09-04 21:54:56,956 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:54:56,956 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 8, 8, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:54:56,956 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 21:54:56,956 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:54:56,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:54:56,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1227428144, now seen corresponding path program 8 times [2020-09-04 21:54:56,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:54:56,957 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [784447433] [2020-09-04 21:54:56,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:54:56,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:57,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:54:57,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:57,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:54:57,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:57,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:57,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:57,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:57,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:57,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:57,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:57,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:57,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:57,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:57,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:57,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:57,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:57,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:54:57,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:57,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:54:57,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:57,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:57,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:57,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:57,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:57,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:54:57,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:57,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:57,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:57,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:57,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:57,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:57,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:57,361 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:54:57,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:57,385 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-09-04 21:54:57,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:57,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:57,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:57,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:57,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:57,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:57,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:57,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:57,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:57,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:54:57,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:57,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:54:57,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:57,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:57,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:57,433 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:57,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:57,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1890 backedges. 220 proven. 488 refuted. 0 times theorem prover too weak. 1182 trivial. 0 not checked. [2020-09-04 21:54:57,533 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [784447433] [2020-09-04 21:54:57,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:54:57,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-09-04 21:54:57,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400564004] [2020-09-04 21:54:57,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 21:54:57,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:54:57,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 21:54:57,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-09-04 21:54:57,536 INFO L87 Difference]: Start difference. First operand 85 states and 98 transitions. Second operand 10 states. [2020-09-04 21:54:57,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:54:57,786 INFO L93 Difference]: Finished difference Result 165 states and 209 transitions. [2020-09-04 21:54:57,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-04 21:54:57,787 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 228 [2020-09-04 21:54:57,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:54:57,788 INFO L225 Difference]: With dead ends: 165 [2020-09-04 21:54:57,789 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 21:54:57,790 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2020-09-04 21:54:57,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 21:54:57,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 21:54:57,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 21:54:57,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 21:54:57,791 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 228 [2020-09-04 21:54:57,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:54:57,792 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 21:54:57,792 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 21:54:57,792 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 21:54:57,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 21:54:57,792 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 21:54:57,796 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 21:55:00,197 WARN L193 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 48 [2020-09-04 21:55:00,514 WARN L193 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 38 [2020-09-04 21:55:00,850 WARN L193 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 49 [2020-09-04 21:55:01,365 WARN L193 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 45 [2020-09-04 21:55:01,810 WARN L193 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 48 [2020-09-04 21:55:02,182 WARN L193 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 45 [2020-09-04 21:55:02,504 WARN L193 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 29 [2020-09-04 21:55:02,866 WARN L193 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 29 [2020-09-04 21:55:02,928 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-09-04 21:55:02,929 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-09-04 21:55:02,929 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-09-04 21:55:02,930 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-09-04 21:55:02,930 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-04 21:55:02,931 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-09-04 21:55:02,931 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 27) the Hoare annotation is: false [2020-09-04 21:55:02,931 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 23 30) the Hoare annotation is: true [2020-09-04 21:55:02,931 INFO L264 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: false [2020-09-04 21:55:02,932 INFO L264 CegarLoopResult]: At program point L26(lines 26 28) the Hoare annotation is: (and (<= main_~x~0 5) (<= 5 main_~x~0) (<= 5 main_~result~0) (<= main_~result~0 5)) [2020-09-04 21:55:02,932 INFO L264 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (and (<= main_~x~0 5) (<= 5 main_~x~0)) [2020-09-04 21:55:02,932 INFO L264 CegarLoopResult]: At program point mainEXIT(lines 23 30) the Hoare annotation is: (<= 5 main_~x~0) [2020-09-04 21:55:02,932 INFO L264 CegarLoopResult]: At program point L25-1(line 25) the Hoare annotation is: (and (<= |main_#t~ret2| 5) (<= main_~x~0 5) (<= 5 |main_#t~ret2|) (<= 5 main_~x~0)) [2020-09-04 21:55:02,932 INFO L264 CegarLoopResult]: At program point L26-2(lines 26 28) the Hoare annotation is: (<= 5 main_~x~0) [2020-09-04 21:55:02,933 INFO L264 CegarLoopResult]: At program point L25-2(line 25) the Hoare annotation is: (and (<= |main_#t~ret2| 5) (<= main_~x~0 5) (<= 5 |main_#t~ret2|) (<= 5 main_~x~0)) [2020-09-04 21:55:02,934 INFO L264 CegarLoopResult]: At program point L25-3(line 25) the Hoare annotation is: (and (<= |main_#t~ret2| 5) (<= main_~x~0 5) (<= 5 |main_#t~ret2|) (<= 5 main_~x~0) (<= 5 main_~result~0) (<= main_~result~0 5)) [2020-09-04 21:55:02,935 INFO L264 CegarLoopResult]: At program point mainFINAL(lines 23 30) the Hoare annotation is: (<= 5 main_~x~0) [2020-09-04 21:55:02,935 INFO L264 CegarLoopResult]: At program point fiboEXIT(lines 5 13) the Hoare annotation is: (let ((.cse4 (= fibo_~n |fibo_#in~n|))) (let ((.cse0 (<= 1 |fibo_#res|)) (.cse1 (<= |fibo_#res| 1)) (.cse2 (and .cse4 (<= 6 |fibo_#in~n|))) (.cse3 (and (<= 5 |fibo_#res|) (<= 5 |fibo_#in~n|) .cse4 (<= |fibo_#res| 5)))) (and (or (and .cse0 .cse1) (<= |fibo_#in~n| 0) (not (<= |fibo_#in~n| 1))) (or .cse2 .cse3 (and (<= |fibo_#in~n| 4) (<= 4 |fibo_#in~n|)) (not (<= 2 |fibo_#in~n|)) (and (<= 2 |fibo_#res|) (<= |fibo_#res| 2) (<= 3 |fibo_#in~n|)) (and .cse0 .cse1 (<= |fibo_#in~n| 2))) (or (and (<= 0 |fibo_#res|) (<= |fibo_#res| 0)) (<= 1 |fibo_#in~n|)) (or .cse2 .cse3 (and .cse4 (<= |fibo_#in~n| 3)) (and (<= |fibo_#res| 3) .cse4 (<= 3 |fibo_#res|)))))) [2020-09-04 21:55:02,935 INFO L264 CegarLoopResult]: At program point fiboFINAL(lines 5 13) the Hoare annotation is: (let ((.cse4 (= fibo_~n |fibo_#in~n|))) (let ((.cse0 (<= 1 |fibo_#res|)) (.cse1 (<= |fibo_#res| 1)) (.cse2 (and .cse4 (<= 6 |fibo_#in~n|))) (.cse3 (and (<= 5 |fibo_#res|) (<= 5 |fibo_#in~n|) .cse4 (<= |fibo_#res| 5)))) (and (or (and .cse0 .cse1) (<= |fibo_#in~n| 0) (not (<= |fibo_#in~n| 1))) (or .cse2 .cse3 (and (<= |fibo_#in~n| 4) (<= 4 |fibo_#in~n|)) (not (<= 2 |fibo_#in~n|)) (and (<= 2 |fibo_#res|) (<= |fibo_#res| 2) (<= 3 |fibo_#in~n|)) (and .cse0 .cse1 (<= |fibo_#in~n| 2))) (or (and (<= 0 |fibo_#res|) (<= |fibo_#res| 0)) (<= 1 |fibo_#in~n|)) (or .cse2 .cse3 (and .cse4 (<= |fibo_#in~n| 3)) (and (<= |fibo_#res| 3) .cse4 (<= 3 |fibo_#res|)))))) [2020-09-04 21:55:02,936 INFO L264 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: (and (not (<= |fibo_#in~n| 1)) (= fibo_~n |fibo_#in~n|)) [2020-09-04 21:55:02,936 INFO L264 CegarLoopResult]: At program point L11-1(line 11) the Hoare annotation is: (and (let ((.cse0 (= fibo_~n |fibo_#in~n|))) (or (and (<= 1 |fibo_#t~ret0|) (<= |fibo_#t~ret0| 1) .cse0 (<= |fibo_#in~n| 3)) (and .cse0 (<= 6 |fibo_#in~n|)) (and (<= 3 |fibo_#t~ret0|) (<= 5 |fibo_#in~n|) (<= |fibo_#t~ret0| 3) .cse0) (and (<= |fibo_#in~n| 4) (<= 2 |fibo_#t~ret0|) (<= |fibo_#t~ret0| 2) .cse0 (<= 4 |fibo_#in~n|)))) (not (<= |fibo_#in~n| 1))) [2020-09-04 21:55:02,936 INFO L264 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: (and (<= |fibo_#in~n| 1) (= fibo_~n |fibo_#in~n|) (<= 1 |fibo_#in~n|)) [2020-09-04 21:55:02,937 INFO L264 CegarLoopResult]: At program point L11-2(line 11) the Hoare annotation is: (and (let ((.cse0 (= fibo_~n |fibo_#in~n|))) (or (and (<= 1 |fibo_#t~ret0|) (<= |fibo_#t~ret0| 1) .cse0 (<= |fibo_#in~n| 3)) (and .cse0 (<= 6 |fibo_#in~n|)) (and (<= 3 |fibo_#t~ret0|) (<= 5 |fibo_#in~n|) (<= |fibo_#t~ret0| 3) .cse0) (and (<= |fibo_#in~n| 4) (<= 2 |fibo_#t~ret0|) (<= |fibo_#t~ret0| 2) .cse0 (<= 4 |fibo_#in~n|)))) (not (<= |fibo_#in~n| 1))) [2020-09-04 21:55:02,937 INFO L264 CegarLoopResult]: At program point L8(lines 8 12) the Hoare annotation is: (and (= fibo_~n |fibo_#in~n|) (<= 1 |fibo_#in~n|)) [2020-09-04 21:55:02,937 INFO L264 CegarLoopResult]: At program point L11-3(line 11) the Hoare annotation is: (let ((.cse2 (<= 1 |fibo_#t~ret0|)) (.cse0 (+ |fibo_#t~ret0| |fibo_#t~ret1|)) (.cse3 (<= |fibo_#t~ret0| 1)) (.cse1 (= fibo_~n |fibo_#in~n|))) (and (or (and (<= 3 |fibo_#t~ret0|) (<= .cse0 5) (<= 5 |fibo_#in~n|) (<= |fibo_#t~ret0| 3) (<= 5 .cse0) .cse1) (and .cse1 (<= 6 |fibo_#in~n|)) (and (<= 2 .cse0) .cse2 (<= .cse0 2) .cse3 .cse1 (<= |fibo_#in~n| 3)) (and (<= |fibo_#in~n| 4) (<= .cse0 3) (<= 2 |fibo_#t~ret0|) (<= |fibo_#t~ret0| 2) .cse1 (<= 3 .cse0) (<= 4 |fibo_#in~n|)) (not (<= 3 |fibo_#in~n|))) (not (<= |fibo_#in~n| 1)) (or (not (<= |fibo_#in~n| 2)) (and .cse2 (<= 1 .cse0) (<= .cse0 1) .cse3 .cse1)))) [2020-09-04 21:55:02,937 INFO L264 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: (and (<= |fibo_#in~n| 0) (= fibo_~n |fibo_#in~n|)) [2020-09-04 21:55:02,938 INFO L264 CegarLoopResult]: At program point L11-4(line 11) the Hoare annotation is: (let ((.cse2 (<= 1 |fibo_#t~ret0|)) (.cse0 (+ |fibo_#t~ret0| |fibo_#t~ret1|)) (.cse3 (<= |fibo_#t~ret0| 1)) (.cse1 (= fibo_~n |fibo_#in~n|))) (and (or (and (<= 3 |fibo_#t~ret0|) (<= .cse0 5) (<= 5 |fibo_#in~n|) (<= |fibo_#t~ret0| 3) (<= 5 .cse0) .cse1) (and .cse1 (<= 6 |fibo_#in~n|)) (and (<= 2 .cse0) .cse2 (<= .cse0 2) .cse3 .cse1 (<= |fibo_#in~n| 3)) (and (<= |fibo_#in~n| 4) (<= .cse0 3) (<= 2 |fibo_#t~ret0|) (<= |fibo_#t~ret0| 2) .cse1 (<= 3 .cse0) (<= 4 |fibo_#in~n|)) (not (<= 3 |fibo_#in~n|))) (not (<= |fibo_#in~n| 1)) (or (not (<= |fibo_#in~n| 2)) (and .cse2 (<= 1 .cse0) (<= .cse0 1) .cse3 .cse1)))) [2020-09-04 21:55:02,938 INFO L264 CegarLoopResult]: At program point L6(lines 6 12) the Hoare annotation is: (= fibo_~n |fibo_#in~n|) [2020-09-04 21:55:02,938 INFO L264 CegarLoopResult]: At program point L11-5(line 11) the Hoare annotation is: (let ((.cse2 (<= 1 |fibo_#t~ret0|)) (.cse3 (<= |fibo_#t~ret0| 1)) (.cse1 (= fibo_~n |fibo_#in~n|)) (.cse0 (+ |fibo_#t~ret0| |fibo_#t~ret1|))) (or (and (<= 3 |fibo_#t~ret0|) (<= 5 |fibo_#res|) (<= .cse0 5) (<= 5 |fibo_#in~n|) (<= |fibo_#t~ret0| 3) (<= 5 .cse0) .cse1 (<= |fibo_#res| 5)) (and (<= 2 .cse0) .cse2 (<= 2 |fibo_#res|) (<= .cse0 2) .cse3 (<= |fibo_#res| 2) .cse1 (<= 3 |fibo_#in~n|) (<= |fibo_#in~n| 3)) (and (<= 1 |fibo_#res|) .cse2 (<= 1 .cse0) (<= .cse0 1) (<= 2 |fibo_#in~n|) .cse3 (<= |fibo_#res| 1) (<= |fibo_#in~n| 2) .cse1) (and .cse1 (<= 6 |fibo_#in~n|)) (and (<= fibo_~n 4) (<= .cse0 3) (<= 2 |fibo_#t~ret0|) (<= |fibo_#res| 3) (<= |fibo_#t~ret0| 2) .cse1 (<= 3 .cse0) (<= 3 |fibo_#res|) (<= 4 |fibo_#in~n|)))) [2020-09-04 21:55:02,938 INFO L271 CegarLoopResult]: At program point fiboENTRY(lines 5 13) the Hoare annotation is: true [2020-09-04 21:55:02,939 INFO L264 CegarLoopResult]: At program point L11-6(line 11) the Hoare annotation is: (let ((.cse0 (<= |fibo_#in~n| 3))) (and (or (not (<= 3 |fibo_#in~n|)) (not .cse0) (and (<= 2 |fibo_#res|) (<= |fibo_#res| 2))) (let ((.cse1 (= fibo_~n |fibo_#in~n|))) (or (and .cse1 (<= 6 |fibo_#in~n|)) (and (<= |fibo_#in~n| 4) (<= |fibo_#res| 3) .cse1 (<= 3 |fibo_#res|)) (and (<= 5 |fibo_#res|) (<= 5 |fibo_#in~n|) .cse1 (<= |fibo_#res| 5)) (and .cse1 .cse0))) (or (not (<= |fibo_#in~n| 2)) (and (<= 1 |fibo_#res|) (<= 2 |fibo_#in~n|) (<= |fibo_#res| 1))))) [2020-09-04 21:55:02,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 09:55:02 BoogieIcfgContainer [2020-09-04 21:55:02,984 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 21:55:02,986 INFO L168 Benchmark]: Toolchain (without parser) took 12986.23 ms. Allocated memory was 136.8 MB in the beginning and 415.8 MB in the end (delta: 278.9 MB). Free memory was 101.7 MB in the beginning and 329.4 MB in the end (delta: -227.7 MB). Peak memory consumption was 261.2 MB. Max. memory is 7.1 GB. [2020-09-04 21:55:02,993 INFO L168 Benchmark]: CDTParser took 0.93 ms. Allocated memory is still 136.8 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-09-04 21:55:02,996 INFO L168 Benchmark]: CACSL2BoogieTranslator took 311.69 ms. Allocated memory is still 136.8 MB. Free memory was 101.5 MB in the beginning and 92.1 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2020-09-04 21:55:02,998 INFO L168 Benchmark]: Boogie Preprocessor took 33.76 ms. Allocated memory is still 136.8 MB. Free memory was 92.1 MB in the beginning and 90.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-09-04 21:55:02,999 INFO L168 Benchmark]: RCFGBuilder took 428.64 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 90.7 MB in the beginning and 167.9 MB in the end (delta: -77.2 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2020-09-04 21:55:03,002 INFO L168 Benchmark]: TraceAbstraction took 12191.78 ms. Allocated memory was 200.8 MB in the beginning and 415.8 MB in the end (delta: 215.0 MB). Free memory was 167.2 MB in the beginning and 329.4 MB in the end (delta: -162.1 MB). Peak memory consumption was 262.8 MB. Max. memory is 7.1 GB. [2020-09-04 21:55:03,012 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.93 ms. Allocated memory is still 136.8 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 311.69 ms. Allocated memory is still 136.8 MB. Free memory was 101.5 MB in the beginning and 92.1 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 33.76 ms. Allocated memory is still 136.8 MB. Free memory was 92.1 MB in the beginning and 90.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 428.64 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 90.7 MB in the beginning and 167.9 MB in the end (delta: -77.2 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12191.78 ms. Allocated memory was 200.8 MB in the beginning and 415.8 MB in the end (delta: 215.0 MB). Free memory was 167.2 MB in the beginning and 329.4 MB in the end (delta: -162.1 MB). Peak memory consumption was 262.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 27]: 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: 23]: Procedure Contract for main Derived contract for procedure main: 5 <= x - ProcedureContractResult [Line: 5]: Procedure Contract for fibo Derived contract for procedure fibo: (((((1 <= \result && \result <= 1) || \old(n) <= 0) || !(\old(n) <= 1)) && ((((((n == \old(n) && 6 <= \old(n)) || (((5 <= \result && 5 <= \old(n)) && n == \old(n)) && \result <= 5)) || (\old(n) <= 4 && 4 <= \old(n))) || !(2 <= \old(n))) || ((2 <= \result && \result <= 2) && 3 <= \old(n))) || ((1 <= \result && \result <= 1) && \old(n) <= 2))) && ((0 <= \result && \result <= 0) || 1 <= \old(n))) && ((((n == \old(n) && 6 <= \old(n)) || (((5 <= \result && 5 <= \old(n)) && n == \old(n)) && \result <= 5)) || (n == \old(n) && \old(n) <= 3)) || ((\result <= 3 && n == \old(n)) && 3 <= \result)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 6.8s, OverallIterations: 11, TraceHistogramMax: 25, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 361 SDtfs, 477 SDslu, 1411 SDs, 0 SdLazy, 1229 SolverSat, 212 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 429 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 42 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 31 LocationsWithAnnotation, 745 PreInvPairs, 1292 NumberOfFragments, 897 HoareAnnotationTreeSize, 745 FomulaSimplifications, 7860 FormulaSimplificationTreeSizeReduction, 2.0s HoareSimplificationTime, 31 FomulaSimplificationsInter, 7790 FormulaSimplificationTreeSizeReductionInter, 3.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1062 NumberOfCodeBlocks, 1062 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1051 ConstructedInterpolants, 0 QuantifiedInterpolants, 326277 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 PerfectInterpolantSequences, 3965/5530 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...